Choosing good paths for fast distributed reconfiguration of hexagonal metamorphic robots

The problem addressed is the distributed reconfiguration of a metamorphic robot system composed of any number of two dimensional robots (modules) front specific initial to specific goal configurations. The initial configuration we consider is a straight chain of modules, while the goal configuration satisfies a simple admissibility condition. Reconfiguration of the modules depends on finding a contiguous path of cells, called a substrate path, that spans the goal configuration. Modules fill in this substrate path and then move along the path to fill in the remainder of the goal without collision or deadlock. In this paper, we examine the problem of finding the substrate path most likely to result in fast parallel reconfiguration, drawing on results from our previous papers (2000, 2001). Admissible goal configurations are represented as directed acyclic graphs (DAGs). We present a combination graph traversal-weighting algorithm that traverses all paths in the rooted DAG and use this algorithm to determine the best substrate path. We extend our definition of admissible substrate paths to consider admissible obstacle surfaces for reconfiguration when obstacles are present in the environment.

[1]  Mark H. Yim,et al.  Rhombic dodecahedron shape for self-assembling robots , 1997 .

[2]  Gregory S. Chirikjian,et al.  Bounds for self-reconfiguration of metamorphic robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Nancy M. Amato,et al.  Distributed reconfigurtion of metamorphic robot chains , 2000, PODC.

[4]  Gregory S. Chirikjian,et al.  Kinematics of a metamorphic robotic system , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Amit Pamecha,et al.  Bounds for Self-Recon guration of Metamorphic Robots , 1995 .

[6]  Eiichi Yoshida,et al.  A 3-D self-reconfigurable structure , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[7]  Leonidas J. Guibas.  Controlled Module Density Helps Reconfiguration Planning , 2000 .

[8]  H. Kurokawa,et al.  Self-assembling machine , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[9]  Nancy M. Amato,et al.  Distributed reconfiguration of metamorphic robot chains , 2004, PODC '00.

[10]  Daniela Rus,et al.  Motion synthesis for the self-reconfiguring molecule , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[11]  Zack J. Butler,et al.  Distributed Motion Planning for 3D Modular Robots with Unit-Compressible Modules , 2002, WAFR.

[12]  Craig D. McGray,et al.  The self-reconfiguring robotic molecule: design and control algorithms , 1998 .

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

[14]  Nancy M. Amato,et al.  Distributed reconfiguration of hexagonal metamorphic robots in two dimensions , 2000, SPIE Optics East.

[15]  Marsette Vona,et al.  Self-reconfiguration planning with compressible unit modules , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).