Name
Abstract | ||
|---|---|---|
In this paper we address the problem of dynamic coverage control of a convex polygonal region in the plane using N agents with bounded velocities and finite instantaneous area of coverage. The proposed coverage algorithm guarantees finite- time search of the region, does not depend on gradient-based methods, and can be carried out by the agents in a distributed fashion. We provide an upper bound on the completion time as well as the number of messages that need to be exchanged by the agents. A simulation is provided to illustrate the algorithm. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ACC.2007.4282437 | New York, NY |
Keywords | DocType | ISSN |
gradient methods,mobile robots,sensors,bounded velocities,convex polygonal region,dynamic coverage control,finite instantaneous area,finite- time search,gradient-based methods,multiagent systems,convergence,crops,upper bound,vehicle dynamics,hurricanes | Conference | 0743-1619 E-ISBN : 1-4244-0989-6 |
ISBN | Citations | PageRank |
1-4244-0989-6 | 9 | 0.91 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter F. Hokayem | 1 | 11 | 1.42 |
| Stipanovic, D. | 2 | 9 | 0.91 |
| Spong, M.W. | 3 | 706 | 154.32 |