A multi-tree extension of the transition-based RRT: Application to ordering-and-pathfinding problems in continuous cost spaces

The Transition-based RRT (T-RRT) is a variant of RRT developed for path planning on a continuous cost space, i.e. a configuration space featuring a continuous cost function. It has been used to solve complex, high-dimensional problems in robotics and structural biology. In this paper, we propose a multiple-tree variant of T-RRT, named Multi-T-RRT. It is especially useful to solve ordering-and-pathfinding problems, i.e. to compute a path going through several unordered way-points. Using the Multi-T-RRT, such problems can be solved from a purely geometrical perspective, without having to use a symbolic task planner. We evaluate the Multi-T-RRT on several path planning problems and compare it to other path planners. Finally, we apply the Multi-T-RRT to a concrete industrial inspection problem involving an aerial robot.

[1]  Wheeler Ruml,et al.  Integrating Vehicle Routing and Motion Planning , 2012, ICAPS.

[2]  Mark H. Overmars,et al.  Useful cycles in probabilistic roadmap graphs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[4]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

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

[6]  Didier Devaurs,et al.  Efficient Sampling-Based Approaches to Optimal Path Planning in Complex Cost Spaces , 2014, WAFR.

[7]  Didier Devaurs,et al.  Enhancing the transition-based RRT to deal with complex cost spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[8]  Thierry Siméon,et al.  Manipulation Planning with Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[9]  Kostas E. Bekris,et al.  Sampling-based roadmap of trees for parallel motion planning , 2005, IEEE Transactions on Robotics.

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

[11]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[12]  Nancy M. Amato,et al.  Improving the connectivity of PRM roadmaps , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[13]  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).

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

[15]  Juan Cortés,et al.  Randomized tree construction algorithm to explore energy landscapes , 2011, J. Comput. Chem..

[16]  Vijay Kumar,et al.  Adaptive RRTs for Validating Hybrid Robotic Control Systems , 2004, WAFR.

[17]  Wei Wang,et al.  An adaptive roadmap guided Multi-RRTs strategy for single query path planning , 2010, 2010 IEEE International Conference on Robotics and Automation.

[18]  Tsai-Yen Li,et al.  An incremental learning approach to motion planning with roadmap management , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[19]  Patrick G. Xavier,et al.  Lazy Reconfiguration Forest (LRF) - An Approach for Motion Planning with Multiple Tasks in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[20]  Leslie Pack Kaelbling,et al.  Hierarchical task and motion planning in the now , 2011, 2011 IEEE International Conference on Robotics and Automation.

[21]  Michel Taïx,et al.  Improving motion planning in weakly connected configuration spaces , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[22]  Wei Wang,et al.  Triple RRTs: An Effective Method for Path Planning in Narrow Passages , 2010, Adv. Robotics.

[23]  M. Strandberg,et al.  Augmenting RRT-planners with local trees , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[24]  N. Kwok,et al.  Evaluating Performance of Multiple RRTs , 2008, 2008 IEEE/ASME International Conference on Mechtronic and Embedded Systems and Applications.

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

[26]  James J. Kuffner,et al.  Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[27]  T. Siméon,et al.  Costmap planning in high dimensional configuration spaces , 2012, 2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM).

[28]  Rachid Alami,et al.  A Hybrid Approach to Intricate Motion, Manipulation and Task Planning , 2009, Int. J. Robotics Res..

[29]  Vijay Kumar,et al.  Computational Techniques for Analysis of Genetic Network Dynamics , 2005, Int. J. Robotics Res..

[30]  Kostas E. Bekris,et al.  Towards small asymptotically near-optimal roadmaps , 2012, 2012 IEEE International Conference on Robotics and Automation.

[31]  Steven M. LaValle,et al.  Planning algorithms , 2006 .