Translator Disclaimer
16 October 2000 Connectivity planning for closed-chain reconfiguration
Author Affiliations +
Proceedings Volume 4196, Sensor Fusion and Decentralized Control in Robotic Systems III; (2000) https://doi.org/10.1117/12.403738
Event: Intelligent Systems and Smart Manufacturing, 2000, Boston, MA, United States
Abstract
Modular reconfigurable robots can change their connectivity from one arrangement to another. Performing this change involves a difficult planning problem. We study this problem by representing robot configurations as graphs, and giving an algorithm that can transform any configuration of a robot into any other in O (log n) steps. Here n is the number of modules which can attach to more than two other modules. We also show that O(log n) is best possible.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark H. Yim, David Goldberg, and Arancha Casal "Connectivity planning for closed-chain reconfiguration", Proc. SPIE 4196, Sensor Fusion and Decentralized Control in Robotic Systems III, (16 October 2000); https://doi.org/10.1117/12.403738
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Real-time scheduling in a stochastic environment
Proceedings of SPIE (January 24 2000)
Key technologies of a utility management simulation system
Proceedings of SPIE (September 01 2003)
Essential joint properties for nets of cellular robots
Proceedings of SPIE (September 14 1995)
Review of theory in model abstraction
Proceedings of SPIE (August 23 1998)

Back to Top