{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:57:30Z","timestamp":1768453050407,"version":"3.49.0"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSTC","award":["111-2221-E-008-097"],"award-info":[{"award-number":["111-2221-E-008-097"]}]},{"name":"NSTC","award":["112-2221-E-008-075"],"award-info":[{"award-number":["112-2221-E-008-075"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/lra.2024.3387123","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T18:26:27Z","timestamp":1712773587000},"page":"5062-5069","source":"Crossref","is-referenced-by-count":2,"title":["Map Explorations via Dynamic Tree Structured Graph"],"prefix":"10.1109","volume":"9","author":[{"given":"Rei-Shu","family":"Shieh","sequence":"first","affiliation":[{"name":"Mathematics Department, National Central University, Taoyuan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7818-5821","authenticated-orcid":false,"given":"Kuo-Shih","family":"Tseng","sequence":"additional","affiliation":[{"name":"Mathematics Department, National Central University, Taoyuan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/027836402128964099"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487281"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3243792"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3051563"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2969191"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3186511"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10160295"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3142923"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.abp9742"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00101-z"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"issue":"6","key":"ref16","first-page":"1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume-title":"Operations Res.","volume":"18","author":"Held","year":"1970"},{"key":"ref17","article-title":"The traveling salesman problem: A comprehensive survey","author":"Zambito","year":"2006"},{"issue":"3","key":"ref18","first-page":"489","article-title":"Submodularity and the traveling salesman problem","volume-title":"Eur. J. Oper. Res.","volume":"114","author":"Herer","year":"1999"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"ref20","article-title":"Informative path planning using cost-benefit spanning tree","author":"Chiu","year":"2023"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-021-01565-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-021-10025-6"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10504377\/10496166.pdf?arnumber=10496166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T04:24:28Z","timestamp":1713587068000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10496166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2024.3387123","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}