Graph minor analysis of reconfiguration state spaces

Thomas Larkworthy, Subramanian Ramamoorthy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Efficiently overcoming difficult motion constraints is the prime problem in development of efficient motion planning algorithms for self-reconfiguring systems (SRSs). Metamodularization, and other related techniques, deal with the problem by adding further constraints in a way that simplifies planning. If Rn denotes a raw state space for configurations containing n sub-units, and Cn a further constrained version of Rn then Rn le Cn where le denotes the graph minor relation. Often the choice of Cn is ad hoc (although made on clever intuitions). We wish to study whether there are principles that may guide this choice. We demonstrate one such principle, that is planning is tractable, e.g. in meta-modularized sub-spaces, when Cn le Cn+1, which captures a smooth increase in state-space complexity as more modules are added.
Original languageEnglish
Title of host publicationICRA 2010 Workshop on Modular Robots
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'Graph minor analysis of reconfiguration state spaces'. Together they form a unique fingerprint.

Cite this