{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:55:29Z","timestamp":1781020529399,"version":"3.54.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Canadian Mitacs Accelerate Project","award":["IT16435"],"award-info":[{"award-number":["IT16435"]}]},{"name":"Avidbots Corporation, Kitchener, ON, Canada"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tro.2024.3454417","type":"journal-article","created":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:45:03Z","timestamp":1725475503000},"page":"4190-4206","source":"Crossref","is-referenced-by-count":6,"title":["Anytime Replanning of Robot Coverage Paths for Partially Unknown Environments"],"prefix":"10.1109","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8676-9296","authenticated-orcid":false,"given":"Megnath","family":"Ramesh","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4399-2172","authenticated-orcid":false,"given":"Frank","family":"Imeson","sequence":"additional","affiliation":[{"name":"Avidbots Corporation, Kitchener, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5333-0201","authenticated-orcid":false,"given":"Baris","family":"Fidan","sequence":"additional","affiliation":[{"name":"Department of Mechanical and Mechatronics Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8636-407X","authenticated-orcid":false,"given":"Stephen L.","family":"Smith","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0921-8890(94)00034-Y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-010-0404-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-013-9834-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"issue":"1-2","key":"ref5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","article-title":"Approximation algorithms for lawn mowing and milling","volume":"17","author":"Arkin","year":"2000","journal-title":"Comput. Geometry"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3191939"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-9460-1_20"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3146952"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460566"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3108177"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2854967"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759499"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2016.7743548"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21490"},{"issue":"1-4","key":"ref16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1016610507833","article-title":"Spanning-tree based coverage of continuous areas by a mobile robot","volume":"31","author":"Gabriely","year":"2001","journal-title":"Ann. Math. Artif. Intell."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0027613"},{"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.1177\/027836402320556368"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0406-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00110-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2780259"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2000394"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115940"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2018.2810235"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/info12020051"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21993"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2017.XIII.070","article-title":"Efficient online multi-robot exploration via distributed sequential greedy assignment","volume-title":"Proc. Robot.: Sci. Syst. XIII. Robot.: Sci. Syst. Found.","author":"Corah","year":"2017"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3271520"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CIRA.1997.613851"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CASE49997.2022.9926483"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21554"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703434267"},{"key":"ref35","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte","year":"2006"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906061705"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.010"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8860\/10365208\/10665968.pdf?arnumber=10665968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T05:46:35Z","timestamp":1726897595000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10665968\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tro.2024.3454417","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}