{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T15:34:57Z","timestamp":1785771297307,"version":"3.56.0"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN2020-06540"],"award-info":[{"award-number":["RGPIN2020-06540"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Canada Foundation for Innovation through a John R. Evans Leaders Fund Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tro.2025.3567476","type":"journal-article","created":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T13:07:12Z","timestamp":1746536832000},"page":"3348-3367","source":"Crossref","is-referenced-by-count":13,"title":["Large-Scale Multirobot Coverage Path Planning on Grids With Path Deconfliction"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4828-9021","authenticated-orcid":false,"given":"Jingtao","family":"Tang","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zining","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0602-0999","authenticated-orcid":false,"given":"Hang","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3432351"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593719"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2024.109217"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/iSpaRo60631.2024.10687663"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2024.118645"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3214446"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/RCAR52367.2021.9517650"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.3.267"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1090\/fic\/055\/03"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570205"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399423"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2072271"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561371"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3306996"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016610507833"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3293319"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3191939"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i16.29707"},{"key":"ref22","article-title":"Constraint-based coverage path planning: A novel approach to achieving energy-efficient coverage","author":"Tomaszewski","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-016-0461-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574718000292"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-023-01844-z"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.06.012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9120-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-013-9364-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206000"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9_5"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008958800904"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556359"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2016.7743548"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1108\/13552540210413284"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1385-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1120-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925958"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2899920"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v34i1.31520"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2715406"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s43154-022-00083-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v17i1.31566"},{"key":"ref44","first-page":"1464","article-title":"Multi-agent path finding for precedence-constrained goal sequences","volume-title":"Proc. Int. Joint Conf. Auton. Agents Multiagent Syst.","author":"Zhang","year":"2022"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17472"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/28"},{"key":"ref48","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","volume-title":"Proc. 16th Conf. Auton. Agents MultiAgent Syst.","author":"Ma","year":"2017"},{"key":"ref49","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","volume-title":"Proc. 16th Conf. Auton. Agents MultiAgent Syst.","author":"Liu","year":"2019"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646138"},{"key":"ref54","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1013479"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511804120.006"},{"key":"ref58","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v25i1.13696"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894217"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8860\/10778592\/10989517.pdf?arnumber=10989517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T23:26:55Z","timestamp":1768951615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10989517\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/tro.2025.3567476","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}