Costmap planning in high dimensional configuration spaces

For many applications, path planning algorithms are expected to compute not only feasible paths, but good-quality solutions with respect to a cost function defined over the configuration space. Although several algorithms have been proposed recently for computing good-quality paths, their practical applicability is mostly limited to low-dimensional problems. This paper extends the applicability of one of such algorithms, T-RRT, to higher-dimensional problems. To this end, we propose to introduce ideas from the ML-RRT algorithm, which can efficiently solve high-dimensional path planning problems by relying on a hierarchical partitioning of the configuration space parameters. Simulation results show the good performance of the new costmap planner, MLT-RRT, for solving problems involving up to several hundreds of degrees of freedom.

[1]  T. Steitz,et al.  Ligand-induced conformational changes in proteins. , 1983, Ciba Foundation symposium.

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  Berend Smit,et al.  Understanding molecular simulation: from algorithms to applications , 1996 .

[4]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[5]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  J.-P. Laumond,et al.  Move3D: A generic platform for path planning , 2001, Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560).

[7]  Reid G. Simmons,et al.  Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[8]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[9]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[10]  Hannes Bleuler,et al.  Randomised Rough-Terrain Robot Motion Planning , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Thierry Siméon,et al.  Disassembly Path Planning for Complex Articulated Objects , 2007, IEEE Transactions on Robotics.

[12]  Jinhan Lee,et al.  Cost based planning with RRT in outdoor environments , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Russ Tedrake,et al.  Path planning in 1000+ dimensions using a task-space Voronoi bias , 2009, 2009 IEEE International Conference on Robotics and Automation.

[14]  Thierry Siméon,et al.  Sampling-Based Path Planning on Configuration-Space Costmaps , 2010, IEEE Transactions on Robotics.

[15]  Thierry Siméon,et al.  Simulating ligand-induced conformational changes in proteins using a mechanical disassembly method. , 2010, Physical chemistry chemical physics : PCCP.

[16]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

[17]  Nancy M. Amato,et al.  Reachable Distance Space: Efficient Sampling-Based Planning for Spatially Constrained Systems , 2010, Int. J. Robotics Res..

[18]  Siddhartha S. Srinivasa,et al.  Addressing cost-space chasms in manipulation planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[19]  Rachid Alami,et al.  Planning human-aware motions using a sampling-based costmap planner , 2011, 2011 IEEE International Conference on Robotics and Automation.