Abstract | ||
---|---|---|
This paper presents deployment algorithms for multiple mobile robots with line-of-sight sensing and communication capabilities in a simple nonconvex polygonal environment. The objective of the proposed algorithms is to achieve full visibility of the environment. We solve the problem by constructing a novel data structure called the vertex-induced tree and designing schemes to deploy over the nodes of this tree by means of distributed algorithms. The agents are assumed to have access to a local memory and their operation is partially asynchronous. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1109/ACC.2006.1656416 | 2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12 |
Keywords | DocType | Volume |
i. i ntroduction,mobile communication,tree data structures,computational geometry,art,data structure,distributed algorithms,robot kinematics,mobile robots,algorithm design and analysis,distributed algorithm | Conference | 1-12 |
ISSN | Citations | PageRank |
0743-1619 | 34 | 2.68 |
References | Authors | |
4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anurag Ganguli | 1 | 154 | 15.72 |
Jorge Cortes | 2 | 1452 | 128.75 |
Francesco Bullo | 3 | 4989 | 415.53 |