A Graph-Based Hybrid Reconfiguration Deformation Planning for Modular Robots.

Ruopeng Wei, Yubin Liu, Huijuan Dong, Yanhe Zhu, Jie Zhao
Author Information
  1. Ruopeng Wei: State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, Harbin 150001, China.
  2. Yubin Liu: State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, Harbin 150001, China.
  3. Huijuan Dong: State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, Harbin 150001, China.
  4. Yanhe Zhu: State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, Harbin 150001, China.
  5. Jie Zhao: State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, Harbin 150001, China.

Abstract

The self-reconfigurable modular robotic system is a class of robots that can alter its configuration by rearranging the connectivity of their component modular units. The reconfiguration deformation planning problem is to find a sequence of reconfiguration actions to transform one reconfiguration into another. In this paper, a hybrid reconfiguration deformation planning algorithm for modular robots is presented to enable reconfiguration between initial and goal configurations. A hybrid algorithm is developed to decompose the configuration into subconfigurations with maximum commonality and implement distributed dynamic mapping of free vertices. The module mapping relationship between the initial and target configurations is then utilized to generate reconfiguration actions. Simulation and experiment results verify the effectiveness of the proposed algorithm.

Keywords

References

  1. Sci Robot. 2021 Jul 28;6(56): [PMID: 34321347]

Grants

  1. 91948201/Major Research Plan of the National Natural Science Foundation of China

Word Cloud

Created with Highcharts 10.0.0reconfigurationmodularrobotsdeformationplanningalgorithmroboticsconfigurationactionshybridinitialconfigurationsmappingmobileself-reconfigurableroboticsystemclasscanalterrearrangingconnectivitycomponentunitsproblemfindsequencetransformoneanotherpaperpresentedenablegoaldevelopeddecomposesubconfigurationsmaximumcommonalityimplementdistributeddynamicfreeverticesmodulerelationshiptargetutilizedgenerateSimulationexperimentresultsverifyeffectivenessproposedGraph-BasedHybridReconfigurationDeformationPlanningModularRobotspathmultipleself-reconfigurationswarm

Similar Articles

Cited By