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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This 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.
31 pages, some figures left out because of size limits. Complete preprint version available at http://motion.csl.uiuc.edu

Keywords

Optimization and Control, Dynamical Systems, 37N35, 68W15, 93D20, 49J52

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69931

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0401297
 http://arxiv.org/abs/math/0401297

Collections

arXiv