{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:45:32Z","timestamp":1756385132423,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS1449505","IIS1548406"],"award-info":[{"award-number":["IIS1449505","IIS1548406"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/lra.2016.2635107","type":"journal-article","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T19:26:28Z","timestamp":1480706788000},"page":"428-435","source":"Crossref","is-referenced-by-count":10,"title":["Multiregion Inspection by Combining Clustered Traveling Salesman Tours With Sampling-Based Motion Planning"],"prefix":"10.1109","volume":"2","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Pomarlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erion","family":"Plaku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Numerical Methods for Two-Point Boundary-Value Problems","year":"1992","author":"keller","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.913993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631159"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556421"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2014.6932874"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2668064.2668090"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/cav.1688"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(75)90015-5"},{"key":"ref19","first-page":"160","article-title":"Truncated branch-and-bound: A case study on the asymmetric TSP","author":"zhang","year":"1993","journal-title":"Proc AAAI Spring Symp AI NP-Hard Probl"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041701"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020722624682"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630643"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844726"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref2","volume":"57","author":"o'rourke","year":"1987","journal-title":"Art Gallery Theorems and Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00147-B"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1609\/icaps.v22i1.13529","article-title":"Sampling-based coverage path planning for inspection of complex structures","author":"englot","year":"2012","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011432"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90045-D"},{"key":"ref21","first-page":"1","article-title":"Solving the clustered traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm","author":"helsgaun","year":"2011","journal-title":"Research Report Computer Science"},{"key":"ref23","first-page":"362","article-title":"A transformation for extracting new descriptors of shape","author":"blum","year":"1967","journal-title":"Models for the Perception of Speech and Visual Form"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/7083369\/7797562\/7765102-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/7797562\/07765102.pdf?arnumber=7765102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T05:02:44Z","timestamp":1692594164000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7765102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":23,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2016.2635107","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}