A distributed deterministic annealing algorithm for limited-range sensor coverage

Authors:
Andrew Kwok;Sonia Martínez
Affiliations:
Department of Mechanical and Aerospace Engineering, Univ. of California, San Diego, La Jolla, CA;Department of Mechanical and Aerospace Engineering, Univ. of California, San Diego, La Jolla, CA
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 4
Cited 0

Distributed Algorithms

Distributed Algorithms
Control in an Information Rich World: Report of the Panel on Future Directions in Control, Dynamics, and Systems

Control in an Information Rich World: Report of the Panel on Future Directions in Control, Dynamics, and Systems
Abstraction and control for Groups of robots

IEEE Transactions on Robotics
Gibbs sampler-based coordination of autonomous swarms

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a distributed coverage algorithm for a network of mobile agents. Unlike previous work that uses a simple gradient descent algorithm, here we employ an existing deterministic annealing (DA) technique to achieve more optimal convergence values. We replicate the results of the classical DA algorithm while imposing a limited-range constraint to sensors. As the temperature is decreased, phase changes lead to a regrouping of agents, which is decided through a distributed task allocation algorithm. While simple gradient descent algorithms are heavily dependent on initial conditions, annealing techniques are generally less prone to this phenomena. The results of our simulations confirm this fact, as we show in the manuscript.