Connectivity check for modular self reconfigurable robots

摘要

A problem in configuring modular self-reconfigurable robots with distributed control is determining whether a module can be moved without breaking the system apart. In finding a set of modules that can be safely moved, the key issues are to maximize the number of mobile modules identified and minimize the time consumed in finding these modules. In this study, a distributed search algorithm is proposed and compared to an existing approach.