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 since typical coverage objective functions contain many local minima. 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 for such non-convex coverage objective functions, annealing techniques are generally less prone to this phenomena. The results of our simulations confirm this fact, as we show in the manuscript.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
