direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Motion Planning

Motion Planning is the task of finding a way to move a robot from one position to another while avoiding obstacles. To do this, we need to find a trajectory in the space of all possible robot configurations. For a robot with several joints, this search space is high dimensional and very complex. Even for simple two-dimensional spaces, general motion planning is NP-hard.

We think that a successful and fast motion planning algorithm has to balance between two general planning strategies: Exploration and exploitation. Exploration tries to obtain information about the connectivity of the space without considering any specific goal. This is typically done by sampling the space and connecting sampled configurations as a graph. This approach theoretically solves the motion planning problem but results in unacceptably long run times. Exploitation tries to find a valid path to a specific goal, using the available information. This can be done by constructing artificial forces that drag the robot towards the goal and away from obstacles. This is a very efficient approach, but unfortunately it always fails if the collected information is insufficient.

In our motion planners, we use several sources of information to balance exploration and exploitation. Utility-guided sampling apply guided exploration by choosing samples with maximal expected utility. This approach gives us a good understanding of connectivity using much less samples than other approaches. Disassembly planning uses the 3D-workspace connectivity to identify the regions of the configuration space where a detailed search is needed. This connectivity can be obtained by expanding the workspace with a tree of bubbles. The same workspace information is used in our Exploring/Exploiting Tree .In easy regions we use the workspace information as a navigation function to drag the robot along the spheres. If this approach fails in hard regions, we gradually shift to exploration.



Further Reading


[1] S. M. LaValle. Planning Algorithms. Cambridge University Press, Cambridge, U.K., 2006, Available at http://planning.cs.uiuc.edu.

 

Funding

Bild
Lupe

Alexander von Humboldt professorship - awarded by the Alexander von Humboldt foundation and funded through the Ministry of Education and Research, BMBF,
July 2009 - June 2014  

Bild
Lupe
Bild
Lupe

Flexible Skill Acquisitionen and Intuitive Robot Tasking for Mobile Manipulation in the Real World (First MM) - funded by European Commision, in the program Cognitive Systems and Robotics,
award number FP7-ICT-248258,
February 2010 - July 2013

Publications

Markus Rickert, Oliver Brock, and Alois Knoll. Balancing Exploration and Exploitation in Motion Planning. IEEE International Conference on Robotics and Automation, pp. 2812-2817, 2008.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Sampling-Based Motion Planning with Sensing Uncertainty. IEEE International Conference on Robotics and Automation, 2007.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Single-Query Motion Planning with Utility-Guided Random Trees. In Proceedings of the IEEE International Conference on Robotics and Automation, 2007.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Utility-Guided Random Trees. Technical Report TR-06-29, Department of Computer Science, University of Massachusetts Amherst, 2006.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Sampling-Based Motion Planning Using Uncertain Knowledge. Technical Report TR-06-30, Department of Computer Science, University of Massachusetts Amherst, 2006.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Single-Query Entropy-Guided Path Planning. Proceedings of the International Conference on Advanced Robotics, pp. 2124-2129, 2005.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Toward Optimal Configuration Space Sampling. Proceedings of Robotics: Science and Systems, pp. 105-112, 2005.

Download Bibtex entry

Yuandong Yang, and Oliver Brock. Efficient Motion Planning Based on Disassembly. Proceedings of Robotics: Science and Systems, Cambridge, pp. 01-08, 2005.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Model-Based Motion Planning. TR-04-32, Department of Computer Science, University of Massachusetts Amherst, 2004.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Single-Query Entropy-Guided Motion Planning. Technical Report TR-04-76, Department of Computer Science, University of Massachusetts Amherst, 2004.

Download Bibtex entry

Yuandong Yang, and Oliver Brock. Viewing Motion Planning as Disassembly: A Decomposition-Based Approach for Non-Stationary Robots. Technical Report TR-04-108, Department of Computer Science, University of Massachusetts Amherst, 2004.

Download Bibtex entry

Brendan Burns, and Oliver Brock. Information Theoretic Construction of Probabilistic Roadmaps. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 650-655, 2003.

Download Bibtex entry

Oliver Brock, and Lydia E. Kavraki. Decomposition-based Motion Planning: A Framework for Real-time Motion Planning in High-dimensional Configuration Spaces. Proceedings of the International Conference on Advanced Robotics, pp. 1469-1474, 2001.

Download Bibtex entry

Oliver Brock, and Lydia E. Kavraki. Towards Real-time Motion Planning in High-dimensional Configuration Spaces. Proceedings of the International Symposium on Robotics and Automation, pp. 81-86, 2000.

Download Bibtex entry

Oliver Brock, and Lydia E. Kavraki. Towards Real-time Motion Planning for Robots with Many Degrees of Freedom. International Conference, Robotics and Automation, pp. 01-30, 2000.

Download Bibtex entry


To top

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions