Comparison of A and RRT-Connect Motion Planning Techniques for Self-Reconfiguration Planning

This paper presents a comparison between two different algorithms for self-reconfiguration planning on modular self-reconfigurable robots. The two algorithms are A* and RRT-Connect. A* has often been used for self-reconfiguration planning on different systems, but so far no work has been done to show that A* is an optimal or even a good choice for this task. The RRT-connect algorithm is adopted from traditional robot motion planning and is easily adapted to self-reconfiguration planning. The results show that RRT-connect is significantly faster than A* for difficult self-reconfiguration problems. In most cases RRT-connect generates longer paths that A* it is, however, possible to optimize the paths from RRT-connect by a simple and efficient method such that the difference is negligible

[1]  Henrik Hautop Lund,et al.  Modular ATRON: modules for a self-reconfigurable robot , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[2]  David Johan Christensen,et al.  Metamodule Control for the ATRON Self-Reconfigurable Robotic System , 2004 .

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

[4]  Arancha Casal,et al.  Self-reconfiguration planning for a class of modular robots , 1999, Optics East.

[5]  Pradeep K. Khosla,et al.  A hierarchical motion planning strategy for a uniform self-reconfigurable modular robotic system , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[6]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[7]  Eiichi Yoshida,et al.  A motion planning method for a self-reconfigurable modular robot , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[8]  Gregory S. Chirikjian,et al.  Useful metrics for modular robot motion planning , 1997, IEEE Trans. Robotics Autom..

[9]  Zack J. Butler,et al.  Generic decentralized control for a class of self-reconfigurable robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[10]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[11]  David Brandt,et al.  Behaviour Subdivision and Generalization of Rules in Rule-Based Control of the ATRON Self-Reconfigurable Robot , 2005 .

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