Distributed reconfiguration of metamorphic robot chains

Authors: Walter, Jennifer1; Welch, Jennifer2; Amato, Nancy3

Source: Distributed Computing, Volume 17, Number 2, August 2004 , pp. 171-189(19)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: Distributed reconfiguration; Metamorphic robots

Document Type: Research Article

DOI: http://dx.doi.org/10.1007/s00446-003-0103-y

Affiliations: 1: Department of Computer Science, Vassar College, NY 12604-0351, Poughkeepsie, USA, Email: walter@cs.vassar.edu 2: Department of Computer Science, Texas A&M University, TX 77843-3112, College Station, USA, Email: welch@cs.tamu.edu 3: Department of Computer Science, Texas A&M University, TX 77843-3112, College Station, USA,

Publication date: August 1, 2004

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page