{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:34:44Z","timestamp":1758191684229,"version":"3.44.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62473133"],"award-info":[{"award-number":["62473133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s44443-025-00186-0","type":"journal-article","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T08:12:15Z","timestamp":1755504735000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ABF-RRT*: Bidirectional fast optimal rapidly-exploring random tree via adaptive sampling of a permissible hyper-ellipsoid"],"prefix":"10.1007","volume":"37","author":[{"given":"Zhaoyang","family":"Zeng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8481-0830","authenticated-orcid":false,"given":"Yufang","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,18]]},"reference":[{"key":"186_CR1","doi-asserted-by":"publisher","unstructured":"Alabbadi A, Kanan A (2023) Genetic algorithm-based path planning for autonomous mobile robots. In: Proc IEEE Jordan Int Joint Conf Electr Eng Inf Technol (JEEIT), pp. 177\u2013180. https:\/\/doi.org\/10.1109\/JEEIT58638.2023.10185855","DOI":"10.1109\/JEEIT58638.2023.10185855"},{"key":"186_CR2","doi-asserted-by":"crossref","unstructured":"Arslan O, Tsiotras P (2013) Use of relaxation methods in sampling-based algorithms for optimal motion planning. In: Proc IEEE Int Conf Robot Autom","DOI":"10.1109\/ICRA.2013.6630906"},{"key":"186_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-14705-5_1","volume":"36","author":"P Boscariol","year":"2015","unstructured":"Boscariol P, Rossi R, Fiorini P (2015) Path planning and trajectory planning algorithms: a general overview. Mech Mach Sci 36:25\u201338. https:\/\/doi.org\/10.1007\/978-3-319-14705-5_1","journal-title":"Mech Mach Sci"},{"key":"186_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-40031-8_24","volume-title":"Computers and Games CG 2002, LNCS","author":"A Botea","year":"2002","unstructured":"Botea A, M\u00fcller M, Schaeffer J (2002) Using abstraction for planning in Sokoban. In: van den Herik HJ, Iida H, Heinz EA (eds) Computers and Games CG 2002, LNCS, vol 2883. Springer, Berlin, pp 360\u2013375. https:\/\/doi.org\/10.1007\/978-3-540-40031-8_24"},{"key":"186_CR5","doi-asserted-by":"publisher","unstructured":"Ceder K, He Y, Vu D, Zhang B, Lee D, Ahn HS (2024) Bird\u2019s-eye-view trajectory planning of multiple robots using continuous deep reinforcement learning and model predictive control. In: Proceedings of the 2024 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Abu Dhabi, United Arab Emirates, pp. 8002\u20138008. https:\/\/doi.org\/10.1109\/IROS58592.2024.10801434","DOI":"10.1109\/IROS58592.2024.10801434"},{"key":"186_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271. https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer Math"},{"issue":"1","key":"186_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/100.580977","volume":"4","author":"D Fox","year":"1997","unstructured":"Fox D, Burgard W, Thrun S (1997) The dynamic window approach to collision avoidance. IEEE Robot Autom Mag 4(1):23\u201333. https:\/\/doi.org\/10.1109\/100.580977","journal-title":"IEEE Robot Autom Mag"},{"key":"186_CR8","doi-asserted-by":"publisher","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014a) Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: IEEE\/RSJ Int Conf Intell Robot Syst, pp. 2997\u20133004. https:\/\/doi.org\/10.1109\/IROS.2014.6942949","DOI":"10.1109\/IROS.2014.6942949"},{"key":"186_CR9","doi-asserted-by":"crossref","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014b) Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. arXiv preprint arXiv:1405.5848. https:\/\/arxiv.org\/abs\/1405.5848","DOI":"10.1109\/ICRA.2015.7139620"},{"issue":"2","key":"186_CR10","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 Trans Syst Sci Cybern 4(2):100\u2013107. https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans Syst Sci Cybern"},{"issue":"5","key":"186_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.3390\/drones7050331","volume":"7","author":"T Huang","year":"2023","unstructured":"Huang T, Fan K, Sun W, Li W, Guo H (2023) Potential-Field-RRT: A path-planning algorithm for UAVs based on potential-field-oriented greedy strategy to extend random tree. Drones 7(5):331. https:\/\/doi.org\/10.3390\/drones7050331","journal-title":"Drones"},{"key":"186_CR13","doi-asserted-by":"publisher","first-page":"108776","DOI":"10.1016\/j.engappai.2024.108776","volume":"135","author":"Z Huang","year":"2024","unstructured":"Huang Z, Gao Y, Guo J, Qian C, Chen Q (2024) An adaptive bidirectional quick optimal Rapidly-exploring Random Tree algorithm for path planning. Eng Appl Artif Intell 135:108776. https:\/\/doi.org\/10.1016\/j.engappai.2024.108776","journal-title":"Eng Appl Artif Intell"},{"key":"186_CR14","doi-asserted-by":"publisher","unstructured":"Islam F, Nasir J, Malik U, Ayaz Y, Hasan O (2012) RRT*-Smart: Rapid convergence implementation of RRT* towards optimal solution. In: IEEE Int Conf Mechatron Autom, pp. 1651\u20131656. https:\/\/doi.org\/10.1109\/ICMA.2012.6359484","DOI":"10.1109\/ICMA.2012.6359484"},{"key":"186_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.020","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.020","journal-title":"Expert Syst Appl"},{"key":"186_CR16","unstructured":"Jordan M, Perez A (2013) Optimal bidirectional rapidly-exploring random trees. MIT-CSAIL-TR-2013\u2013021"},{"key":"186_CR17","doi-asserted-by":"crossref","unstructured":"Karaman S, Walter MR, Perez A, Frazzoli E, Teller S (2011) Anytime motion planning using the RRT*. In: Proc IEEE Int Conf Robot Autom, pp. 1478\u20131483","DOI":"10.1109\/ICRA.2011.5980479"},{"issue":"7","key":"186_CR18","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 Robot Res 30(7):846\u2013894. https:\/\/doi.org\/10.1177\/0278364911406761","journal-title":"Int J Robot Res"},{"key":"186_CR19","doi-asserted-by":"publisher","unstructured":"Khatib O (1985) Real-time obstacle avoidance for manipulators and mobile robots. In: Proceedings of the 1985 IEEE International Conference on Robotics and Automation, pp. 500\u2013505. IEEE, St. Louis, MO, USA. https:\/\/doi.org\/10.1109\/ROBOT.1985.1087247","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"186_CR20","doi-asserted-by":"publisher","unstructured":"Kim D, Lee J, Yoon S-E (2014) Cloud RRT*: Sampling cloud-based RRT*. In: IEEE Int Conf Robot Autom, pp. 2519\u20132526. https:\/\/doi.org\/10.1109\/ICRA.2014.6907113","DOI":"10.1109\/ICRA.2014.6907113"},{"issue":"1\u20132","key":"186_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig S, Likhachev M, Furcy D (2004) Lifelong planning A*. Artif Intell 155(1\u20132):93\u2013146","journal-title":"Artif Intell"},{"issue":"6","key":"186_CR22","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1109\/70.895825","volume":"16","author":"JJ Kuffner","year":"2000","unstructured":"Kuffner JJ, LaValle SM (2000) RRT-connect: An efficient approach to single-query path planning. IEEE Trans Robot Autom 16(6):793\u2013803. https:\/\/doi.org\/10.1109\/70.895825","journal-title":"IEEE Trans Robot Autom"},{"issue":"1","key":"186_CR23","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/70.700224","volume":"14","author":"SM LaValle","year":"1998","unstructured":"LaValle SM (1998) Rapidly-exploring random trees: A new tool for path planning. IEEE Trans Robot Autom 14(1):443\u2013449. https:\/\/doi.org\/10.1109\/70.700224","journal-title":"IEEE Trans Robot Autom"},{"key":"186_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle SM (2006) Planning Algorithms. Cambridge University Press, Cambridge"},{"issue":"2","key":"186_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/JAS.2022.9673667","volume":"9","author":"B Li","year":"2022","unstructured":"Li B, Chen B (2022) An adaptive rapidly-exploring random tree. IEEE\/CAA J Autom Sin 9(2):283\u2013294. https:\/\/doi.org\/10.1109\/JAS.2022.9673667","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"186_CR26","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, 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":"186_CR27","doi-asserted-by":"publisher","unstructured":"Li J, Xiong Y, She J (2021) An improved ant colony optimization for path planning with multiple UAVs. In: Proc IEEE Int Conf Mechatronics (ICM), pp. 1\u20135. https:\/\/doi.org\/10.1109\/ICM46511.2021.9385695","DOI":"10.1109\/ICM46511.2021.9385695"},{"key":"186_CR28","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, 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"},{"key":"186_CR29","doi-asserted-by":"publisher","unstructured":"Lin Y, Zhang W, Mu C, Wang J (2022) Application of improved RRT algorithm in unmanned surface vehicle path planning. In: Proc Chin Control Decis Conf (CCDC), pp. 4861\u20134865. https:\/\/doi.org\/10.1109\/CCDC55256.2022.10034282","DOI":"10.1109\/CCDC55256.2022.10034282"},{"key":"186_CR30","doi-asserted-by":"publisher","first-page":"126291","DOI":"10.1016\/j.eswa.2024.126291","volume":"268","author":"J Liu","year":"2025","unstructured":"Liu J, Fu M, Zhang W, Chen B, Sychou U, Belotserkovsky A (2025) CDRT-RRT*: Real-time rapidly exploring Random Tree Star based on convex dissection. Expert Syst Appl 268:126291. https:\/\/doi.org\/10.1016\/j.eswa.2024.126291","journal-title":"Expert Syst Appl"},{"key":"186_CR31","doi-asserted-by":"crossref","unstructured":"Luders BD, Karaman S, Frazzoli E, How JP (2010) Bounds on tracking error using closed-loop rapidly-exploring random trees. In: Proc Am Control Conf, pp. 5406\u20135412","DOI":"10.1109\/ACC.2010.5530777"},{"key":"186_CR32","doi-asserted-by":"crossref","unstructured":"Naderi K, Rajam\u00e4ki J, H\u00e4m\u00e4l\u00e4inen P (2015) RT-RRT*: A real-time path planning algorithm based on RRT. In: Proc 8th ACM SIGGRAPH Conf Motion Games, pp. 113\u2013118","DOI":"10.1145\/2822013.2822036"},{"key":"186_CR33","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami TM, El-Saleh AA, Alswaitti M, Al-Tashi Q, Summakieh MA, Mirjalili S (2022) Particle swarm optimization: A comprehensive survey. IEEE Access 10:10031\u201310061. https:\/\/doi.org\/10.1109\/ACCESS.2022.3142859","journal-title":"IEEE Access"},{"key":"186_CR34","volume-title":"Springer Handbook of Robotics","year":"2016","unstructured":"Siciliano B, Khatib O (eds) (2016) Springer Handbook of Robotics, 2nd edn. Springer, Berlin","edition":"2"},{"key":"186_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815652","volume-title":"Spacecraft dynamics and control: A practical engineering approach","author":"M Sidi","year":"1997","unstructured":"Sidi M (1997) Spacecraft dynamics and control: A practical engineering approach. Cambridge University Press, Cambridge"},{"key":"186_CR37","doi-asserted-by":"publisher","unstructured":"Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proc IEEE Int Conf Robot Autom, 3310\u20133317. https:\/\/doi.org\/10.1109\/ROBOT.1994.351061","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"186_CR38","doi-asserted-by":"publisher","unstructured":"Tahirovic A, Ferizbegovic M (2018) Rapidly-exploring random vines (RRV) for motion planning in configuration spaces with narrow passages. In: Proc IEEE Int Conf Robot Autom, pp. 7055\u20137062. https:\/\/doi.org\/10.1109\/ICRA.2018.8460186","DOI":"10.1109\/ICRA.2018.8460186"},{"key":"186_CR39","doi-asserted-by":"publisher","unstructured":"Tong Y, Wu H, Zheng X, Chen Y, Chen Z (2021) Fast jump point search based path planning for mobile robots. In: Proc 4th Int Conf Intell Auton Syst (ICoIAS), pp. 81\u201385. https:\/\/doi.org\/10.1109\/ICoIAS53694.2021.00081","DOI":"10.1109\/ICoIAS53694.2021.00081"},{"key":"186_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2999218","author":"J Wang","year":"2020","unstructured":"Wang J, Chi W, Li C, Wang C, Meng MQH (2020) Neural RRT*: Learning-based optimal path planning. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2020.2999218","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"3","key":"186_CR41","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1109\/TASE.2021.3130372","volume":"19","author":"J Wang","year":"2022","unstructured":"Wang J, Chi W, Li C, Meng MQH (2022) Efficient robot motion planning using bidirectional-unidirectional RRT extend function. IEEE Trans Autom Sci Eng 19(3):1859\u20131868. https:\/\/doi.org\/10.1109\/TASE.2021.3130372","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"186_CR42","doi-asserted-by":"publisher","first-page":"1543643","DOI":"10.3389\/fncom.2025.1543643","volume":"19","author":"Z Xing","year":"2025","unstructured":"Xing Z, Meng Z, Zheng G, Ma G, Yang L, Guo X, Tan L, Jiang Y, Wu H (2025a) Intelligent rehabilitation in an aging population: empowering human-machine interaction for hand function rehabilitation through 3D deep learning and point cloud. Front Comput Neurosci 19:1543643. https:\/\/doi.org\/10.3389\/fncom.2025.1543643","journal-title":"Front Comput Neurosci"},{"key":"186_CR43","doi-asserted-by":"publisher","unstructured":"Xing Z, Ma G, Wang L, Yang L, Guo X, Chen S (2025b) Towards visual interaction: Hand segmentation by combining 3D graph deep learning and laser point cloud for intelligent rehabilitation. IEEE Internet Things J 3546874. https:\/\/doi.org\/10.1109\/JIOT.2025.3546874","DOI":"10.1109\/JIOT.2025.3546874"},{"key":"186_CR44","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-1-4471-1580-9_4","volume":"118","author":"T Yoshikawa","year":"1994","unstructured":"Yoshikawa T, Arimoto S (1994) A general formulation of under-actuated manipulator systems. IFIP Adv Inf Commun Technol 118:45\u201356. https:\/\/doi.org\/10.1007\/978-1-4471-1580-9_4","journal-title":"IFIP Adv Inf Commun Technol"},{"key":"186_CR45","doi-asserted-by":"publisher","unstructured":"Zhang Z, Wang D, Guo Q, He Y, Zhang B (2023) Collision-free trajectory planning of mobile robots by integrating deep reinforcement learning and model predictive control. In: Proceedings of the 2023 IEEE 19th International Conference on Automation Science and Engineering (CASE), Auckland, New Zealand, pp. 1\u20137. https:\/\/doi.org\/10.1109\/CASE56687.2023.10260515","DOI":"10.1109\/CASE56687.2023.10260515"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00186-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00186-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00186-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T12:45:18Z","timestamp":1758113118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00186-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,18]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00186-0","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,8,18]]},"assertion":[{"value":"2 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"165"}}