{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T07:34:14Z","timestamp":1766129654489,"version":"3.48.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJZD-K202201104"],"award-info":[{"award-number":["KJZD-K202201104"]}],"id":[{"id":"10.13039\/501100007957","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,1]]},"DOI":"10.1007\/s11370-025-00658-2","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T07:30:05Z","timestamp":1766129405000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A path planning algorithm for mobile robots combining bidirectional scanning and sampling with virtual obstacles"],"prefix":"10.1007","volume":"19","author":[{"given":"Yi","family":"Wang","sequence":"first","affiliation":[]},{"given":"Junyao","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weimeng","family":"Song","sequence":"additional","affiliation":[]},{"given":"Zihan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Hongmei","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yufei","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"issue":"2","key":"658_CR1","doi-asserted-by":"publisher","first-page":"172988141983959","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 Rob Syst 16(2):1729881419839596","journal-title":"Int J Adv Rob Syst"},{"issue":"9","key":"658_CR2","doi-asserted-by":"publisher","first-page":"9613","DOI":"10.1109\/TVT.2020.3004163","volume":"69","author":"H-W Chae","year":"2020","unstructured":"Chae H-W, Choi J-H, Song J-B (2020) Robust and autonomous stereo visual-inertial navigation for non-holonomic mobile robots. IEEE Trans Veh Technol 69(9):9613\u20139623","journal-title":"IEEE Trans Veh Technol"},{"issue":"3","key":"658_CR3","first-page":"14","volume":"19","author":"MA Ali","year":"2020","unstructured":"Ali MA, Shanono IH et al (2020) Path planning methods for mobile robots: a systematic and bibliometric review. ELEKTRIKA-J Electr Eng 19(3):14\u201334","journal-title":"ELEKTRIKA-J Electr Eng"},{"issue":"5","key":"658_CR4","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1109\/TRO.2013.2264865","volume":"29","author":"M Kazemi","year":"2013","unstructured":"Kazemi M, Gupta KK, Mehrandezh M (2013) Randomized kinodynamic planning for robust visual servoing. IEEE Trans Rob 29(5):1197\u20131211","journal-title":"IEEE Trans Rob"},{"key":"658_CR5","doi-asserted-by":"crossref","unstructured":"Goretkin G, Perez A, Platt R, Konidaris G (2013) Optimal sampling-based planning for linear-quadratic kinodynamic systems. In: 2013 IEEE international conference on robotics and automation, IEEE, pp 2429\u20132436","DOI":"10.1109\/ICRA.2013.6630907"},{"issue":"3","key":"658_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/321765.321768","volume":"20","author":"DB Johnson","year":"1973","unstructured":"Johnson DB (1973) A note on dijkstra\u2019s shortest path algorithm. J ACM 20(3):385\u2013388. https:\/\/doi.org\/10.1145\/321765.321768","journal-title":"J ACM"},{"key":"658_CR7","doi-asserted-by":"publisher","first-page":"19761","DOI":"10.1109\/ACCESS.2021.3053169","volume":"9","author":"D-D Zhu","year":"2021","unstructured":"Zhu D-D, Sun J-Q (2021) A new algorithm based on dijkstra for vehicle path planning considering intersection attribute. IEEE Access 9:19761\u201319775","journal-title":"IEEE Access"},{"key":"658_CR8","first-page":"5939","volume":"72","author":"S Alshammrei","year":"2022","unstructured":"Alshammrei S, Boubaker S, Kolsi L (2022) Improved dijkstra algorithm for mobile robot path planning and obstacle avoidance. Comput Mater Contin 72:5939\u20135954","journal-title":"Comput Mater Contin"},{"key":"658_CR9","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","journal-title":"J Comput Sci"},{"issue":"2","key":"658_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 Cybernet 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybernet"},{"issue":"2\u20133","key":"658_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1177\/0954407020959741","volume":"235","author":"H Min","year":"2021","unstructured":"Min H, Xiong X, Wang P, Yu Y (2021) Autonomous driving path planning algorithm based on improved a* algorithm in unstructured environment. Proc Inst Mech Eng Part D J Automob Eng 235(2\u20133):513\u2013526","journal-title":"Proc Inst Mech Eng Part D J Automob Eng"},{"key":"658_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108123","volume":"168","author":"C Li","year":"2022","unstructured":"Li C, Huang X, Ding J, Song K, Lu S (2022) Global path planning based on a bidirectional alternating search a* algorithm for mobile robots. Comput Ind Eng 168:108123","journal-title":"Comput Ind Eng"},{"key":"658_CR13","doi-asserted-by":"publisher","unstructured":"Lin M, Yuan K, Shi C, Wang Y (2017) Path planning of mobile robot based on improved a* algorithm. In: 2017 29th Chinese control and decision conference (CCDC), pp 3570\u20133576. https:\/\/doi.org\/10.1109\/CCDC.2017.7979125","DOI":"10.1109\/CCDC.2017.7979125"},{"issue":"5","key":"658_CR14","doi-asserted-by":"publisher","first-page":"172988142110427","DOI":"10.1177\/17298814211042730","volume":"18","author":"J Zhang","year":"2021","unstructured":"Zhang J, Wu J, Shen X, Li Y (2021) Autonomous land vehicle path planning algorithm based on improved heuristic function of a-star. Int J Adv Rob Syst 18(5):17298814211042730","journal-title":"Int J Adv Rob Syst"},{"issue":"03","key":"658_CR15","first-page":"346","volume":"42","author":"H Wang","year":"2020","unstructured":"Wang H, Yin P, Zheng W, Wang H, Zuo J (2020) Mobile robot path planning based on improved a* algorithm and dynamic window method. Robot 42(03):346\u2013353","journal-title":"Robot"},{"key":"658_CR16","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, pp 3310\u20133317","DOI":"10.1109\/ROBOT.1994.351061"},{"issue":"3","key":"658_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11370-022-00416-8","volume":"15","author":"S-N Heo","year":"2022","unstructured":"Heo S-N, Chen J, Liao Y-C, Lee H-h (2022) Auto-splitting d* lite path planning for large disaster area. Intell Serv Robot 15(3):289\u2013306","journal-title":"Intell Serv Robot"},{"key":"658_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2022.112873","volume":"266","author":"J Yu","year":"2022","unstructured":"Yu J, Yang M, Zhao Z, Wang X, Bai Y, Wu J, Xu J (2022) Path planning of unmanned surface vessel in an unknown environment based on improved d* lite algorithm. Ocean Eng 266:112873","journal-title":"Ocean Eng"},{"issue":"3","key":"658_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0373463322000091","volume":"75","author":"B Sun","year":"2022","unstructured":"Sun B, Zhang W, Li S, Zhu X (2022) Energy optimised d* auv path planning with obstacle avoidance and ocean current environment. J Navig 75(3):685\u2013703","journal-title":"J Navig"},{"key":"658_CR20","doi-asserted-by":"crossref","unstructured":"Harabor D, Grastien A (2011) Online graph pruning for pathfinding on grid maps 25(1):1114\u20131119","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"658_CR21","doi-asserted-by":"crossref","unstructured":"Harabor D, Grastien A (2014) Improving jump point search 24:128\u2013135","DOI":"10.1609\/icaps.v24i1.13633"},{"key":"658_CR22","doi-asserted-by":"publisher","first-page":"19632","DOI":"10.1109\/ACCESS.2021.3052865","volume":"9","author":"L Liu","year":"2021","unstructured":"Liu L, Yao J, He D, Chen J, Huang J, Xu H, Wang B, Guo J (2021) Global dynamic path planning fusion algorithm combining jump-a* algorithm and dynamic window approach. IEEE Access 9:19632\u201319638","journal-title":"IEEE Access"},{"key":"658_CR23","doi-asserted-by":"crossref","unstructured":"LaValle SM, Kuffner JJ (2001) Rapidly-exploring random trees: progress and prospects. Algorithmic and computational robotics, 303\u2013307","DOI":"10.1201\/9781439864135-43"},{"key":"658_CR24","unstructured":"Kuffner J, RRT-Connect SL (2000) An efficient approach to single-query path planning. In: IEEE international conference on robotics and automation. San Francisco, pp 473\u2013479"},{"issue":"7","key":"658_CR25","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","journal-title":"Int J Robot Res"},{"key":"658_CR26","unstructured":"Jordan M, Perez A (2013) Optimal bidirectional rapidly-exploring random trees"},{"key":"658_CR27","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: 2012 IEEE international conference on mechatronics and automation, pp 1651\u20131656. https:\/\/doi.org\/10.1109\/ICMA.2012.6284384","DOI":"10.1109\/ICMA.2012.6284384"},{"key":"658_CR28","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, IEEE, pp 2997\u20133004","DOI":"10.1109\/IROS.2014.6942976"},{"key":"658_CR29","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), IEEE, pp 3067\u20133074","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"658_CR30","doi-asserted-by":"crossref","unstructured":"Strub MP, Gammell JD (2015) Adaptively informed trees (ait*): fast asymptotically optimal path planning through adaptive heuristics. In: 2020 IEEE international conference on robotics and automation (ICRA), IEEE, pp 3191\u20133198 (2020)","DOI":"10.1109\/ICRA40945.2020.9197338"},{"issue":"2","key":"658_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/JAS.2021.1004252","volume":"9","author":"B Li","year":"2021","unstructured":"Li B, Chen B (2021) An adaptive rapidly-exploring random tree. IEEE\/CAA J Automat Sinica 9(2):283\u2013294","journal-title":"IEEE\/CAA J Automat Sinica"},{"issue":"2","key":"658_CR32","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, Jang W-J, Jung J-W (2021) Improved rrt-connect algorithm based on triangular inequality for robot path planning. Sensors 21(2):333","journal-title":"Sensors"},{"key":"658_CR33","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"},{"key":"658_CR34","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":"658_CR35","unstructured":"Colorni A, Dorigo M, Maniezzo V et al (1991) Distributed optimization by ant colonies. Proceedings of the First European Conference on Artificial Life 142:134\u2013142 (Paris, France)"},{"issue":"2","key":"658_CR36","doi-asserted-by":"publisher","first-page":"167","DOI":"10.14429\/dsj.69.12509","volume":"69","author":"V Sangeetha","year":"2019","unstructured":"Sangeetha V, Ravichandran K, Shekhar S, Tapas AM (2019) An intelligent gain-based ant colony optimisation method for path planning of unmanned ground vehicles. Def Sci J 69(2):167\u2013172","journal-title":"Def Sci J"},{"key":"658_CR37","unstructured":"Bremermann HJ (1958) The Evolution of Intelligence: The Nervous System as a Model of Its Environment. University of Washington, Department of Mathematics, ???"},{"key":"658_CR38","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.neucom.2013.04.020","volume":"120","author":"H Qu","year":"2013","unstructured":"Qu H, Xing K, Alexander T (2013) An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots. Neurocomputing 120:509\u2013517","journal-title":"Neurocomputing"},{"key":"658_CR39","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","journal-title":"Expert Syst Appl"},{"key":"658_CR40","doi-asserted-by":"crossref","unstructured":"Chan H, Tam K, Leung N (1993) A neural network approach for solving the path planning problem. In: 1993 IEEE international symposium on circuits and systems (ISCAS), IEEE, pp 2454\u20132457","DOI":"10.1109\/ISCAS.1993.394261"},{"issue":"2","key":"658_CR41","first-page":"264","volume":"24","author":"L Liu","year":"2007","unstructured":"Liu L, Wang Y-N, Kuang F, Zhang H (2007) Path planning of mobile robot based on neural network and genetic algorithm. Jisuanji Yingyong Yanjiu\/ Appl Res Comput 24(2):264\u2013265","journal-title":"Jisuanji Yingyong Yanjiu\/ Appl Res Comput"},{"issue":"9","key":"658_CR42","first-page":"246","volume":"7","author":"Y Huang","year":"2012","unstructured":"Huang Y (2012) Intelligent technique for robot path planning using artificial neural network and adaptive ant colony optimization. J Converg Inf Technol 7(9):246\u2013252","journal-title":"J Converg Inf Technol"},{"key":"658_CR43","doi-asserted-by":"crossref","unstructured":"Pandey KK, Mohanty PK, Parhi DR (2014) Real time navigation strategies for webots using fuzzy controller. In: 2014 IEEE 8th international conference on intelligent systems and control (ISCO), IEEE, pp 10\u201316","DOI":"10.1109\/ISCO.2014.7103910"},{"issue":"6","key":"658_CR44","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.dt.2018.03.008","volume":"14","author":"AK Rath","year":"2018","unstructured":"Rath AK, Parhi DR, Das HC, Muni MK, Kumar PB (2018) Analysis and use of fuzzy intelligent technique for navigation of humanoid robot in obstacle prone zone. Defence Technol 14(6):677\u2013682","journal-title":"Defence Technol"},{"key":"658_CR45","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.asoc.2018.04.023","volume":"68","author":"PB Kumar","year":"2018","unstructured":"Kumar PB, Sahu C, Parhi DR (2018) A hybridized regression-adaptive ant colony optimization approach for navigation of humanoids in a cluttered environment. Appl Soft Comput 68:565\u2013585","journal-title":"Appl Soft Comput"},{"issue":"12","key":"658_CR46","doi-asserted-by":"publisher","first-page":"6387","DOI":"10.1007\/s12652-020-02535-5","volume":"11","author":"PK Mohanty","year":"2020","unstructured":"Mohanty PK (2020) An intelligent navigational strategy for mobile robots in uncertain environments using smart cuckoo search algorithm. J Ambient Intell Humaniz Comput 11(12):6387\u20136402","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"658_CR47","doi-asserted-by":"crossref","unstructured":"Mohanty PK, Parhi DR (2014) A new efficient optimal path planner for mobile robot based on invasive weed optimization algorithm. Front Mech Eng 9:317\u2013330","DOI":"10.1007\/s11465-014-0304-z"},{"key":"658_CR48","doi-asserted-by":"crossref","unstructured":"Biswal P, Mohanty PK (2021) Modeling and effective foot force distribution for the legs of a quadruped robot. Robotica 39(8):1504\u20131517","DOI":"10.1017\/S0263574720001307"},{"key":"658_CR49","doi-asserted-by":"crossref","unstructured":"Shan E, Dai B, Song J, Sun Z (2009) A dynamic rrt path planning algorithm based on b-spline. In: 2009 second international symposium on computational intelligence and design, vol 2. IEEE, pp 25\u201329","DOI":"10.1109\/ISCID.2009.155"},{"key":"658_CR50","unstructured":"R\u00f6smann C, Feiten W, W\u00f6sch T, Hoffmann F, Bertram T (2012) Trajectory modification considering dynamic constraints of autonomous robots. In: ROBOTIK 2012; 7th German conference on robotics, pp 1\u20136. VDE"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00658-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00658-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00658-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T07:30:09Z","timestamp":1766129409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00658-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["658"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00658-2","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"8 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"11"}}