{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:07:32Z","timestamp":1777716452451,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1177\/0278364913497241","type":"journal-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T23:15:55Z","timestamp":1383088555000},"page":"401-425","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":46,"title":["Decentralized path planning for coverage tasks using gradient descent adaptive control"],"prefix":"10.1177","volume":"33","author":[{"given":"Daniel E.","family":"Soltero","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mac","family":"Schwager","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department, Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Rus","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"bibr1-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509714"},{"key":"bibr2-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2004.824698"},{"key":"bibr3-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.933238"},{"key":"bibr4-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"bibr5-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2178332"},{"key":"bibr6-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509175"},{"key":"bibr7-0278364913497241","volume-title":"Robust Adaptive Control","author":"Ioannou PA","year":"1996"},{"key":"bibr8-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"bibr9-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"bibr10-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1988.12075"},{"key":"bibr11-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1177\/027836499901800103"},{"key":"bibr12-0278364913497241","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-3360"},{"key":"bibr13-0278364913497241","first-page":"602","volume-title":"Proceedings of the 22nd National Conference on Artificial Intelligence, AAAI\u201907","volume":"1","author":"Meliou A","year":"2007"},{"key":"bibr14-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.903816"},{"key":"bibr15-0278364913497241","volume-title":"Proceedings of the Eighth International Workshop on the Algorithmic Foundations of Robotics (WAFR 08)","author":"Pimenta LCA","year":"2008"},{"key":"bibr16-0278364913497241","first-page":"2473","volume-title":"2004 International Conference on Machine Learning and Cybernetics","volume":"4","author":"Qin YQ","year":"2004"},{"key":"bibr17-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272864"},{"key":"bibr18-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908100177"},{"key":"bibr19-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2674"},{"key":"bibr20-0278364913497241","first-page":"1","volume":"99","author":"Smith SL","year":"2011","journal-title":"IEEE Transactions on Robotics"},{"key":"bibr21-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385730"},{"key":"bibr22-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095081"},{"key":"bibr23-0278364913497241","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364913497241","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0278364913497241","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364913497241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:18:24Z","timestamp":1777457904000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364913497241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1177\/0278364913497241"],"URL":"https:\/\/doi.org\/10.1177\/0278364913497241","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,29]]}}}