Distributed reconfiguration of metamorphic robot chains

Authors:
Jennifer E. Walter;Jennifer L. Welch;Nancy M. Amato
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Year:
2000

Citing 2
Cited 7

The self-reconfiguring robotic molecule: design and control algorithms

WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Distributed Control for 3D Metamorphosis

Autonomous Robots

An efficient communication strategy for ad-hoc mobile networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
An Adaptive Compulsory Protocol for Basic Communication in Highly Changing Ad hoc Mobile Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Efficient Communication Strategy for Ad-hoc Mobile Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Distributed communication algorithms for ad hoc mobile networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Design and analysis of an efficient communication strategy for hierarchical and highly changing ad-hoc mobile networks

Mobile Networks and Applications
Routing protocols for efficient communication in wireless ad-hoc networks

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Towards a theory of self-organization

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem we address is the distributed reconfiguration of a metamorphic robotic system composed of any number of two dimensional hexagonal modules from specific initial to specific goal configurations. We present a distributed algorithm for reconfiguring a straight chain of hexagonal modules at one location to any intersecting straight chain configuration at some other location in the plane. We prove our algorithm is correct, and show that it is either optimal or asymptotically optimal in the number of moves and asymptotically optimal in the time required for parallel reconfiguration. We then consider the distributed reconfiguration of straight chains of modules to a more general class of goal configurations.