Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-07T12:54:08.955Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  15 September 2005

Jorge Cortés
Affiliation:
Department of Applied Mathematics and Statistics, Baskin School of Engineering, University of California, Santa Cruz, 1156 High Street, Santa Cruz, California, 95064, USA; jcortes@ucsc.edu
Sonia Martínez
Affiliation:
Department of Mechanical and Environmental Engineering, University of California, Santa Barbara, Engineering Building II, Santa Barbara, California, 93106, USA; smartine@engr.ucsb.edu; bullo@engr.ucsb.edu
Francesco Bullo
Affiliation:
Department of Mechanical and Environmental Engineering, University of California, Santa Barbara, Engineering Building II, Santa Barbara, California, 93106, USA; smartine@engr.ucsb.edu; bullo@engr.ucsb.edu
Get access

Abstract

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 or 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.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable