{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:58:15Z","timestamp":1782406695034,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Laboratory of Green Construction Technology and Equipment of China Nuclear Power Corporation","award":["CNNC-STGCL-KFKT-2022-001"],"award-info":[{"award-number":["CNNC-STGCL-KFKT-2022-001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11370-024-00541-6","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T09:02:12Z","timestamp":1716454932000},"page":"847-870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["An improved Quick Informed-RRT* algorithm based on hybrid bidirectional search and adaptive adjustment strategies"],"prefix":"10.1007","volume":"17","author":[{"given":"Yan","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1097-1578","authenticated-orcid":false,"given":"Linmao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"541_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1729881419839596","volume":"16","author":"F Rubio","year":"2019","unstructured":"Rubio F, Valero F, Llopis-Albert C (2019) A review of mobile robots: concepts, methods, theoretical framework, and applications. Int J Adv Robot Syst 16:1\u201322. https:\/\/doi.org\/10.1177\/1729881419839596","journal-title":"Int J Adv Robot Syst"},{"key":"541_CR2","doi-asserted-by":"publisher","DOI":"10.3390\/s18020571","author":"K Wei","year":"2018","unstructured":"Wei K, Ren B (2018) A method on dynamic path planning for robotic manipulator autonomous obstacle avoidance based on an improved RRT algorithm. Sensors (Switzerland). https:\/\/doi.org\/10.3390\/s18020571","journal-title":"Sensors (Switzerland)"},{"key":"541_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TIV.2016.2578706","volume":"1","author":"B Paden","year":"2016","unstructured":"Paden B, Cap M, Yong SZ et al (2016) A survey of motion planning and control techniques for self-driving urban vehicles. IEEE Trans Intell Veh 1:33\u201355. https:\/\/doi.org\/10.1109\/TIV.2016.2578706","journal-title":"IEEE Trans Intell Veh"},{"key":"541_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/8847863","volume":"2021","author":"Y Guo","year":"2021","unstructured":"Guo Y, Liu H, Fan X, Lyu W (2021) Research progress of path planning methods for autonomous underwater vehicle. Math Probl Eng 2021:1\u201325. https:\/\/doi.org\/10.1155\/2021\/8847863","journal-title":"Math Probl Eng"},{"key":"541_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.oceaneng.2018.06.018","volume":"163","author":"S Siv\u010dev","year":"2018","unstructured":"Siv\u010dev S, Coleman J, Omerdi\u0107 E et al (2018) Underwater manipulators: a review. Ocean Eng 163:431\u2013450. https:\/\/doi.org\/10.1016\/j.oceaneng.2018.06.018","journal-title":"Ocean Eng"},{"key":"541_CR6","doi-asserted-by":"publisher","first-page":"9137","DOI":"10.3390\/app10249137","volume":"10","author":"H Zhang","year":"2020","unstructured":"Zhang H, Zhu Z (2020) Sampling-based motion planning for free-floating space robot without inverse kinematics. Appl Sci 10:9137. https:\/\/doi.org\/10.3390\/app10249137","journal-title":"Appl Sci"},{"key":"541_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.apor.2018.12.001","volume":"83","author":"R Song","year":"2019","unstructured":"Song R, Liu Y, Bucknall R (2019) Smoothed A* algorithm for practical unmanned surface vehicle path planning. Appl Ocean Res 83:9\u201320. https:\/\/doi.org\/10.1016\/j.apor.2018.12.001","journal-title":"Appl Ocean Res"},{"key":"541_CR8","doi-asserted-by":"crossref","unstructured":"Kang H Il, Lee B, Kim K (2008) Path planning algorithm using the particle swarm optimization and the improved dijkstra algorithm. In: 2008 IEEE pacific-asia workshop on computational intelligence and industrial application, pp 1002\u20131004","DOI":"10.1109\/PACIIA.2008.376"},{"key":"541_CR9","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. Int J Rob Res 5:90\u201398. https:\/\/doi.org\/10.1177\/027836498600500106","journal-title":"Int J Rob Res"},{"key":"541_CR10","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 Robots 40:1079\u20131093. https:\/\/doi.org\/10.1007\/s10514-015-9518-0","journal-title":"Auton Robots"},{"key":"541_CR11","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1177\/0278364913488805","volume":"32","author":"M Zucker","year":"2013","unstructured":"Zucker M, Ratliff N, Dragan AD et al (2013) CHOMP: covariant hamiltonian optimization for motion planning. Int J Rob Res 32:1164\u20131193. https:\/\/doi.org\/10.1177\/0278364913488805","journal-title":"Int J Rob Res"},{"key":"541_CR12","doi-asserted-by":"crossref","unstructured":"Kalakrishnan M, Chitta S, Theodorou E et al (2011) STOMP: stochastic trajectory optimization for motion planning. In: 2011 IEEE international conference on robotics and automation, pp 4569\u20134574","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"541_CR13","doi-asserted-by":"crossref","unstructured":"Mukadam M, Yan X, Boots B (2016) Gaussian process motion planning. In: 2016 IEEE international conference on robotics and automation (ICRA), pp 9\u201315","DOI":"10.1109\/ICRA.2016.7487091"},{"key":"541_CR14","doi-asserted-by":"publisher","first-page":"3914","DOI":"10.1109\/TASE.2021.3139163","volume":"19","author":"J Meng","year":"2022","unstructured":"Meng J, Liu Y, Bucknall R et al (2022) Anisotropic GPMP2: a fast continuous-time Gaussian processes based motion planner for unmanned surface vehicles in environments with ocean currents. IEEE Trans Autom Sci Eng 19:3914\u20133931. https:\/\/doi.org\/10.1109\/TASE.2021.3139163","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"541_CR15","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/robot.2000.844730","volume":"2","author":"JJ Kuffner","year":"2000","unstructured":"Kuffner JJ, La Valle SM (2000) RRT-connect: an efficient approach to single-query path planning. Proc IEEE Int Conf Robot Autom 2:995\u20131001. https:\/\/doi.org\/10.1109\/robot.2000.844730","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"541_CR16","doi-asserted-by":"publisher","first-page":"18658","DOI":"10.1109\/ACCESS.2020.2968471","volume":"8","author":"R Mashayekhi","year":"2020","unstructured":"Mashayekhi R, Idris MYI, Anisi MH, Ahmedy I (2020) Hybrid RRT: a semi-dual-tree RRT-based motion planner. IEEE Access 8:18658\u201318668. https:\/\/doi.org\/10.1109\/ACCESS.2020.2968471","journal-title":"IEEE Access"},{"key":"541_CR17","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1109\/ACCESS.2019.2958876","volume":"8","author":"C Yuan","year":"2020","unstructured":"Yuan C, Zhang W, Liu G et al (2020) A heuristic rapidly-exploring random trees method for manipulator motion planning. IEEE Access 8:900\u2013910. https:\/\/doi.org\/10.1109\/ACCESS.2019.2958876","journal-title":"IEEE Access"},{"key":"541_CR18","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/TRO.2014.2331091","volume":"30","author":"J Ichnowski","year":"2014","unstructured":"Ichnowski J, Alterovitz R (2014) Scalable multicore motion planning using lock-free concurrency. IEEE Trans Robot 30:1123\u20131136. https:\/\/doi.org\/10.1109\/TRO.2014.2331091","journal-title":"IEEE Trans Robot"},{"key":"541_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s11370-019-00281-y","volume":"12","author":"G Kang","year":"2019","unstructured":"Kang G, Kim YB, Lee YH et al (2019) Sampling-based motion planning of manipulator with goal-oriented sampling. Intell Serv Robot 12:265\u2013273. https:\/\/doi.org\/10.1007\/s11370-019-00281-y","journal-title":"Intell Serv Robot"},{"key":"541_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.eswa.2018.01.035","volume":"99","author":"A Hidalgo-Paniagua","year":"2018","unstructured":"Hidalgo-Paniagua A, Bandera JP, Ruiz-de-Quintanilla M, Bandera A (2018) Quad-RRT: a real-time GPU-based global path planner in large-scale real environments. Expert Syst Appl 99:141\u2013154. https:\/\/doi.org\/10.1016\/j.eswa.2018.01.035","journal-title":"Expert Syst Appl"},{"key":"541_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.3390\/s21020333","volume":"21","author":"J-G Kang","year":"2021","unstructured":"Kang J-G, Lim D-W, Choi Y-S et al (2021) Improved RRT-connect algorithm based on triangular inequality for robot path planning. Sensors 21:333. https:\/\/doi.org\/10.3390\/s21020333","journal-title":"Sensors"},{"key":"541_CR22","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. Int J Rob Res 30:846\u2013894. https:\/\/doi.org\/10.1177\/0278364911406761","journal-title":"Int J Rob Res"},{"key":"541_CR23","doi-asserted-by":"crossref","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","DOI":"10.1109\/IROS.2014.6942976"},{"key":"541_CR24","doi-asserted-by":"publisher","DOI":"10.5772\/56718","author":"J Nasir","year":"2013","unstructured":"Nasir J, Islam F, Malik U et al (2013) RRT*-SMART: a rapid convergence implementation of RRT*. Int J Adv Robot Syst. https:\/\/doi.org\/10.5772\/56718","journal-title":"Int J Adv Robot Syst"},{"key":"541_CR25","doi-asserted-by":"publisher","first-page":"101937","DOI":"10.1016\/j.jocs.2022.101937","volume":"67","author":"J Ding","year":"2023","unstructured":"Ding J, Zhou Y, Huang X et al (2023) An improved RRT* algorithm for robot path planning based on path expansion heuristic sampling. J Comput Sci 67:101937. https:\/\/doi.org\/10.1016\/j.jocs.2022.101937","journal-title":"J Comput Sci"},{"key":"541_CR26","doi-asserted-by":"crossref","unstructured":"Adiyatov O, Varol HA (2013) Rapidly-exploring random tree based memory efficient motion planning. In: 2013 IEEE international conference on mechatronics and automation. IEEE ICMA, pp 354\u2013359","DOI":"10.1109\/ICMA.2013.6617944"},{"key":"541_CR27","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":"541_CR28","doi-asserted-by":"publisher","first-page":"113425","DOI":"10.1016\/j.eswa.2020.113425","volume":"152","author":"Y Li","year":"2020","unstructured":"Li Y, Wei W, Gao Y et al (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":"541_CR29","doi-asserted-by":"crossref","unstructured":"Qureshi AH, Mumtaz S, Iqbal KF et al (2013) Adaptive potential guided directional-RRT*. In: 2013 IEEE international conference on robotics and biomimetics (ROBIO)","DOI":"10.1109\/ROBIO.2013.6739744"},{"key":"541_CR30","doi-asserted-by":"crossref","unstructured":"Klemm S, Oberlander J, Hermann A, et al (2015) RRT\u2217-connect: faster, asymptotically optimal motion planning. In: 2015 IEEE international conference on robotics and biomimetics, IEEE-ROBIO 2015. Institute of Electrical and Electronics Engineers Inc., pp 1670\u20131677","DOI":"10.1109\/ROBIO.2015.7419012"},{"key":"541_CR31","doi-asserted-by":"publisher","first-page":"95046","DOI":"10.1109\/ACCESS.2019.2928846","volume":"7","author":"W Xinyu","year":"2019","unstructured":"Xinyu W, Xiaojuan L, Yong G et al (2019) Bidirectional potential guided RRT* for motion planning. IEEE Access 7:95046\u201395057. https:\/\/doi.org\/10.1109\/ACCESS.2019.2928846","journal-title":"IEEE Access"},{"key":"541_CR32","doi-asserted-by":"publisher","first-page":"19842","DOI":"10.1109\/ACCESS.2020.2969316","volume":"8","author":"R Mashayekhi","year":"2020","unstructured":"Mashayekhi R, Idris MYI, Anisi MH et al (2020) Informed RRT*-connect: an asymptotically optimal single-query path planning method. IEEE Access 8:19842\u201319852. https:\/\/doi.org\/10.1109\/ACCESS.2020.2969316","journal-title":"IEEE Access"},{"key":"541_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119137","author":"J Fan","year":"2023","unstructured":"Fan J, Chen X, Liang X (2023) UAV trajectory planning based on bi-directional APF-RRT* algorithm with goal-biased. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2022.119137","journal-title":"Expert Syst Appl"},{"key":"541_CR34","doi-asserted-by":"crossref","unstructured":"Tu Z, Zhuang W, Leng Y, Fu C (2023) Accelerated Informed RRT*: fast and asymptotically path planning method combined with RRT*-connect and APF. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics). Springer, Deutschland, pp 279\u2013292","DOI":"10.1007\/978-981-99-6501-4_24"},{"key":"541_CR35","doi-asserted-by":"publisher","first-page":"3985","DOI":"10.1109\/TIE.2022.3177801","volume":"70","author":"F Yu","year":"2023","unstructured":"Yu F, Chen Y (2023) Cyl-IRRT*: homotopy optimal 3D path planning for AUVs by biasing the sampling into a cylindrical informed subset. IEEE Trans Ind Electron 70:3985\u20133994. https:\/\/doi.org\/10.1109\/TIE.2022.3177801","journal-title":"IEEE Trans Ind Electron"},{"key":"541_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120403","author":"YM Liang","year":"2023","unstructured":"Liang YM, Zhao HY (2023) CCPF-RRT*: an improved path planning algorithm with consideration of congestion. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2023.120403","journal-title":"Expert Syst Appl"},{"key":"541_CR37","doi-asserted-by":"publisher","first-page":"115457","DOI":"10.1016\/j.eswa.2021.115457","volume":"184","author":"B Liao","year":"2021","unstructured":"Liao B, Wan F, Hua Y et al (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"},{"key":"541_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10846-009-9383-1","volume":"57","author":"C Goerzen","year":"2010","unstructured":"Goerzen C, Kong Z, Mettler B (2010) A survey of motion planning algorithms from the perspective of autonomous UAV guidance. J Intell Robot Syst Theory Appl 57:65\u2013100. https:\/\/doi.org\/10.1007\/s10846-009-9383-1","journal-title":"J Intell Robot Syst Theory Appl"},{"key":"541_CR39","doi-asserted-by":"crossref","unstructured":"Adiyatov O, Varol HA (2017) A Novel RRT*-based algorithm for motion planning in dynamic environments. In: 2017 IEEE international conference on mechatronics and automation (ICMA). pp 1416\u20131421","DOI":"10.1109\/ICMA.2017.8016024"},{"key":"541_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","volume":"68","author":"AH Qureshi","year":"2015","unstructured":"Qureshi AH, Ayaz Y (2015) Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Rob Auton Syst 68:1\u201311. https:\/\/doi.org\/10.1016\/j.robot.2015.02.007","journal-title":"Rob Auton Syst"},{"key":"541_CR41","doi-asserted-by":"crossref","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2015) Batch informed trees (BIT*): sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. In: 2015 IEEE international conference on robotics and automation (ICRA), pp 3067\u20133074","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"541_CR42","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1109\/LRA.2023.3245409","volume":"8","author":"W Zhang","year":"2023","unstructured":"Zhang W, Shan L, Chang L, Dai Y (2023) SVF-RRT*: a stream-based VF-RRT\u2217 for USVs path planning considering ocean currents. IEEE Robot Autom Lett 8:2413\u20132420. https:\/\/doi.org\/10.1109\/LRA.2023.3245409","journal-title":"IEEE Robot Autom Lett"},{"key":"541_CR43","unstructured":"Kleinbort M, Salzman O, Halperin D (2016) Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-024-00541-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-024-00541-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-024-00541-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T13:24:56Z","timestamp":1721654696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-024-00541-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s11370-024-00541-6","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"8 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no financial interest associated with the content of manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}