{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T11:16:50Z","timestamp":1783163810377,"version":"3.54.6"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2020MF087"],"award-info":[{"award-number":["ZR2020MF087"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"publisher","award":["2019YFA0706502-3"],"award-info":[{"award-number":["2019YFA0706502-3"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3307135","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T17:57:05Z","timestamp":1692640625000},"page":"92416-92423","source":"Crossref","is-referenced-by-count":8,"title":["The Dynamic Path Planning of Indoor Robot Fusing B-Spline and Improved Anytime Repairing A* Algorithm"],"prefix":"10.1109","volume":"11","author":[{"given":"Menglong","family":"Cao","sequence":"first","affiliation":[{"name":"College of Automation and Electronic Engineering, Qingdao University of Science Technology, Qingdao, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2890-6280","authenticated-orcid":false,"given":"Bingxin","family":"Li","sequence":"additional","affiliation":[{"name":"College of Automation and Electronic Engineering, Qingdao University of Science Technology, Qingdao, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengge","family":"Shi","sequence":"additional","affiliation":[{"name":"College of Automation and Electronic Engineering, Qingdao University of Science Technology, Qingdao, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"262","article-title":"Anytime dynamic A*: An anytime, replanning algorithm","volume":"5","author":"likhachev","year":"2005","journal-title":"Proc ICAPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2096"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.11.010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2009.2015886"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1792\/1\/012067"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-021-03625-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2016.03.010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2011.2109332"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001418590085"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2161-7"},{"key":"ref17","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","volume":"16","author":"likhachev","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-020-01240-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18558"},{"key":"ref18","first-page":"2250","article-title":"AWA*—A window constrained anytime heuristic search algorithm","author":"aine","year":"2007","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.06.013"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.098"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023999"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2019.05674"},{"key":"ref6","first-page":"20","article-title":"A comparison of RRT, RRT* and RRT*-smart path planning algorithms","volume":"16","author":"noreen","year":"2016","journal-title":"Int J Comput Sci Network Secur"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3108973"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10225498.pdf?arnumber=10225498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:36:49Z","timestamp":1695667009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10225498\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3307135","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}