{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:04:17Z","timestamp":1757613857234,"version":"3.44.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T00:00:00Z","timestamp":1754956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T00:00:00Z","timestamp":1754956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11370-025-00631-z","type":"journal-article","created":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T05:39:19Z","timestamp":1754977159000},"page":"1033-1047","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An improved global path planning algorithm for fast obstacle bypassing using boundary point sequences"],"prefix":"10.1007","volume":"18","author":[{"given":"Songming","family":"Jiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5482-1135","authenticated-orcid":false,"given":"Zhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zemin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenzhen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,12]]},"reference":[{"issue":"12","key":"631_CR1","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.3390\/electronics13122239","volume":"13","author":"N AbuJabal","year":"2024","unstructured":"AbuJabal N, Rabie T, Baziyad M et al (2024) Path planning techniques for real-time multi-robot systems: A systematic review. Electronics 13(12):2239\u20132239","journal-title":"Electronics"},{"key":"631_CR2","doi-asserted-by":"publisher","first-page":"6185","DOI":"10.1109\/ACCESS.2022.3233786","volume":"11","author":"E Alhenawi","year":"2023","unstructured":"Alhenawi E, Khurma RA, Sharieh AA et al (2023) Parallel ant colony optimization algorithm for finding the shortest path for mountain climbing. IEEE Access 11:6185\u20136196","journal-title":"IEEE Access"},{"key":"631_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s11633-013-0750-9","volume":"10","author":"F Yan","year":"2013","unstructured":"Yan F, Liu YS, Xiao JZ (2013) Path planning in complex 3d environments using a probabilistic roadmap method. Int J Autom Comput 10:525\u2013533","journal-title":"Int J Autom Comput"},{"key":"631_CR4","doi-asserted-by":"crossref","unstructured":"Hu X, Zhou J, Ai W (2021) A hybrid path planning algorithm based on floyd and a* theory. In: 2021 IEEE 5th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), IEEE, pp 2055\u20132060","DOI":"10.1109\/IAEAC50856.2021.9391073"},{"key":"631_CR5","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 et al (2024) An adaptive bidirectional quick optimal rapidly-exploring random tree algorithm for path planning. Eng Appl Artif Intell 135:108776","journal-title":"Eng Appl Artif Intell"},{"key":"631_CR6","first-page":"489","volume-title":"2018 5th International Conference on Electrical Engineering","author":"L Husniah","year":"2018","unstructured":"Husniah L, Mahendra R, Kholimi AS et al (2018) Comparison between a* and obstacle tracing pathfinding in gridless isometric game. 2018 5th International Conference on Electrical Engineering. IEEE, Computer Science and Informatics (EECSI), pp 489\u2013494"},{"key":"631_CR7","doi-asserted-by":"publisher","first-page":"111459","DOI":"10.1016\/j.knosys.2024.111459","volume":"288","author":"J Cui","year":"2024","unstructured":"Cui J, Wu L, Huang X (2024) Multi-strategy adaptable ant colony optimization algorithm and its application in robot path planning. Knowl-Based Syst 288:111459","journal-title":"Knowl-Based Syst"},{"key":"631_CR8","doi-asserted-by":"crossref","unstructured":"Katona K, Neamah AH, Korondi P (2024) Obstacle avoidance and path planning methods for autonomous navigation of mobile robot. Sensors 24(11)","DOI":"10.3390\/s24113573"},{"issue":"3","key":"631_CR9","first-page":"548","volume":"50","author":"L Jiang","year":"2022","unstructured":"Jiang L, Fang DJ, Zhou HW, Huang HB (2022) Improved global path planning algorithm based on ray model. Acta Electron Sin 50(3):548\u2013556","journal-title":"Acta Electron Sin"},{"key":"631_CR10","doi-asserted-by":"crossref","unstructured":"Liu J, Xi B, Chen S, et\u00a0al (2022) The path planning study of autonomous patrol robot based on modified astar algorithm and genetic algorithm. In: 2022 34th Chinese Control and Decision Conference (CCDC), IEEE, pp 4713\u20134718","DOI":"10.1109\/CCDC55256.2022.10033990"},{"key":"631_CR11","doi-asserted-by":"crossref","unstructured":"Lumelsky VJ, Stepanov AA (1987) Dynamic path planning for a mobile automaton with limited information on the environment. Algorithmica 2","DOI":"10.1007\/BF01840369"},{"issue":"8","key":"631_CR12","doi-asserted-by":"publisher","first-page":"348","DOI":"10.3390\/drones8080348","volume":"8","author":"ZM Chen","year":"2024","unstructured":"Chen ZM, Yan JJ, Huang R, Gao YS, Peng XY, Yuan WJ (2024) Path planning for autonomous underwater vehicles (auvs) considering the influences and constraints of ocean currents. Drones 8(8):348\u2013348","journal-title":"Drones"},{"key":"631_CR13","doi-asserted-by":"publisher","first-page":"33522","DOI":"10.1109\/ACCESS.2021.3061288","volume":"9","author":"QY Tao","year":"2021","unstructured":"Tao QY, Sang HY, Guo HW, Wang P (2021) Improved particle swarm optimization algorithm for agv path planning. IEEE Access 9:33522\u201333531","journal-title":"IEEE Access"},{"key":"631_CR14","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s10846-016-0362-z","volume":"84","author":"E Tsardoulias","year":"2016","unstructured":"Tsardoulias E, Iliakopoulou A, Kargakos A et al (2016) A review of global path planning methods for occupancy grid maps regardless of obstacle density. J Intell Robot Syst 84:829\u2013858","journal-title":"J Intell Robot Syst"},{"key":"631_CR15","doi-asserted-by":"crossref","unstructured":"Verma D, Messon D, Rastogi M, et\u00a0al (2021) Comparative study of various approaches of dijkstra algorithm. In: 2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS), IEEE, pp 328\u2013336","DOI":"10.1109\/ICCCIS51004.2021.9397200"},{"key":"631_CR16","unstructured":"Li GX, Lv C, Peng RC, Dong J (2021) A rapid path planning algorithm based on the bilateral convex-hull expanding models. Geomatics & Information Science of Wuhan University 46(1)"},{"key":"631_CR17","unstructured":"Lin HX, Xaing D, Ouyang J, Lan XD (2021) Review of path planning algorithms for mobile robots. Journal of Computer Engineering & Applications 57(18)"},{"issue":"3","key":"631_CR18","first-page":"782","volume":"36","author":"X Yu","year":"2024","unstructured":"Yu X, Jiang C, Duan SR, Deng QR (2024) Improving path planning with a* algorithm and apf algorithm. J Syst Simul 36(3):782","journal-title":"J Syst Simul"},{"key":"631_CR19","unstructured":"Zou SX, Wang P, Han X (2019) Improved path planning algorithm based on PRM. Modular Mach Tool Automatic Manuf Tech 1:1\u20133"},{"key":"631_CR20","first-page":"248","volume":"11","author":"ZX Zhao","year":"2022","unstructured":"Zhao ZX, Xiao SD, Jin TS, Yang ML (2022) An improved a* algorithm for directional sampling of map features. Mach Des & Manuf 11:248\u2013252","journal-title":"Mach Des & Manuf"},{"issue":"3","key":"631_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11370-024-00536-3","volume":"17","author":"Y Xu","year":"2024","unstructured":"Xu Y, Li Y, Tai YB, Lu XH, Jia YD, Wang YF (2024) A* algorithm based on adaptive expansion convolution for unmanned aerial vehicle path planning. Intel Serv Robot 17(3):521\u2013531","journal-title":"Intel Serv Robot"},{"issue":"7","key":"631_CR22","first-page":"149","volume":"39","author":"CZ Sun","year":"2008","unstructured":"Sun CZ, Lin JG, Lou GF, Wang SW (2008) An double ant colony algorithm in concave obstacle environment for global path planning. Trans Chin Soc Agricult Mach 39(7):149\u2013153","journal-title":"Trans Chin Soc Agricult Mach"},{"key":"631_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, JQ, Liu H, Zu P, Zhao MS, Wang C, Albeshri A, Abusorrah A, Zhou MC (2023) Using tabu search to avoid concave obstacles for source location. IEEE Transactions on Intelligent Transportation Systems","DOI":"10.1109\/TITS.2023.3286973"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00631-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00631-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00631-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T01:34:05Z","timestamp":1757036045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00631-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,12]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["631"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00631-z","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"type":"print","value":"1861-2776"},{"type":"electronic","value":"1861-2784"}],"subject":[],"published":{"date-parts":[[2025,8,12]]},"assertion":[{"value":"10 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}