ICRA 2012 Paper Abstract


Paper TuA310.1

Kaiser, Peter (Karlsruhe Institute of Technology), Berenson, Dmitry (University of California, Berkeley), Vahrenkamp, Nikolaus (Karlsruhe Institute of Technology (KIT)), Asfour, Tamim (Karlsruhe Institute of Technology (KIT)), Dillmann, Rüdiger (KIT Karlsruhe Institute for Technology), Srinivasa, Siddhartha (Carnegie Mellon University)

Constellation - an Algorithm for Finding Robot Configurations That Satisfy Multiple Constraints

Scheduled for presentation during the Interactive Session "Interactive Session TuA-3" (TuA310), Tuesday, May 15, 2012, 09:30−10:00, Ballroom D

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on November 14, 2018

Keywords Motion and Path Planning, Humanoid Robots


Planning motion for humanoid robots requires obeying simultaneous constraints on balance, collision-avoidance, 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.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2018 PaperCept, Inc.
Page generated 2018-11-14  07:28:12 PST  Terms of use