Generating an efficient hub graph for self-reconfiguration planning in modular robots

The self-reconfiguration planning has been considered as a major problem in the field of modular robots. In this paper, we propose a human-inspired map-based rout planning approach that speeds up the reconfiguration planning. In this method, the analogous to a map is a reconfiguration hub-graph which contains the major nodes of the reconfiguration graph. We propose an RRT-based approach to select these hubs such that they efficiently cover the full configuration graph. In a search for a path between two nodes of the graph, a pre-calculated optimal routing from a hub to another hub may be used. This method has been simulated for two different modular robots and the results show that, the time spent to find a solution is independent of the solution length. Experiments show 5 to 8 fold speed up in search time, while founded solutions are near-optimal. Also it has been shown that the configuration graph is scale free therefore the idea of using hubs is extendable to larger number of modules.

[1]  Robert Fitch,et al.  Hierarchical Planning for Self-reconfiguring Robots Using Module Kinematics , 2010, DARS.

[2]  Siddhartha S. Srinivasa,et al.  Hierarchical Motion Planning for Self-reconfigurable Modular Robots , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Arancha Casal,et al.  Connectivity planning for closed-chain reconfiguration , 2000, SPIE Optics East.

[4]  Wei-Min Shen,et al.  On the complexity of optimal reconfiguration planning for modular reconfigurable robots , 2010, 2010 IEEE International Conference on Robotics and Automation.

[5]  Wei-Min Shen,et al.  Hormone-inspired adaptive communication and distributed control for CONRO self-reconfigurable robots , 2002, IEEE Trans. Robotics Autom..

[6]  Mark Moll,et al.  SUPERBOT: A Deployable, Multi-Functional, and Modular Self-Reconfigurable Robotic System , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Wei-Min Shen,et al.  Distributed, dynamic, and autonomous reconfiguration planning for chain-type self-reconfigurable robots , 2008, 2008 IEEE International Conference on Robotics and Automation.

[8]  Wei-Min Shen,et al.  Graph-based optimal reconfiguration planning for self-reconfigurable robots , 2014, Robotics Auton. Syst..

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

[10]  Hadi Moradi,et al.  A New Graph Signature Calculation Method Based on Power Centrality for Modular Robots , 2010, DARS.

[11]  Eiichi Yoshida,et al.  A Self-Reconfigurable Modular Robot: Reconfiguration Planning and Experiments , 2002 .

[12]  Auke Jan Ijspeert,et al.  Graph signature for self-reconfiguration planning of modules with symmetry , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Aude Billard,et al.  Graph signature for self-reconfiguration planning , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Kasper Støy,et al.  Using cellular automata and gradients to control self-reconfiguration , 2006, Robotics Auton. Syst..

[15]  Eiichi Yoshida,et al.  M-TRAN: self-reconfigurable modular robotic system , 2002 .

[16]  Albert-László Barabási,et al.  Linked - how everything is connected to everything else and what it means for business, science, and everyday life , 2003 .