{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T20:51:36Z","timestamp":1780865496429,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873101"],"award-info":[{"award-number":["61873101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11370-025-00599-w","type":"journal-article","created":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T09:13:06Z","timestamp":1744881186000},"page":"499-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ffc-rrt*: An adaptive hybrid sampling path planning algorithm with rapid initial solution convergence"],"prefix":"10.1007","volume":"18","author":[{"given":"Zhang","family":"Su","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9330-2473","authenticated-orcid":false,"given":"Qiang","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tingting","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"issue":"18","key":"599_CR1","doi-asserted-by":"publisher","first-page":"2250","DOI":"10.3390\/electronics10182250","volume":"10","author":"F Gul","year":"2021","unstructured":"Gul F, Mir I, Abualigah L, Sumari P, Forestiero A (2021) A consolidated review of path planning and optimization techniques: Technical perspectives and future directions. Electronics 10(18):2250. https:\/\/doi.org\/10.3390\/electronics10182250","journal-title":"Electronics"},{"issue":"2","key":"599_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4(2):100\u2013107. https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE transactions on Systems Science and Cybernetics"},{"key":"599_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"K Daniel","year":"2010","unstructured":"Daniel K, Nash A, Koenig S, Felner A (2010) Theta*: Any-angle path planning on grids. Journal of Artificial Intelligence Research 39:533\u2013579. https:\/\/doi.org\/10.1613\/jair.2994","journal-title":"Journal of Artificial Intelligence Research"},{"key":"599_CR4","doi-asserted-by":"publisher","unstructured":"A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287\u2013290 (2022). https:\/\/doi.org\/10.1145\/3544585.3544600","DOI":"10.1145\/3544585.3544600"},{"key":"599_CR5","doi-asserted-by":"publisher","unstructured":"Schulman J, Ho J, Lee AX, et al. Finding locally optimal, collision-free trajectories with sequential convex optimization. In: Robotics: Science and Systems, vol. 9, pp. 1\u201310. https:\/\/doi.org\/10.15607\/rss.2013.ix.031","DOI":"10.15607\/rss.2013.ix.031"},{"key":"599_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102516","volume":"82","author":"T Weingartshofer","year":"2023","unstructured":"Weingartshofer T, Bischof B, Meiringer M, Hartl-Nesic C, Kugi A (2023) Optimization-based path planning framework for industrial manufacturing processes with complex continuous paths. Robotics and Computer-Integrated Manufacturing 82:102516. https:\/\/doi.org\/10.1016\/j.rcim.2022.102516","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"1","key":"599_CR7","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. The international journal of robotics research 5(1):90\u201398. https:\/\/doi.org\/10.1177\/027836498600500106","journal-title":"The international journal of robotics research"},{"key":"599_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","volume":"127","author":"C Lamini","year":"2018","unstructured":"Lamini C, Benhlima S, Elbekri A (2018) Genetic algorithm based approach for autonomous mobile robot path planning. Procedia Computer Science 127:180\u2013189. https:\/\/doi.org\/10.1016\/j.procs.2018.01.113","journal-title":"Procedia Computer Science"},{"issue":"4","key":"599_CR9","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed AW, Sahoo NC, Geok TK (2008) Solving shortest path problem using particle swarm optimization. Appl Soft Comput 8(4):1643\u20131653. https:\/\/doi.org\/10.1016\/j.asoc.2008.01.002","journal-title":"Appl Soft Comput"},{"key":"599_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.advengsoft.2016.05.015","volume":"99","author":"S Zhang","year":"2016","unstructured":"Zhang S, Zhou Y, Li Z, Pan W (2016) Grey wolf optimizer for unmanned combat aerial vehicle path planning. Adv Eng Softw 99:121\u2013136. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.05.015","journal-title":"Adv Eng Softw"},{"key":"599_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2022.107593","volume":"205","author":"Y Wang","year":"2023","unstructured":"Wang Y, He Z, Cao D, Ma L, Li K, Jia L, Cui Y (2023) Coverage path planning for kiwifruit picking robots based on deep reinforcement learning. Comput Electron Agric 205:107593. https:\/\/doi.org\/10.1016\/j.compag.2022.107593","journal-title":"Comput Electron Agric"},{"issue":"7","key":"599_CR12","doi-asserted-by":"publisher","first-page":"722","DOI":"10.3390\/machines11070722","volume":"11","author":"F Noroozi","year":"2023","unstructured":"Noroozi F, Daneshmand M, Fiorini P (2023) Conventional, heuristic and learning-based robot motion planning: Reviewing frameworks of current practical significance. Machines 11(7):722. https:\/\/doi.org\/10.3390\/machines11070722","journal-title":"Machines"},{"key":"599_CR13","unstructured":"LaValle S (1998) Rapidly-exploring random trees: A new tool for path planning. Research Report 9811"},{"issue":"4","key":"599_CR14","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki LE, Svestka P, Latombe J-C, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans Robot Autom 12(4):566\u2013580. https:\/\/doi.org\/10.1109\/70.508439","journal-title":"IEEE Trans Robot Autom"},{"key":"599_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113425","volume":"152","author":"Y Li","year":"2020","unstructured":"Li Y, Wei W, Gao Y, Wang D, Fan Z (2020) Pq-rrt*: An improved path planning algorithm for mobile robots. Expert Syst Appl 152:113425. https:\/\/doi.org\/10.1016\/j.eswa.2020.113425","journal-title":"Expert Syst Appl"},{"key":"599_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106875","volume":"126","author":"S Yu","year":"2023","unstructured":"Yu S, Chen J, Liu G, Tong X, Sun Y (2023) Sof-rrt*: An improved path planning algorithm using spatial offset sampling. Eng Appl Artif Intell 126:106875. https:\/\/doi.org\/10.1016\/j.engappai.2023.106875","journal-title":"Eng Appl Artif Intell"},{"issue":"7","key":"599_CR17","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. The international journal of robotics research 30(7):846\u2013894. https:\/\/doi.org\/10.1177\/0278364911406761","journal-title":"The international journal of robotics research"},{"key":"599_CR18","doi-asserted-by":"publisher","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 2997\u20133004. https:\/\/doi.org\/10.1109\/IROS.2014.6942976 . IEEE","DOI":"10.1109\/IROS.2014.6942976"},{"key":"599_CR19","doi-asserted-by":"publisher","first-page":"8273","DOI":"10.1007\/s40747-024-01576","volume":"10","author":"Y Zhou","year":"2024","unstructured":"Zhou Y, Lu Y, Lv L (2024) Gvp-rrt: A grid based variable probability rapidly-exploring random tree algorithm for agv path planning. Complex Intelligence and Systems 10:8273\u20138286. https:\/\/doi.org\/10.1007\/s40747-024-01576","journal-title":"Complex Intelligence and Systems"},{"issue":"2","key":"599_CR20","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1002\/tee.23502","volume":"17","author":"Q Li","year":"2022","unstructured":"Li Q, Wang J, Li H, Wang B, Feng C (2022) Fast-rrt*: An improved motion planner for mobile robot in two-dimensional space. IEEJ Trans Electr Electron Eng 17(2):200\u2013208. https:\/\/doi.org\/10.1002\/tee.23502","journal-title":"IEEJ Trans Electr Electron Eng"},{"key":"599_CR21","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10514-015-9518-0","volume":"40","author":"AH Qureshi","year":"2016","unstructured":"Qureshi AH, Ayaz Y (2016) Potential functions based sampling heuristic for optimal path planning. Auton Robot 40:1079\u20131093. https:\/\/doi.org\/10.1007\/s10514-015-9518-0","journal-title":"Auton Robot"},{"key":"599_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","volume":"123","author":"I-B Jeong","year":"2019","unstructured":"Jeong I-B, Lee S-J, Kim J-H (2019) Quick-rrt*: Triangular inequality-based implementation of rrt* with improved initial solution and convergence rate. Expert Syst Appl 123:82\u201390. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.032","journal-title":"Expert Syst Appl"},{"key":"599_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115457","volume":"184","author":"B Liao","year":"2021","unstructured":"Liao B, Wan F, Hua Y, Ma R, Zhu S, Qing X (2021) F-rrt*: An improved path planning algorithm with improved initial solution and convergence rate. Expert Syst Appl 184:115457. https:\/\/doi.org\/10.1016\/j.eswa.2021.115457","journal-title":"Expert Syst Appl"},{"issue":"2","key":"599_CR24","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1109\/TIV.2023.3349171","volume":"9","author":"Z Sun","year":"2024","unstructured":"Sun Z, Lei B, Xie P, Liu F, Gao J, Zhang Y, Wang J (2024) Multi-risk-rrt: An efficient motion planning algorithm for robotic autonomous luggage trolley collection at airports. IEEE Transactions on Intelligent Vehicles 9(2):3450\u20133463. https:\/\/doi.org\/10.1109\/TIV.2023.3349171","journal-title":"IEEE Transactions on Intelligent Vehicles"},{"key":"599_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2024.108707","volume":"218","author":"M Kang","year":"2024","unstructured":"Kang M, Chen Q, Fan Z, Yu C, Wang Y, Yu X (2024) A rrt based path planning scheme for multi-dof robots in unstructured environments. Comput Electron Agric 218:108707. https:\/\/doi.org\/10.1016\/j.compag.2024.108707","journal-title":"Comput Electron Agric"},{"key":"599_CR26","doi-asserted-by":"publisher","unstructured":"Wang J, Li J, Song Y, Tuo Y, Liu C (2024) Fc-rrt*: A modified rrt* with rapid convergence in complex environments. Journal of Computational Science 77:102239. https:\/\/doi.org\/10.1016\/j.jocs.2024.102239","DOI":"10.1016\/j.jocs.2024.102239"},{"key":"599_CR27","doi-asserted-by":"publisher","unstructured":"Kuffner JJ, LaValle SM (2000) Rrt-connect: An efficient approach to single-query path planning. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), vol. 2, pp. 995\u20131001. https:\/\/doi.org\/10.1109\/ROBOT.2000.844730 . IEEE","DOI":"10.1109\/ROBOT.2000.844730"},{"issue":"6","key":"599_CR28","doi-asserted-by":"publisher","first-page":"7249","DOI":"10.1007\/s40747-023-01111-6","volume":"9","author":"J Cong","year":"2023","unstructured":"Cong J, Hu J, Wang Y, He Z, Han L, Su M (2023) Ff-rrt*: a sampling-improved path planning algorithm for mobile robots against concave cavity obstacle. Complex & Intelligent Systems 9(6):7249\u20137267. https:\/\/doi.org\/10.1007\/s40747-023-01111-6","journal-title":"Complex & Intelligent Systems"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00599-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00599-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00599-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:47:37Z","timestamp":1750070857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00599-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,17]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["599"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00599-w","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,17]]},"assertion":[{"value":"2 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}