{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T17:00:48Z","timestamp":1791392448704,"version":"4.3.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["10042096"],"award-info":[{"award-number":["10042096"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/lra.2026.3656776","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:03:37Z","timestamp":1769115817000},"page":"3454-3461","source":"Crossref","is-referenced-by-count":1,"title":["Coverage With Self-Induced Obstacles on Grids"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-2016","authenticated-orcid":false,"given":"Sarah","family":"Frenkel","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Birmingham, Birmingham, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4137-8862","authenticated-orcid":false,"given":"David","family":"Parker","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Oxford, Oxford, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4527-7586","authenticated-orcid":false,"given":"Masoumeh","family":"Mansouri","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Birmingham, Birmingham, U.K."}],"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.1007\/s13218-013-0267-y"},{"key":"ref3","first-page":"105","article-title":"Ros-based path planning and machine control for an autonomous sugar beet harvester","volume-title":"Proc. Int. Conf. Mach. Control Guid.","author":"Ullrich","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14311\/APP.2016.56.0047"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206195"},{"issue":"1-2","key":"ref6","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556359"},{"key":"ref9","first-page":"533","article-title":"Planning paths of complete coverage of an unstructured environment by a mobile robot","volume-title":"Proc. Int. Conf. Adv. Robot.","volume":"13","author":"Zelinsky","year":"1993"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016610507833"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968150"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.11.004"},{"key":"ref13","article-title":"Hamiltonicity is hard in thin or polygonal grid graphs, but easy in thin polygonal grid graphs","author":"Demaine","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46018-4_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.04.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.02.026"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2023.102156"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ECMR59166.2023.10256330"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258291"},{"key":"ref21","first-page":"1","article-title":"Shortest paths for the Reeds-shepp car: A worked out example of the use of geometric techniques in nonlinear optimal control","volume":"10","author":"Sussmann","year":"1991","journal-title":"Rutgers Center Syst. Control Tech. Rep."},{"key":"ref22","article-title":"Robot navigation: Touching, seeing and knowing","volume-title":"Proc. 1st Australian Conf. Artif. Intell.","volume":"69","author":"Jarvis","year":"1986"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1990.145.367"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/11359420\/11361095.pdf?arnumber=11361095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T21:09:16Z","timestamp":1770671356000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11361095\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":23,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2026.3656776","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}