{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:19:06Z","timestamp":1781216346550,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T00:00:00Z","timestamp":1715212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T00:00:00Z","timestamp":1715212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276207"],"award-info":[{"award-number":["62276207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11227-024-06155-0","type":"journal-article","created":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T18:04:58Z","timestamp":1715277898000},"page":"18009-18047","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Research of hybrid path planning with improved A* and TEB in static and dynamic environments"],"prefix":"10.1007","volume":"80","author":[{"given":"Lin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ning","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zongfang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,9]]},"reference":[{"key":"6155_CR1","doi-asserted-by":"publisher","first-page":"108709","DOI":"10.1016\/j.oceaneng.2021.108709","volume":"223","author":"H Sang","year":"2021","unstructured":"Sang H, You Y, Sun X, Zhou Y, Liu F (2021) The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations. Ocean Eng 223:108709","journal-title":"Ocean Eng"},{"issue":"1","key":"6155_CR2","first-page":"212","volume":"6","author":"I Iswanto","year":"2016","unstructured":"Iswanto I, Wahyunggoro O, Cahyadi AI (2016) Path planning based on fuzzy decision trees and potential field. Int J Electr Comput Eng 6(1):212","journal-title":"Int J Electr Comput Eng"},{"key":"6155_CR3","doi-asserted-by":"crossref","unstructured":"Raja R, Dutta A (2017) Path planning in dynamic environment for a rover using A$$^*$$ and potential field method (2017). In: 2017 18th International Conference on Advanced Robotics (ICAR)","DOI":"10.1109\/ICAR.2017.8023669"},{"key":"6155_CR4","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1969834","author":"R Al-Jarrah","year":"2018","unstructured":"Al-Jarrah R, Al-Jarrah M, Roth H et al (2018) A novel edge detection algorithm for mobile robot path planning. J Robot. https:\/\/doi.org\/10.1155\/2018\/1969834","journal-title":"J Robot"},{"key":"6155_CR5","unstructured":"Qureshi AH, Ayaz Y (2017) Potential functions based sampling heuristic for optimal path planning. Online"},{"key":"6155_CR6","doi-asserted-by":"crossref","unstructured":"Wang G, Jiang C, Tao G, Ye C (2023) Dynamic path planning based on the fusion of improved RRT and DWA algorithms. In: 2023 4th International Conference on Mechatronics Technology and Intelligent Manufacturing (ICMTIM). IEEE, pp 534\u2013538","DOI":"10.1109\/ICMTIM58873.2023.10246738"},{"key":"6155_CR7","first-page":"1","volume":"2021","author":"Z Yu","year":"2021","unstructured":"Yu Z, Xiang L (2021) Npq-rrt$$^{*}$$: An improved rrt$$^{*}$$ approach to hybrid path planning. Complexity 2021:1\u201310","journal-title":"Complexity"},{"key":"6155_CR8","doi-asserted-by":"publisher","first-page":"15569","DOI":"10.1007\/s00521-021-06179-0","volume":"33","author":"F Kiani","year":"2021","unstructured":"Kiani F, Seyyedabbasi A, Aliyev R, Gulle MU, Basyildiz H, Shah MA (2021) Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms. Neural Comput Appl 33:15569\u201315599","journal-title":"Neural Comput Appl"},{"issue":"11","key":"6155_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42452-020-03498-0","volume":"2","author":"B Abhishek","year":"2020","unstructured":"Abhishek B, Ranjit S, Shankar T, Eappen G, Rajesh A (2020) Hybrid PSO-HSA and PSO-GA algorithm for 3D path planning in autonomous UAVs. SN Appl Sci 2(11):1\u201316","journal-title":"SN Appl Sci"},{"key":"6155_CR10","unstructured":"Yong Z, Ling C, Xiaolong X, Feiteng L (2015) Research on time optimal tsp based on hybrid PSO-GA. Application Research of Computers"},{"key":"6155_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.chb.2015.03.062","volume":"50","author":"M Algabri","year":"2015","unstructured":"Algabri M, Mathkour H, Ramdane H, Alsulaiman M (2015) Comparative study of soft computing techniques for mobile robot navigation in an unknown environment. Comput Hum Behav 50:42\u201356","journal-title":"Comput Hum Behav"},{"key":"6155_CR12","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1002\/oca.2781","volume":"44","author":"Q Wei","year":"2023","unstructured":"Wei Q, Song R, Zhang P, Wu Z, Huang R, Qin C, Li JL, Lan X (2023) Path planning of mobile robot in unknown dynamic continuous environment using reward-modified deep-Q-network. Optim Control Appl Methods 44:1570","journal-title":"Optim Control Appl Methods"},{"key":"6155_CR13","doi-asserted-by":"crossref","unstructured":"Lin X, Chen X (2023) Realization of Ackermann robot obstacle avoidance navigation based on multi-sensor fusion slam. In: 2023 5th International Conference on Electronics and Communication, Network and Computer Technology (ECNCT). IEEE, pp 354\u2013359","DOI":"10.1109\/ECNCT59757.2023.10281140"},{"key":"6155_CR14","doi-asserted-by":"publisher","DOI":"10.1108\/AA-07-2020-0095","author":"L Zhang","year":"2021","unstructured":"Zhang L, Zhang Y, Zeng M, Li Y (2021) Robot navigation based on improved a$$^{*}$$ algorithm in dynamic environment. Assem Autom ahead-of-print. https:\/\/doi.org\/10.1108\/AA-07-2020-0095","journal-title":"Assem Autom ahead-of-print"},{"key":"6155_CR15","doi-asserted-by":"crossref","unstructured":"Shi J, Su Y, Bu C, Fan X (2020) A mobile robot path planning algorithm based on improved A. In: Journal of Physics: Conference Series, vol. 1486. IOP Publishing, p. 032018","DOI":"10.1088\/1742-6596\/1486\/3\/032018"},{"key":"6155_CR16","first-page":"2517","volume":"39","author":"W Zhongyu","year":"2019","unstructured":"Zhongyu W, Guohui Z, Bo H, Zhijun F (2019) Global optimal path planning for robots with improved A* algorithm. J Comput Appl 39:2517","journal-title":"J Comput Appl"},{"key":"6155_CR17","unstructured":"Roesmann C, Feiten W, Woesch T, Hoffmann F, Bertram T (2012) Trajectory modification considering dynamic constraints of autonomous robots. In: Germany Conference on Robotics"},{"key":"6155_CR18","doi-asserted-by":"crossref","unstructured":"Quinlan S, Khatib O (1993) Elastic bands: connecting path planning and control. In: [1993] Proceedings IEEE International Conference on Robotics and Automation. IEEE, pp 802\u2013807","DOI":"10.1109\/ROBOT.1993.291936"},{"key":"6155_CR19","unstructured":"Grisetti G, K\u00fcmmerle R, Strasdat H, Konolige K (2011) G2o: a general framework for (hyper) graph optimization. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp 9\u201313"},{"issue":"2012","key":"6155_CR20","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant NR (2012) Benchmarks for grid-based pathfinding. IEEE Trans Comput Intell Ai Games 4(2012):144\u2013148","journal-title":"IEEE Trans Comput Intell Ai Games"},{"issue":"10","key":"6155_CR21","doi-asserted-by":"publisher","first-page":"165096","DOI":"10.1016\/j.ijleo.2020.165096","volume":"219","author":"L Zhang","year":"2020","unstructured":"Zhang L, Zhang Y, Li Y (2020) Path planning for indoor mobile robot based on deep learning. Opt Int J Light Electron Opt 219(10):165096","journal-title":"Opt Int J Light Electron Opt"},{"issue":"5","key":"6155_CR22","doi-asserted-by":"publisher","first-page":"6962","DOI":"10.1109\/JSEN.2020.3039275","volume":"21","author":"L Zhang","year":"2021","unstructured":"Zhang L, Zhang Y, Li Y (2021) Mobile robot path planning based on improved localized particle swarm optimization. IEEE Sens J 21(5):6962\u20136972. https:\/\/doi.org\/10.1109\/JSEN.2020.3039275","journal-title":"IEEE Sens J"},{"key":"6155_CR23","doi-asserted-by":"crossref","unstructured":"Huang S (2021) Path planning based on mixed algorithm of RRT and artificial potential field method. In: 2021 4th International Conference on Intelligent Robotics and Control Engineering (IRCE). IEEE, pp 149\u2013155","DOI":"10.1109\/IRCE53649.2021.9570910"},{"key":"6155_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3299293","author":"Z Yong","year":"2023","unstructured":"Yong Z, Renjie L, Fenghong W, Weiting Z, Qi C, Derui Z, Xinxin C, Shuhao J (2023) An autonomous navigation strategy based on improved hector slam with dynamic weighted A* algorithm. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2023.3299293","journal-title":"IEEE Access"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06155-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T12:25:29Z","timestamp":1720441529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06155-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,9]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["6155"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06155-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,9]]},"assertion":[{"value":"17 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2024","order":2,"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 no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}