TY - GEN
T1 - Dynamic coverage control with limited communication
AU - Hokayem, Peter F.
AU - Stipanović, Dušan
AU - Spong, Mark W.
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=39549116256&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39549116256&partnerID=8YFLogxK
U2 - 10.1109/ACC.2007.4282437
DO - 10.1109/ACC.2007.4282437
M3 - Conference contribution
AN - SCOPUS:39549116256
SN - 1424409888
SN - 9781424409884
T3 - Proceedings of the American Control Conference
SP - 4878
EP - 4883
BT - Proceedings of the 2007 American Control Conference, ACC
T2 - 2007 American Control Conference, ACC
Y2 - 9 July 2007 through 13 July 2007
ER -