{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:39Z","timestamp":1740169359866,"version":"3.37.3"},"reference-count":40,"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:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Tsinghua University Initiative Scientific Research Program","award":["20234616001"],"award-info":[{"award-number":["20234616001"]}]},{"name":"2023 Tsinghua University Undergraduate Education and Teaching Reform Project","award":["69"],"award-info":[{"award-number":["69"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771281"],"award-info":[{"award-number":["61771281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Science and Technology Innovation 2030-New Generation Artificial Intelligence Major Project","doi-asserted-by":"publisher","award":["2018AAA0101605"],"award-info":[{"award-number":["2018AAA0101605"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3418072","type":"journal-article","created":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T20:08:16Z","timestamp":1719259696000},"page":"148111-148119","source":"Crossref","is-referenced-by-count":0,"title":["Fast Obstacle Avoidance Path Generation Algorithm for Multi-Target Point Coverage Traversal"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5632-7174","authenticated-orcid":false,"given":"Pengpeng","family":"Guo","sequence":"first","affiliation":[{"name":"Department of Automation, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9367-5290","authenticated-orcid":false,"given":"Chaoyi","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Automation, Tsinghua University, Beijing, China"}]},{"given":"Kan","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Automation, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6013-1921","authenticated-orcid":false,"given":"Qing","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Automation, Tsinghua University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rob.1036"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64107-2_12"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39934-8_16"},{"volume-title":"The Traveling Salesman Problem: A Computational Study","year":"2007","author":"Applegate","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.09.010"},{"key":"ref6","first-page":"1","article-title":"Multi-goal path planning for industrial robots","volume-title":"Proc. IEEE Int. Conf. Robot. Autom. (ICRA)","author":"Wurll"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/case48305.2020.9217008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2021.3060709"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2021.3068679"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/etfa52439.2022.9921589"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-48793-9_10"},{"key":"ref12","first-page":"162","article-title":"A steiner-zone heuristic for solving the close-enough traveling salesman problem","volume-title":"Proc. 12th INFORMS Comput. Soc. Conf.","author":"Mennell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.07.023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1062"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.07.024"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105831"},{"key":"ref17","first-page":"10","volume-title":"Handbook of Evolutionary Computation","volume":"1997","author":"Bck","year":"1201"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/WESCON.1995.485447"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631159"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574716000084"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2019.XV.057","article-title":"Toward asymptotically-optimal inspection planning via efficient near-optimal graph search","volume-title":"Robotics: Science and Systems XV","author":"Fu","year":"2019"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561653"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2900507"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942974"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942967"},{"article-title":"Multi-goal path optimization for robotic systems with redundancy based on the traveling salesman problem with neighborhoods","year":"2018","author":"Gentilini","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13539"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/robot.2000.844726"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/icra.2015.7140101"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29363-9_19"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"volume-title":"Pattern Recognition","year":"2010","author":"Zhang","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/tiv.2023.3313358"},{"volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","year":"2005","author":"Choset","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/iros.2014.6942975"},{"article-title":"Research on autonomous trajectory planning and navigation of micro UAV in complex closed environment","year":"2014","author":"Li","key":"ref40"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10568920.pdf?arnumber=10568920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T17:42:08Z","timestamp":1729273328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10568920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3418072","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}