Generic distributed assembly and repair algorithms for self-reconfiguring robots
Lists
Only you see this
Abstract
In this paper we present generic distributed algorithms for assembling and repairing shapes using modular self-reconfiguring robots. The algorithms work in the sliding cube model. Each module independently evaluates a set of local rules using different evaluation models. Two methods are used to determine the correctness of the algorithms - a graph analysis technique which can prove the rule set is correct for specific instances of the algorithm, and a statistical technique which can produce arbitrary bounds on the likelihood that the rule set functions correctly. An extension of the assembly algorithm can be used to produce arbitrary non-cantilevered convex shapes without holes. The algorithms have been implemented and evaluated in simulation.
BibTeX
@inproceedings{kotay2004generic,
author = {Keith Kotay and Daniela Rus},
title = {{Generic distributed assembly and repair algorithms for self-reconfiguring robots}},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2004},
doi = {10.1109/iros.2004.1389762},
}Loading related content...