On persistent coverage control

Peter F. Hokayem, Dušan Stipanović, Mark W. Spong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we address the problem of persistent coverage of a given convex polygonal region in the plane. We present an algorithmic solution for this problem that takes into account the limitations in the communication and sensing ranges of the agents. We show that our algorithm provides a persistent coverage period that is bounded away by a constant factor from a minimal tour among the centers of an optimal static cover, which is comprised of circles having the same radius as the sensing radius of the agents. A simulation is provided that illustrates the algorithm.

Original languageEnglish (US)
Title of host publicationProceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6130-6135
Number of pages6
ISBN (Print)1424414989, 9781424414987
DOIs
StatePublished - 2007
Event46th IEEE Conference on Decision and Control 2007, CDC - New Orleans, LA, United States
Duration: Dec 12 2007Dec 14 2007

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other46th IEEE Conference on Decision and Control 2007, CDC
Country/TerritoryUnited States
CityNew Orleans, LA
Period12/12/0712/14/07

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'On persistent coverage control'. Together they form a unique fingerprint.

Cite this