Reconfiguring Chain-Type Modular Robots Based on the Carpenter's Rule Theorem

Reconfiguring chain-type modular robots has been considered a difficult problem scaling poorly with increasing numbers of modules. We address the reconfiguration problem for robots in 2D by presenting centralized and decentralized algorithms based on the Carpenter’s Rule Theorem [4]. The theorem guarantees the existence of instantaneous collision-free unfolding motions which monotonically increase the distance between all joint pairs until an open chain is straightened or a closed chain is convexified. The motions can be found by solving a convex program. Compared to the centralized version, the decentralized algorithm utilizes local proximity sensing and limited communications between subsets of nearby modules. Because the decentralized version reduces the number of joint pairs considered in each convex optimization, it is a practical solution for large number of modules.

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

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

[3]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[4]  Stephen P. Boyd,et al.  Notes on Decomposition Methods , 2008 .

[5]  Mark Yim,et al.  PolyBot: a modular reconfigurable robot , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  S. Sastry Nonlinear Systems: Analysis, Stability, and Control , 1999 .

[7]  Günter Rote,et al.  Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Mark Yim,et al.  A Toolchain for the Design and Simulation of Foldable Programmable Matter , 2010 .

[9]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[10]  H Tanaka,et al.  Programmable matter by folding , 2010, Proceedings of the National Academy of Sciences.

[11]  Mark Yim,et al.  Strength analysis of miniature folded right angle tetrahedron chain Programmable Matter , 2010, 2010 IEEE International Conference on Robotics and Automation.

[12]  W. McCarthy Programmable matter , 2000, Nature.

[13]  G. Swaminathan Robot Motion Planning , 2006 .

[14]  Mark Yim,et al.  Modular Self-Reconfigurable Robots , 2009, Encyclopedia of Complexity and Systems Science.

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

[16]  Joseph S. B. Mitchell,et al.  Locked and Unlocked Chains of Planar Shapes , 2010, Discret. Comput. Geom..

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

[18]  Hod Lipson,et al.  Stochastic self-reconfigurable cellular robotics , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[20]  Nancy M. Amato,et al.  Planning with Reachable Distances: Fast Enforcement of Closure Constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[21]  Jean-Claude Latombe,et al.  Reconfiguration planning for modular self-reconfigurable robots , 2001 .

[22]  Wei-Min Shen,et al.  Docking in self-reconfigurable robots , 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).