Reconfiguration Planning Among Obstacles for Heterogeneous Self-Reconfiguring Robots

Most reconfiguration planners for self-reconfiguring robots do not consider the placement of specific modules within the configuration. Recently, we have begun to investigate heterogeneous reconfiguration planning in lattice-based systems, in which there are various classes of modules. The start and goal configurations specify the class of each module, in addition to placement. Our previous work presents solutions for this problem with unrestricted free space available to the robot during reconfiguration, and also free space limited to a thin connected region over the entire surface of the configuration. In this paper, we further this restriction and define free space by an arbitrarily-shaped bounding region. This addresses the important problem of reconfiguration among obstacles, and reconfiguration over a rigid surface. Our algorithm plans module trajectories through the volume of the structure, and is divided into two phases: shape-forming, and sorting the goal configuration to correctly position modules by class. The worst-case running time for the first phase is O(n2) with O(n2) moves for an n-module robot, and a loose upper bound for the second phase is O(n4) time and moves. However, we show this bound to be Θ (n2)time and moves in common instances.

[1]  Nancy M. Amato,et al.  Concurrent metamorphosis of hexagonal robot chains into simple connected configurations , 2002, IEEE Trans. Robotics Autom..

[2]  Zack J. Butler,et al.  Generic Decentralized Control for Lattice-Based Self-Reconfigurable Robots , 2004, Int. J. Robotics Res..

[3]  Marios Mavronicolas,et al.  Game Theory Meets Theoretical Computer Science , 2005, Theor. Comput. Sci..

[4]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[5]  Eiichi Yoshida,et al.  Hardware design of modular robotic system , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[6]  Daniela Rus,et al.  Self-reconfiguring robots: designs, algorithms, and applications , 2004 .

[7]  Robert Fitch,et al.  Heterogeneous Self-Reconfiguring Robotics , 2004 .

[8]  Radhika Nagpal,et al.  Self-Reconfiguration Using Directed Growth , 2004, DARS.

[9]  Zack J. Butler,et al.  Distributed Planning and Control for Modular Robots with Unit-Compressible Modules , 2003, Int. J. Robotics Res..

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

[11]  Pradeep K. Khosla,et al.  Mechatronic design of a modular self-reconfiguring robotic system , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Daniela Rus,et al.  Locomotion versatility through self-reconfiguration , 1999, Robotics Auton. Syst..

[13]  Zack J. Butler,et al.  Distributed motion planning for modular robots with unit-compressible modules , 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).

[14]  Zack J. Butler,et al.  Reconfiguration planning for heterogeneous self-reconfiguring robots , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[15]  Ying Zhang,et al.  Distributed Control for 3D Metamorphosis , 2001, Auton. Robots.

[16]  Gregory S. Chirikjian,et al.  Design And Implementation Of Metamorphic Robots , 1996 .

[17]  Robert Fitch,et al.  In-Place Distributed Heterogeneous Reconfiguration Planning , 2004, DARS.

[18]  Z. Butler,et al.  Generic Decentralized Locomotion Control for Lattice-Based Self-Reconfigurable Robots , 2004 .

[19]  Hajime Asama,et al.  Self-organizing collective robots with morphogenesis in a vertical plane , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

[21]  Zack J. Butler,et al.  3D rectilinear motion planning with minimum bend paths , 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).

[22]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[23]  Sergei Vassilvitskii,et al.  A complete, local and parallel reconfiguration algorithm for cube style modular robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[24]  Marsette Vona,et al.  Crystalline Robots: Self-Reconfiguration with Compressible Unit Modules , 2001, Auton. Robots.