{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:10:24Z","timestamp":1772043024136,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai Municipality","doi-asserted-by":"publisher","award":["21ZR1425800"],"award-info":[{"award-number":["21ZR1425800"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52172371"],"award-info":[{"award-number":["52172371"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00500-025-10934-z","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:51:55Z","timestamp":1765533115000},"page":"303-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Research on an efficient path planning algorithm based on adaptive sampling and dynamically constructed local informed sets"],"prefix":"10.1007","volume":"30","author":[{"given":"Guo","family":"Gui","sequence":"first","affiliation":[]},{"given":"Pingqing","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Xipei","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"10934_CR1","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), vol. 1, pp. 521\u2013528. IEEE","DOI":"10.1109\/ROBOT.2000.844107"},{"issue":"2","key":"10934_CR2","first-page":"177","volume":"15","author":"Y Chen","year":"2022","unstructured":"Chen Y, Fu Y, Zhang B, Fu W, Shen C (2022) Path planning of the fruit tree pruning manipulator based on improved RRT-connect algorithm. Int J Agric Biol Eng 15(2):177\u2013188","journal-title":"Int J Agric Biol Eng"},{"key":"10934_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108246","volume":"133","author":"X Cui","year":"2024","unstructured":"Cui X, Wang C, Xiong Y, Mei L, Wu S (2024) More quickly-rrt*: improved quick rapidly-exploring random tree star algorithm based on optimized sampling point with better initial solution and convergence rate. Eng Appl Artif Intell 133:108246","journal-title":"Eng Appl Artif Intell"},{"key":"10934_CR4","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2024.3355061","author":"P Du","year":"2024","unstructured":"Du P, Shi Y, Cao H, Garg S, Alrashoud M, Shukla PK (2024) Ai-enabled trajectory optimization of logistics UAVs with wind impacts in smart cities. IEEE Trans Consum Electron. https:\/\/doi.org\/10.1109\/TCE.2024.3355061","journal-title":"IEEE Trans Consum Electron"},{"issue":"4","key":"10934_CR5","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1109\/TRO.2018.2830331","volume":"34","author":"JD Gammell","year":"2018","unstructured":"Gammell JD, Barfoot TD, Srinivasa SS (2018) Informed sampling for asymptotically optimal path planning. IEEE Trans Robot 34(4):966\u2013984","journal-title":"IEEE Trans Robot"},{"issue":"3","key":"10934_CR6","doi-asserted-by":"publisher","DOI":"10.3390\/drones7030169","volume":"7","author":"G Gugan","year":"2023","unstructured":"Gugan G, Haque A (2023) Path planning for autonomous drones: challenges and future directions. Drones 7(3):169","journal-title":"Drones"},{"key":"10934_CR7","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. IEEE","DOI":"10.1109\/IROS.2014.6942976"},{"key":"10934_CR8","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","journal-title":"Expert Syst Appl"},{"key":"10934_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2024.118738","volume":"311","author":"H Heng","year":"2024","unstructured":"Heng H, Ghazali MHM, Rahiman W (2024) Exploring the application of ant colony optimization in path planning for unmanned surface vehicles. Ocean Eng 311:118738","journal-title":"Ocean Eng"},{"key":"10934_CR10","unstructured":"Hu Y, Yang SX, Xu L-Z, Meng M-H (2004) A knowledge based genetic algorithm for path planning in unstructured mobile robot environments. In: 2004 IEEE International Conference on Robotics and Biomimetics, pp. 767\u2013772. IEEE"},{"key":"10934_CR11","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","journal-title":"Expert Syst Appl"},{"issue":"7","key":"10934_CR12","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1177\/0278364915577958","volume":"34","author":"L Janson","year":"2015","unstructured":"Janson L, Schmerling E, Clark A, Pavone M (2015) Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions. Int J Robot Res 34(7):883\u2013921","journal-title":"Int J Robot Res"},{"key":"10934_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106581","volume":"96","author":"AK Kashyap","year":"2020","unstructured":"Kashyap AK, Parhi DR, Muni MK, Pandey KK (2020) A hybrid technique for path planning of humanoid robot NAO in static and dynamic terrains. Appl Soft Comput 96:106581","journal-title":"Appl Soft Comput"},{"key":"10934_CR14","doi-asserted-by":"crossref","unstructured":"Karaman S, Walter MR, Perez A, Frazzoli E, Teller S (2011) Anytime motion planning using the rrt. In: 2011 IEEE International Conference on Robotics and Automation, pp. 1478\u20131483. IEEE","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"10934_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s11804-024-00433-2","author":"Z Liu","year":"2024","unstructured":"Liu Z, Cui J, Meng F, Xie H, Dan Y, Li B (2024) Research on intelligent ship route planning based on the adaptive step size informed-rrt* algorithm. J Mar Sci Appl. https:\/\/doi.org\/10.1007\/s11804-024-00433-2","journal-title":"J Mar Sci Appl"},{"key":"10934_CR16","doi-asserted-by":"crossref","unstructured":"LaValle SM, Kuffner JJ (2001) Rapidly-exploring random trees: Progress and prospects: Steven m. lavalle, iowa state university, a james j. kuffner, jr., university of tokyo, tokyo, japan. Algorithmic and computational robotics, 303\u2013307","DOI":"10.1201\/9781439864135-43"},{"issue":"3","key":"10934_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-024-02144-w","volume":"110","author":"H Li","year":"2024","unstructured":"Li H, Kang Y, Han H (2024) Dynamic informed bias rrt*-connect: improving heuristic guidance by dynamic informed bias using hybrid dual trees search. J Intell Robot Syst 110(3):106","journal-title":"J Intell Robot Syst"},{"key":"10934_CR18","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","journal-title":"Expert Syst Appl"},{"key":"10934_CR19","doi-asserted-by":"crossref","unstructured":"Lin Y, Zhang L (2024) An improved quick informed-rrt* algorithm based on hybrid bidirectional search and adaptive adjustment strategies. Int Serv Robot 1\u201324","DOI":"10.1007\/s11370-024-00541-6"},{"issue":"3","key":"10934_CR20","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00354-022-00179-x","volume":"40","author":"X Liu","year":"2022","unstructured":"Liu X, Zhang M, Fiumara G, De Meo P (2022) Complex network hierarchical sampling method combining node neighborhood clustering coefficient with random walk. New Gener Comput 40(3):765\u2013807","journal-title":"New Gener Comput"},{"key":"10934_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2024.102490","volume":"67","author":"X Liu","year":"2024","unstructured":"Liu X, Zhang K, Zhang X, Fiumara G, De Meo P (2024) A hybrid improved compressed particle swarm optimization wsn node location algorithm. Phys Commun 67:102490","journal-title":"Phys Commun"},{"key":"10934_CR22","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2024.1359887","volume":"11","author":"C Mwitta","year":"2024","unstructured":"Mwitta C, Rains GC (2024) The integration of GPS and visual navigation for autonomous navigation of an ackerman steering mobile robot in cotton fields. Front Robot AI 11:1359887","journal-title":"Front Robot AI"},{"key":"10934_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107376","volume":"107","author":"MD Phung","year":"2021","unstructured":"Phung MD, Ha QP (2021) Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization. Appl Soft Comput 107:107376","journal-title":"Appl Soft Comput"},{"key":"10934_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107796","volume":"112","author":"YV Pehlivanoglu","year":"2021","unstructured":"Pehlivanoglu YV, Pehlivanoglu P (2021) An enhanced genetic algorithm for path planning of autonomous uav in target coverage problems. Appl Soft Comput 112:107796","journal-title":"Appl Soft Comput"},{"key":"10934_CR25","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","journal-title":"Auton Robot"},{"key":"10934_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2024.104630","volume":"174","author":"M Reda","year":"2024","unstructured":"Reda M, Onsy A, Haikal AY, Ghanbari A (2024) Path planning algorithms in the autonomous driving system: a comprehensive review. Robot Auton Syst 174:104630","journal-title":"Robot Auton Syst"},{"issue":"3","key":"10934_CR27","first-page":"832","volume":"102","author":"RN Sarbini","year":"2024","unstructured":"Sarbini RN, Ahmad I, Bura RO, Simbolon L (2024) Development of pathfinding using A-star and D-star lite algorithms in video game. J Theor Appl Phys Inf Technol 102(3):832\u2013840","journal-title":"J Theor Appl Phys Inf Technol"},{"key":"10934_CR28","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.7717\/peerj-cs.1296","volume":"9","author":"M Shi","year":"2023","unstructured":"Shi M, Liang F, Chen Y, He Y (2023) A local cost simulation-based algorithm to solve distributed constraint optimization problems. PeerJ Computer Science 9:1296","journal-title":"PeerJ Computer Science"},{"key":"10934_CR29","doi-asserted-by":"crossref","unstructured":"Scalise R, Mandalika A, Hou B, Choudhury S, Srinivasa SS (2023) Guild: Guided incremental local densification for accelerated sampling-based motion planning. In: 2023 IEEE International Conference on Robotics and Automation (ICRA), pp. 10212\u201310218. IEEE","DOI":"10.1109\/ICRA48891.2023.10161028"},{"issue":"4","key":"10934_CR30","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, Wang C, Meng MQ-H (2020) Neural rrt*: Learning-based optimal path planning. IEEE Trans Autom Sci Eng 17(4):1748\u20131758","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10934_CR31","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2022.821991","volume":"16","author":"C Wang","year":"2022","unstructured":"Wang C, Cheng C, Yang D, Pan G, Zhang F (2022) Path planning in localization uncertaining environment based on dijkstra method. Front Neurorobot 16:821991","journal-title":"Front Neurorobot"},{"issue":"10","key":"10934_CR32","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/tee.23898","volume":"18","author":"B Wang","year":"2023","unstructured":"Wang B, Ju D, Xu F, Feng C (2023) Bi-rrt*: an improved bidirectional rrt* path planner for robot in two-dimensional space. IEEJ Trans Electr Electron Eng 18(10):1639\u20131652","journal-title":"IEEJ Trans Electr Electron Eng"},{"key":"10934_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2024.102239","volume":"77","author":"J Wang","year":"2024","unstructured":"Wang J, Li J, Song Y, Tuo Y, Liu C (2024) Fc-rrt*: a modified rrt* with rapid convergence in complex environments. J Comput Sci 77:102239","journal-title":"J Comput Sci"},{"key":"10934_CR34","doi-asserted-by":"crossref","unstructured":"Xing S, Fan P, Ma X, Wang Y (2024) Research on robot path planning by integrating state-based decision-making a* algorithm and inertial dynamic window approach. Int Serv Robot, 1\u201314","DOI":"10.1007\/s11370-024-00547-0"},{"key":"10934_CR35","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","journal-title":"Eng Appl Artif Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10934-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10934-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10934-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:55:23Z","timestamp":1769788523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10934-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10934"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10934-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"20 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 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 declared that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article is a completely original work of its authors; it has not been published before and will not be sent to other publications until the journal\u2019s editorial board decides not to accept it for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}