{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T06:39:29Z","timestamp":1768977569497,"version":"3.49.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009896","name":"U.S. Navy\u2019s Internal Laboratory Independence Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009896","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst. Man Cybern, Syst."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tsmc.2018.2806840","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T19:23:26Z","timestamp":1519759406000},"page":"2157-2169","source":"Crossref","is-referenced-by-count":30,"title":["A Triangulation-Based Coverage Path Planning"],"prefix":"10.1109","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6637-1256","authenticated-orcid":false,"given":"Vatana","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6710-7134","authenticated-orcid":false,"given":"Zhihua","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Crosby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney","family":"Roberts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6463-0074","authenticated-orcid":false,"given":"Vithia","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2290975"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2007.381724"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2014.7027291"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4310\/CMS.2011.v9.n2.a9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.829461"},{"key":"ref15","year":"2013","journal-title":"Computational Geometry Algorithms Library"},{"key":"ref16","article-title":"Heuristics for the traveling salesman problem","author":"nilsson","year":"2003"},{"key":"ref17","author":"kozen","year":"2012","journal-title":"The Design and Analysis of Algorithms"},{"key":"ref18","first-page":"594","author":"goodrich","year":"2009","journal-title":"Data Structures and Algorithms in C++"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1515\/9789882203037","volume":"1","author":"leung","year":"1994","journal-title":"Vectors Matrices and Geometry"},{"key":"ref4","first-page":"203","article-title":"Coverage path planning: The boustrophedon cellular decomposition","author":"choset","year":"1997","journal-title":"Proc Int Conf Field Service Robot"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2010.2101312"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2011.06.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016639210559"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00110-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2004.825197"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROSE.2013.6698428"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2253605"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/AUCC.2013.6697270"},{"key":"ref20","first-page":"1","article-title":"Polygon partitions","author":"o\u2019rourke","year":"1987","journal-title":"Art Gallery Theorems and Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2475363"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2662623"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2443877"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3233\/WOR-2012-0436-2089"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics: Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221021\/9094268\/08303828.pdf?arnumber=8303828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T02:02:43Z","timestamp":1751421763000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8303828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":25,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tsmc.2018.2806840","relation":{},"ISSN":["2168-2216","2168-2232"],"issn-type":[{"value":"2168-2216","type":"print"},{"value":"2168-2232","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}