.png){kind=icon}
.png){kind=icon}
Return
Self-Reconfiguration Planning for Deformable Quadrilateral Modular Robots
.png){kind=icon}
PRE
AI
DOI：10.1109/LRA.2026.3685902.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
While deformable modular self reconfigurable robots offer enhanced reconfiguration flexibility, strict kinematic constraints present complex self reconfiguration planning challenges. This letter presents a novel self-reconfiguration planning algorithm for deformable quadrilateral MSRRs. 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.
Keywords:
Cellular and modular robots
task and motion planning
Journal
I
IF:
5.3
Papers:
1.7K
Citations:
3.9W