Constellation - An Algorithm for Finding Robot Configurations that Satisfy Multiple Constraints

Peter Kaiser, Dmitry Berenson, Nikolaus Vahrenkamp, Tamim Asfour, Rudiger Dillmann, and Siddhartha Srinivasa
IEEE International Conference on Robotics and Automation (ICRA '12), May, 2012.


Download
  • Adobe portable document format (pdf) (673KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
Planning motion for humanoid robots requires obeying simultaneous constraints on balance, collisionavoidance, and end-effector pose, among others. Several algorithms are able to generate configurations that satisfy these constraints given a good initial guess, i.e. a configuration which is already close to satisfying the constraints. However, when selecting goals for a planner a close initial guess is rarely available. Methods that attempt to satisfy all constraints through direct projection from a distant initial guess often fail due to opposing gradients for the various constraints, joint-limits, or singularities. We approach the problem of generating a constrained goal by searching for a configuration in the intersection of all constraint manifolds in configuration space (C-space). Starting with an initial guess, our algorithm, Constellation, builds a graph in C-space whose nodes are configurations that satisfy one or more constraints and whose cycles determine where the algorithm explores next. We compare the performance of our approach to direct projection and a previously-proposed cyclic projection method on reaching tasks for a humanoid robot with 33 DOF. We find that Constellation performs the best in terms of the number of solved queries across a wide range of problem difficulty. However, this success comes at higher computational cost.

Keywords
motion planning, inverse kinematics, HERB, robot, personal robotics

Notes
Sponsor: National Science Foundation
Associated Center(s) / Consortia: Quality of Life Technology Center, National Robotics Engineering Center, and Center for the Foundations of Robotics
Associated Lab(s) / Group(s): Personal Robotics

Text Reference
Peter Kaiser, Dmitry Berenson, Nikolaus Vahrenkamp, Tamim Asfour, Rudiger Dillmann, and Siddhartha Srinivasa, "Constellation - An Algorithm for Finding Robot Configurations that Satisfy Multiple Constraints," IEEE International Conference on Robotics and Automation (ICRA '12), May, 2012.

BibTeX Reference
@inproceedings{Kaiser_2012_6987,
   author = "Peter Kaiser and Dmitry Berenson and Nikolaus Vahrenkamp and Tamim Asfour and Rudiger Dillmann and Siddhartha Srinivasa",
   editor = "IEEE",
   title = "Constellation - An Algorithm for Finding Robot Configurations that Satisfy Multiple Constraints",
   booktitle = "IEEE International Conference on Robotics and Automation (ICRA '12)",
   month = "May",
   year = "2012",
}