Paper by Erik D. Demaine
- James McLurkin and Erik D. Demaine, “A Distributed Boundary Detection Algorithm for Multi-Robot Systems”, in Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2009), St. Louis, Missouri, October 11–15, 2009, pages 4791–4798.
We describe a distributed boundary detection algorithm suitable for use on
multi-robot systems with dynamic network topologies. We assume that each robot
has access to its local network geometry, which is the combination of a
robot's network connectivity and the positions of its neighbors measured
relative to itself. Our algorithm uses this information to classify robots as
boundary or interior in one communications round, which is fast enough for
rapidly changing networks. We use the local boundary classifications to create
a robust boundary subgraph, and to determine if the boundary is an interior
void or the exterior boundary. A proof of the key property of the boundary
detection algorithm is provided, and all the algorithms are extensively tested
on a swarm of 25-35 robots in rapidly changing network topologies.
- This paper is also available from IEEE Xplore.
- The conjecture on page 4 (boundary error detection eventually lead to the true boundary) has been disproved: Maximilian Ernestus and Dominik Krupke's bachelor's thesis gives a counterexample.
- The paper is available in PDF (1954k).
- See information on file formats.
- [Google Scholar search]
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated September 17, 2018 by