{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T04:03:40Z","timestamp":1784261020587,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T00:00:00Z","timestamp":1780790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T00:00:00Z","timestamp":1780790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100022424","name":"Ministry of Scientific and Technological Development, Higher Education and Information Society","doi-asserted-by":"publisher","award":["Grant number: 2018-35"],"award-info":[{"award-number":["Grant number: 2018-35"]}],"id":[{"id":"10.13039\/501100022424","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":[[2026,7]]},"DOI":"10.1007\/s11370-026-00718-1","type":"journal-article","created":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T09:10:16Z","timestamp":1780823416000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MI-RRT*: an improved RRT* algorithm for mobile robot path planning with multi-informed sampling and two path optimization strategies"],"prefix":"10.1007","volume":"19","author":[{"given":"Jiayao","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7653-782X","authenticated-orcid":false,"given":"Yanyun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Linmao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yating","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanzhao","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"718_CR1","doi-asserted-by":"publisher","first-page":"7244","DOI":"10.1109\/TIE.2020.2998740","volume":"68","author":"J Qi","year":"2021","unstructured":"Qi J, Yang H, Sun H (2021) MOD-RRT*: a sampling-based algorithm for robot path planning in dynamic environment. IEEE Trans Ind Electron 68:7244\u20137251. https:\/\/doi.org\/10.1109\/TIE.2020.2998740","journal-title":"IEEE Trans Ind Electron"},{"key":"718_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101540","volume":"58","author":"Z Durakl\u0131","year":"2022","unstructured":"Durakl\u0131 Z, Nabiyev V (2022) A new approach based on Bezier curves to solve path planning problems for mobile robots. J Comput Sci 58:101540. https:\/\/doi.org\/10.1016\/j.jocs.2021.101540","journal-title":"J Comput Sci"},{"key":"718_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2023.104570","volume":"171","author":"H Tu","year":"2024","unstructured":"Tu H, Deng Y, Li Q et al (2024) Improved RRT global path planning algorithm based on bridge test. Robot Auton Syst 171:104570. https:\/\/doi.org\/10.1016\/j.robot.2023.104570","journal-title":"Robot Auton Syst"},{"key":"718_CR4","doi-asserted-by":"publisher","unstructured":"Wang J, Bi C, Liu F, Shan J (2025) Dubins-RRT* motion planning algorithm considering curvature-constrained path optimization. Expert Systems with Applications 128390. https:\/\/doi.org\/10.1016\/j.eswa.2025.128390","DOI":"10.1016\/j.eswa.2025.128390"},{"key":"718_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.future.2023.02.004","volume":"143","author":"G Ma","year":"2023","unstructured":"Ma G, Duan Y, Li M et al (2023) A probability smoothing Bi-RRT path planning algorithm for indoor robot. Future Gener Comput Syst 143:349\u2013360. https:\/\/doi.org\/10.1016\/j.future.2023.02.004","journal-title":"Future Gener Comput Syst"},{"key":"718_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cyber 4:100\u2013107. https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans Syst Sci Cyber"},{"key":"718_CR7","doi-asserted-by":"crossref","unstructured":"Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings of the 1994 IEEE international conference on robotics and automation. IEEE Comput. Soc. Press, San Diego, CA, USA, pp 3310\u20133317","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"718_CR8","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 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":"718_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 Robot Res 5:90\u201398","journal-title":"Int J Robot Res"},{"key":"718_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","volume":"115","author":"M Nazarahari","year":"2019","unstructured":"Nazarahari M, Khanmirza E, Doostie S (2019) Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst Appl 115:106\u2013120. https:\/\/doi.org\/10.1016\/j.eswa.2018.08.008","journal-title":"Expert Syst Appl"},{"key":"718_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jobe.2024.111725","volume":"100","author":"H Sun","year":"2025","unstructured":"Sun H, Zhu K, Zhang W et al (2025) Emergency path planning based on improved ant colony algorithm. J Build Eng 100:111725. https:\/\/doi.org\/10.1016\/j.jobe.2024.111725","journal-title":"J Build Eng"},{"key":"718_CR12","doi-asserted-by":"publisher","first-page":"22547","DOI":"10.1109\/JIOT.2022.3182798","volume":"9","author":"Z Yu","year":"2022","unstructured":"Yu Z, Si Z, Li X et al (2022) A novel hybrid particle swarm Optimization algorithm for path planning of UAVs. IEEE Internet Things J 9:22547\u201322558. https:\/\/doi.org\/10.1109\/JIOT.2022.3182798","journal-title":"IEEE Internet Things J"},{"key":"718_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s10462-025-11129-6","volume":"58","author":"M Reda","year":"2025","unstructured":"Reda M, Onsy A, Haikal AY, Ghanbari A (2025) A novel reinforcement learning-based multi-operator differential evolution with cubic spline for the path planning problem. Artif Intell Rev 58:142. https:\/\/doi.org\/10.1007\/s10462-025-11129-6","journal-title":"Artif Intell Rev"},{"key":"718_CR14","doi-asserted-by":"crossref","unstructured":"Bohlin R, Kavraki LE (2000) Path planning using lazy PRM. In: Proceedings 2000 ICRA. millennium conference. IEEE international conference on robotics and automation. Symposia proceedings (Cat. No.00CH37065). IEEE, San Francisco, CA, USA, pp 521\u2013528 vol.1","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"718_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/1632698","volume":"2022","author":"X Ma","year":"2022","unstructured":"Ma X, Gong R, Tan Y et al (2022) Path planning of mobile robot based on improved PRM based on cubic spline. Wirel Commun Mob Comput 2022:1\u201312. https:\/\/doi.org\/10.1155\/2022\/1632698","journal-title":"Wirel Commun Mob Comput"},{"key":"718_CR16","unstructured":"LaValle S (1998) Rapidly-exploring random trees: a new tool for path planning. research report 9811"},{"key":"718_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11370-017-0236-7","volume":"11","author":"I Noreen","year":"2018","unstructured":"Noreen I, Khan A, Ryu H et al (2018) Optimal path planning in cluttered environment using RRT*-AB. Intell Serv Robot 11:41\u201352. https:\/\/doi.org\/10.1007\/s11370-017-0236-7","journal-title":"Intell Serv Robot"},{"key":"718_CR18","doi-asserted-by":"crossref","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"718_CR19","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 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":"718_CR20","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":"718_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2025.110393","volume":"148","author":"Z Sheng","year":"2025","unstructured":"Sheng Z, Song T, Song J et al (2025) Bidirectional rapidly exploring random tree path planning algorithm based on adaptive strategies and artificial potential fields. Eng Appl Artif Intell 148:110393. https:\/\/doi.org\/10.1016\/j.engappai.2025.110393","journal-title":"Eng Appl Artif Intell"},{"key":"718_CR22","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1109\/tie.2023.3269462","volume":"71","author":"J Dai","year":"2024","unstructured":"Dai J, Zhang Y, Deng H (2024) Novel potential guided bidirectional RRT* with direct connection strategy for path planning of redundant robot manipulators in Joint space. IEEE Trans Ind Electron 71:2737\u20132747. https:\/\/doi.org\/10.1109\/tie.2023.3269462","journal-title":"IEEE Trans Ind Electron"},{"key":"718_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2023.101944","volume":"67","author":"C-C Peng","year":"2023","unstructured":"Peng C-C, Yu W-C (2023) Design of constrained dynamic path planning algorithms in large-scale 3D point cloud maps for UAVs. J Comput Sci 67:101944. https:\/\/doi.org\/10.1016\/j.jocs.2023.101944","journal-title":"J Comput Sci"},{"key":"718_CR24","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s11370-025-00599-w","volume":"18","author":"Z Su","year":"2025","unstructured":"Su Z, Lv Q, Huang Z et al (2025) Ffc-rrt*: an adaptive hybrid sampling path planning algorithm with rapid initial solution convergence. Intell Serv Robot 18:499\u2013512. https:\/\/doi.org\/10.1007\/s11370-025-00599-w","journal-title":"Intell Serv Robot"},{"key":"718_CR25","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1109\/IROS.2014.6942976","volume-title":"2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems","author":"JD Gammell","year":"2014","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems. IEEE, Chicago, IL, USA, pp 2997\u20133004"},{"key":"718_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101753","volume":"35","author":"Y Liu","year":"2023","unstructured":"Liu Y, Li C, Yu H, Song C (2023) NT-ARS-RRT: a novel non-threshold adaptive region sampling RRT algorithm for path planning. J King Saud Univ Comput Inf Sci 35:101753. https:\/\/doi.org\/10.1016\/j.jksuci.2023.101753","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"718_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124121","volume":"252","author":"T Huang","year":"2024","unstructured":"Huang T, Fan K, Sun W (2024) Density gradient-RRT: an improved rapidly exploring random tree algorithm for UAV path planning. Expert Syst Appl 252:124121. https:\/\/doi.org\/10.1016\/j.eswa.2024.124121","journal-title":"Expert Syst Appl"},{"key":"718_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123571","volume":"249","author":"Z Feng","year":"2024","unstructured":"Feng Z, Zhou L, Qi J, Hong S (2024) DBVS-APF-RRT*: a global path planning algorithm with ultra-high speed generation of initial paths and high optimal path quality. Expert Syst Appl 249:123571. https:\/\/doi.org\/10.1016\/j.eswa.2024.123571","journal-title":"Expert Syst Appl"},{"key":"718_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2023.114595","volume":"279","author":"Q Gu","year":"2023","unstructured":"Gu Q, Zhen R, Liu J, Li C (2023) An improved RRT algorithm based on prior AIS information and DP compression for ship path planning. Ocean Eng 279:114595. https:\/\/doi.org\/10.1016\/j.oceaneng.2023.114595","journal-title":"Ocean Eng"},{"key":"718_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125206","volume":"258","author":"S Ganesan","year":"2024","unstructured":"Ganesan S, Ramalingam B, Mohan RE (2024) A hybrid sampling-based RRT* path planning algorithm for autonomous mobile robot navigation. Expert Syst Appl 258:125206. https:\/\/doi.org\/10.1016\/j.eswa.2024.125206","journal-title":"Expert Syst Appl"},{"key":"718_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/tie.2022.3177801","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. https:\/\/doi.org\/10.1109\/tie.2022.3177801","journal-title":"IEEE Trans Ind Electron"},{"key":"718_CR32","doi-asserted-by":"publisher","first-page":"8128","DOI":"10.1109\/LRA.2023.3325716","volume":"8","author":"H Ji","year":"2023","unstructured":"Ji H, Xie H, Wang C, Yang H (2023) E-RRT*: path planning for hyper-redundant manipulators. IEEE Robot Autom Lett 8:8128\u20138135. https:\/\/doi.org\/10.1109\/LRA.2023.3325716","journal-title":"IEEE Robot Autom Lett"},{"key":"718_CR33","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1109\/TASE.2020.2976560","volume":"17","author":"J Wang","year":"2020","unstructured":"Wang J, Chi W, Li C et al (2020) Neural RRT*: learning-based optimal path planning. IEEE Trans Automat Sci Eng 17:1748\u20131758. https:\/\/doi.org\/10.1109\/TASE.2020.2976560","journal-title":"IEEE Trans Automat Sci Eng"},{"key":"718_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120403","volume":"228","author":"Y Liang","year":"2023","unstructured":"Liang Y, Zhao H (2023) CCPF-RRT*: an improved path planning algorithm with consideration of congestion. Expert Syst Appl 228:120403. https:\/\/doi.org\/10.1016\/j.eswa.2023.120403","journal-title":"Expert Syst Appl"},{"key":"718_CR35","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s11370-024-00541-6","volume":"17","author":"Y Lin","year":"2024","unstructured":"Lin Y, Zhang L (2024) An improved Quick Informed-RRT* algorithm based on hybrid bidirectional search and adaptive adjustment strategies. Intel Serv Robotics 17:847\u2013870. https:\/\/doi.org\/10.1007\/s11370-024-00541-6","journal-title":"Intel Serv Robotics"},{"key":"718_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.compag.2018.10.031","volume":"156","author":"X Cao","year":"2019","unstructured":"Cao X, Zou X, Jia C et al (2019) RRT-based path planning for an intelligent litchi-picking manipulator. Comput Electron Agric 156:105\u2013118. https:\/\/doi.org\/10.1016\/j.compag.2018.10.031","journal-title":"Comput Electron Agric"},{"key":"718_CR37","doi-asserted-by":"publisher","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":"718_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2024.102152","volume":"36","author":"L Zhang","year":"2024","unstructured":"Zhang L, Yin H, Li A et al (2024) RSA-RRT: a path planning algorithm based on restricted sampling area. J King Saud Univ Comput Inf Sci 36:102152. https:\/\/doi.org\/10.1016\/j.jksuci.2024.102152","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"718_CR39","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1109\/AUTEEE56487.2022.9994543","volume-title":"2022 IEEE 5th International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","author":"H Zhao","year":"2022","unstructured":"Zhao H (2022) Path Planning of Mobile Robots Based on Improved Bi-RRT Algorithm. 2022 IEEE 5th International Conference on Automation, Electronics and Electrical Engineering (AUTEEE). IEEE, Shenyang, China, pp 1043\u20131050"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-026-00718-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-026-00718-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-026-00718-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T03:12:02Z","timestamp":1784257922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-026-00718-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,7]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["718"],"URL":"https:\/\/doi.org\/10.1007\/s11370-026-00718-1","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,7]]},"assertion":[{"value":"20 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"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":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"68"}}