Spatially-distributed coverage optimization and control with limited-range interactions

Simple item page
dc.creatorCortes, Jorge
dc.creatorMartinez, Sonia
dc.creatorBullo, Francesco
dc.date2004-01-22
dc.date.accessioned2026-07-07T05:04:46Z
dc.date.available2026-07-07T05:04:46Z
dc.descriptionThis paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing/communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect to appropriate proximity graphs. Numerical simulations illustrate the results.
dc.description31 pages, some figures left out because of size limits. Complete preprint version available at http://motion.csl.uiuc.edu
dc.identifierhttps://arxiv.org/abs/math/0401297
dc.identifierhttp://arxiv.org/abs/math/0401297
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69931
dc.subjectOptimization and Control
dc.subjectDynamical Systems
dc.subject37N35, 68W15, 93D20, 49J52
dc.titleSpatially-distributed coverage optimization and control with limited-range interactions
dc.typetext

Files

Collections

arXiv