🤖 AI Summary
This work addresses the challenges of connection stability and physical feasibility in self-reconfiguration of deformable quadrilateral modular robots. The authors propose a novel planning algorithm based on virtual graph modeling and a Dependency Reversal Tree (DRTree). The virtual graph generates connect/disconnect actions that satisfy kinematic constraints, while the DRTree explicitly encodes inter-action dependencies to guarantee both stability and feasibility of the reconfiguration sequence. Notably, this is the first method to prove the existence of stable, motion-feasible reconfiguration sequences for nonlinear topologies involving seven or more modules. Experimental results demonstrate that the proposed approach outperforms an improved BiRRT algorithm in both efficiency and stability, and its practical deployability is validated on a real modular robot platform.
📝 Abstract
For lattice modular self-reconfigurable robots (MSRRs), maintaining stable connections during reconfiguration is crucial for physical feasibility and deployability. This letter presents a novel self-reconfiguration planning algorithm for deformable quadrilateral MSRRs that guarantees stable connection. The method first constructs feasible connect/disconnect actions using a virtual graph representation, and then organizes these actions into a valid execution sequence through a Dependence-based Reverse Tree (DRTree) that resolves interdependencies. We also prove that reconfiguration sequences satisfying motion characteristics exist for any pair of configurations with seven or more modules (excluding linear topologies). Finally, comparisons with a modified BiRRT algorithm highlight the superior efficiency and stability of our approach, while deployment on a physical robotic platform confirms its practical feasibility.