Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions

By Jorge Cortés, Sonia Martínez, Francesco Bullo

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Finite-time convergent gradient flows with applications to network consensus (2006, background): “Previous work on motion coordination of multi-agent systems has proposed cooperative algorithms based on gradient flows to achieve tasks such as cohesiveness [11, 14, 20], deployment [8, 9] and consensus [15, 16, 17], The distributed algorithms in these works achieve the desired coordination task ov”
A Distributed Algorithm for Proportional Task Allocation in Networks of Mobile Agents (2011, methodology): “As a result, the controller of [7] cannot produce the results of the present technical note.”
A Distributed Deterministic Annealing Algorithm for Limited-Range Sensor Coverage (2011, methodology): “Finally, we introduce to mean to perform limited-range coverage as from [2].”
Sensing and coverage for a network of heterogeneous robots (2008, background): “In [3] the problem of limited-range interaction between agents was addressed.”
Motion Coordination with Distributed Information (2007, unknown): “The following proximity graphs are discussed in [ 22 ], [39], [42]: » The r-disk graph Gdisk(r), where r > 0, in which two agents are neighbors if their locations are within a distance r, that is, {pi, pj }∈ EGdisk(r)(P) if � pi − pj �≤ r. » The Delaunay graph GD, in which two agents are neighbors i”
Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions (2006, methodology): “The converse is in general not true (for instance, the graph is a subgraph of , but it is not spatially distributed over it; see [13]).”
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (2009, unknown): “Among the most recent works, Mart́ınez (2009) and Schwager et al.”
Unicycle Coverage Control Via Hybrid Modeling (2010, methodology): “Other partitions, such as the range-limited partitions from [9] or more general Voronoi partitions like those found in [23], should not affect the convergence of wheeled vehicles.”
Awareness Coverage Control Over Large-Scale Domains With Intermittent Communications (2010, background): “In [8], the authors extend the work on [6] with limited sensing/communication capacity in both the continuous and discrete-time settings.”
Notes on averaging over acyclic digraphs and discrete coverage control (2006, background): “The following result is discussed in (Cortés et al., 2005) for the continuous multi-center function; the result for the discrete function is novel.”
Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks (2010, methodology): “In the context of robotic sensor networks, this work builds on [7], where distributed algorithms based on centroidal Voronoi partitions are presented, and [8], where limited-range interactions are considered.”