{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:18:36Z","timestamp":1770358716402,"version":"3.49.0"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/tro.2011.2104510","type":"journal-article","created":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T21:39:56Z","timestamp":1297460396000},"page":"297-312","source":"Crossref","is-referenced-by-count":41,"title":["A Minimalist Algorithm for Multirobot Continuous Coverage"],"prefix":"10.1109","volume":"27","author":[{"given":"Giorgio","family":"Cannata","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Sgorbissa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"279","article-title":"Easy and hard testbeds for real-time search algorithms","author":"koenig","year":"1996","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.851373"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.770350"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000273"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0221051"},{"key":"ref30","first-page":"426","author":"parsons","year":"1976","journal-title":"Pursuit Evasion in a Graph"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152497"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-540-88190-2_18","volume":"5249","author":"sak","year":"2008","journal-title":"Proc Adv Artif Intell SBIA 2008 Lecture Notes Comput Sci"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543563"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904039610"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2008.62"},{"key":"ref62","doi-asserted-by":"crossref","DOI":"10.1002\/0471200581","author":"bolch","year":"1998","journal-title":"Queueing Networks and Markov Chains"},{"key":"ref61","year":"0"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3132-0"},{"key":"ref28","first-page":"4080","article-title":"Real-time path planning with deadlock avoidance of multiple cleaning robots","volume":"3 2003","author":"luo","year":"0","journal-title":"Proc IEEE Int Conf Robotics Automat"},{"key":"ref64","first-page":"3","author":"baglietto","year":"2009","journal-title":"Proc Distrib Auton Robot Syst"},{"key":"ref27","first-page":"715","article-title":"Complete multi-robot coverage of unknown environments with minimum repeated coverage","author":"ge","year":"2005","journal-title":"Proc IEEE Int Conf Rob Autom"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152710"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90054-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363817"},{"key":"ref20","article-title":"Distributed coverage of rectilinear environments","author":"butler","year":"2001","journal-title":"Workshop on the Algorithmic Found Robot"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016610507833"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.506964"},{"key":"ref24","first-page":"3852","article-title":"Multi-robot forest coverage","author":"zheng","year":"2005","journal-title":"Proc IEEE Int Conf Intell Robot Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00110-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CIRA.2003.1222153"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641953"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.2307\/1913295"},{"key":"ref59","first-page":"246","article-title":"An experimental environment for optimal spatial sampling in a multi-robot system","author":"kemppainen","year":"0","journal-title":"Proc Int Conf Intell Autonomous Syst"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570648"},{"key":"ref57","year":"0"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-d.11.1762"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307283"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechatronics.2007.01.005"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1242060.1242061"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.2307\/1913325"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(78)90047-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90014-J"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1990.126317"},{"key":"ref12","author":"lawler","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"key":"ref13","author":"arkin","year":"0"},{"key":"ref14","article-title":"Coverage path planning: The boustrophedon cellular decomposition","author":"choset","year":"1997","journal-title":"Proc Int Conf Field Service Robotics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9120-2"},{"key":"ref16","first-page":"380","article-title":"A decentralized approach for cooperative sweeping by multiple mobile robots","author":"min","year":"1998","journal-title":"Proc IEEE Int Conf Intell Robot Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932525"},{"key":"ref18","first-page":"235","article-title":"A mrobot system for continuous area sweeping tasks","author":"guo","year":"2004","journal-title":"Proc Int Symp Collaborative Technol Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641955"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"4176","DOI":"10.1023\/A:1016665115585","article-title":"Efficient and inefficient ant coverage methods","volume":"31","author":"koenig","year":"2001","journal-title":"Ann Math Artif Intell"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.105395"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.364189"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/70.795795"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543638"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.281867"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90165-S"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","author":"levin","year":"2008","journal-title":"Markov Chains and Mixing Times"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1241576"},{"key":"ref45","first-page":"81","volume":"2581","author":"machado","year":"2003","journal-title":"Multi-Agent-Based Simulation II Lecture Notes Computer Science"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90336-9"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90162-P"},{"key":"ref42","first-page":"269","author":"bender","year":"1998","journal-title":"STOC Proc 30th ACM Symp Theory Comput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1993.292057"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018957401093"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/70.508436"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8860\/5742021\/05711675.pdf?arnumber=5711675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:29Z","timestamp":1633909589000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5711675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":66,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tro.2011.2104510","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}