Distributed reconfiguration of metamorphic robot chains
Source: Distributed Computing, Volume 17, Number 2, August 2004 , pp. 171-189(19)
Abstract:The problem we address is the distributed reconfiguration of a planar metamorphic robotic system composed of any number of hexagonal modules. After presenting a framework for classifying motion planning algorithms for metamorphic robotic systems, we describe distributed algorithms for reconfiguring a straight chain of hexagonal modules to any intersecting straight chain configuration. We prove our algorithms are correct, and show that they are either optimal or asymptotically optimal in the number of moves and asymptotically optimal in the time required for parallel reconfiguration.
Document Type: Research Article
Affiliations: 1: Department of Computer Science, Vassar College, NY 12604-0351, Poughkeepsie, USA, Email: firstname.lastname@example.org 2: Department of Computer Science, Texas A&M University, TX 77843-3112, College Station, USA, Email: email@example.com 3: Department of Computer Science, Texas A&M University, TX 77843-3112, College Station, USA,
Publication date: August 1, 2004