Decentralized path planning for coverage tasks using gradient descent adaptive control
Name
DecentralizedPathPlanning13.pdf
Description
Accepted version
Size
3.39 MB
Format
Unknown
Checksum (MD5)
e274e79ed3e3c4ab255f9f208ff4921e
Author(s)
Soltero, Daniel Eduardo
Schwager, Mac
Rus, Daniela L
Date Issued
2014
Journal
International Journal of Robotics Research
Publisher
SAGE Publications
Citation
Soltero, D. E., M. Schwager, and D. Rus. "Decentralized Path Planning for Coverage Tasks Using Gradient Descent Adaptive Control." International Journal of Robotics Research 33 3 (2014): 401-25.
Version
Author's final manuscript
Abstract
In this paper we propose a new path planning algorithm for coverage tasks in unknown environments that does not rely on recursive search optimization. Given a sensory function that captures the interesting locations in the environment and can be learned, the goal is to compute a set of closed paths that allows a single robot or a multi-robot system to sense/cover the environment according to this function. We present an online adaptive distributed controller, based on gradient descent of a Voronoi-based cost function, that generates these closed paths, which the robots can travel for any coverage task, such as environmental mapping or surveillance. The controller uses local information only, and drives the robots to simultaneously identify the regions of interest and shape their paths online to sense these regions. Lyapunov theory is used to show asymptotic convergence of the system based on a Voronoi-based coverage criterion. Simulated and experimental results, that support the proposed approach, are presented for the single-robot and multi-robot cases in known and unknown environments. © The Author(s) 2013.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1177/0278364913497241
