{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:15:47Z","timestamp":1774350947970,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Program for Youth Innovative Research Team in the University of Shandong Province in China","award":["2019KJN010"],"award-info":[{"award-number":["2019KJN010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3226465","type":"journal-article","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T20:57:09Z","timestamp":1670014629000},"page":"127168-127181","source":"Crossref","is-referenced-by-count":21,"title":["CAF-RRT<sup>*<\/sup>: A 2D Path Planning Algorithm Based on Circular Arc Fillet Method"],"prefix":"10.1109","volume":"10","author":[{"given":"Binpeng","family":"Wang","sequence":"first","affiliation":[{"name":"School of Information and Automation, Shandong Academy of Sciences, Qilu University of Technology, Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianyuan","family":"Ju","sequence":"additional","affiliation":[{"name":"School of Information and Automation, Shandong Academy of Sciences, Qilu University of Technology, Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangzhou","family":"Xu","sequence":"additional","affiliation":[{"name":"Jinan Engineering Laboratory of Human&#x2013;Machine Intelligent Cooperation, Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-6832","authenticated-orcid":false,"given":"Chao","family":"Feng","sequence":"additional","affiliation":[{"name":"Jinan Engineering Laboratory of Human&#x2013;Machine Intelligent Cooperation, Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanglong","family":"Xun","sequence":"additional","affiliation":[{"name":"Shandong MAIYUE Wenbao Technology Company Ltd., Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.5391\/IJFIS.2021.21.3.213"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2968471"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref13","first-page":"1651","article-title":"RRT*-smart: Rapid convergence implementation of RRT* towards optimal solution","author":"islam","year":"2012","journal-title":"Proc IEEE Int Conf Mechtron Automat"},{"key":"ref14","first-page":"2997","article-title":"Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"gammell","year":"2014","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969316"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-017-0236-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23502"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16841-8_7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.032"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2998740"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/70.660866"},{"key":"ref5","first-page":"98","author":"lavalle","year":"1998","journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref7","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 Netw Secur"},{"key":"ref2","first-page":"2543","article-title":"Robot goal guide RRT path planning based on sub-target search","volume":"35","author":"ruan","year":"2020","journal-title":"Control Decis"},{"key":"ref1","first-page":"1","article-title":"Robot localization from planned path constraints","volume":"44","author":"zhaozheng","year":"2022","journal-title":"J Electron Inf Technol"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/app112411777"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949835"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3197628"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.036"},{"key":"ref24","article-title":"MRPB 1.0: A unified benchmark for the evaluation of mobile robot local planning approaches","author":"wen","year":"2020","journal-title":"arXiv 2011 00491"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050755-2.50044-0"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09969595.pdf?arnumber=9969595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:32:41Z","timestamp":1672083161000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9969595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3226465","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}