{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:26:06Z","timestamp":1774466766967,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"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 Chin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10586-025-05774-3","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T18:33:57Z","timestamp":1760726037000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Integrated A* and DWA algorithms for emergency rescue path planning"],"prefix":"10.1007","volume":"28","author":[{"given":"Xingna","family":"Hou","sequence":"first","affiliation":[]},{"given":"Yulan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jinshuo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shouhong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"5774_CR1","doi-asserted-by":"crossref","unstructured":"Debnath, S., Kumar, et al.: Energy Efficient Elliptical Concave Visibility Graph Algorithm for Unmanned Aerial Vehicle in an Obstacle-rich Environment,2020 IEEE INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL AND INTELLIGENT SYSTEMS (I2CACIS 2020) : 129-134. (2020)","DOI":"10.1109\/I2CACIS49202.2020.9140112"},{"key":"5774_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, J., Ling, H., Tang, Z., et al.: Path planning of USV in confined waters based on improved A \u2217 and DWA fusion algorithm[J]. Ocean Engineering , 322120475\u2013120475 (2025)","DOI":"10.1016\/j.oceaneng.2025.120475"},{"issue":"1","key":"5774_CR3","first-page":"97","volume":"43","author":"MGH Bell","year":"2009","unstructured":"Bell, M.G.H.: Hyperstar: A Multi-Path astar algorithm for risk averse vehicle Navigation,Transportation research. Ser. B: Methodological. 43(1), 97\u2013107 (2009)","journal-title":"Ser. B: Methodological"},{"key":"5774_CR4","doi-asserted-by":"crossref","unstructured":"Lei, Z., Yuan, L.: Mobile Robot Path Planning Algorithm Based on Improved A Star[J].Journal of Physics: Conference Series,1848(1): (2021)","DOI":"10.1088\/1742-6596\/1848\/1\/012013"},{"key":"5774_CR5","doi-asserted-by":"publisher","first-page":"59196","DOI":"10.1109\/ACCESS.2021.3070054","volume":"9","author":"G Tang","year":"2021","unstructured":"Tang, G., et al.: Geometric A-Star algorithm: An improved A-Star algorithm for AGV path planning in a Port environment. IEEE Access. 9, 59196\u201359210 (2021)","journal-title":"IEEE Access."},{"key":"5774_CR6","doi-asserted-by":"publisher","first-page":"20602","DOI":"10.1109\/ACCESS.2021.3055231","volume":"9","author":"Z Liu","year":"2021","unstructured":"Liu, Z., et al.: A dynamic fusion pathfinding algorithm using Delaunay triangulation and improved A-Star for mobile robots. IEEE Access. 9, 20602\u201320621 (2021)","journal-title":"IEEE Access."},{"issue":"16","key":"5774_CR7","doi-asserted-by":"publisher","first-page":"6198","DOI":"10.3390\/s22166198","volume":"22","author":"Y Ou","year":"2022","unstructured":"Ou, Y., et al.: Improved A* path planning method based on the grid map. Sensors. 22(16), 6198\u20136198 (2022)","journal-title":"Sensors"},{"issue":"8","key":"5774_CR8","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1177\/00202940241228725","volume":"57","author":"B Xu","year":"2024","unstructured":"Xu, B.: Precise path planning and trajectory tracking based on improved A-star algorithm. Measurement and Control 57(8), 1025\u20131037 (2024)","journal-title":"Measurement and Control"},{"issue":"3","key":"5774_CR9","first-page":"1","volume":"16","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Guo, J., ,Zhu, D., et al.: Dynamic path planning fusion algorithm with improved A* algorithm and dynamic window approach[J]. Int. J. Mach. Learn. Cybernetics 16(3), 1\u201315 (2024)","journal-title":"Int. J. Mach. Learn. Cybernetics"},{"key":"5774_CR10","doi-asserted-by":"crossref","unstructured":"Ozdemir, A.: and Volkan Sezer. Follow the Gap with Dynamic Window Approach,International Journal of Semantic Computing 12.01 : 43-57. (2018)","DOI":"10.1142\/S1793351X18400032"},{"key":"5774_CR11","doi-asserted-by":"crossref","unstructured":"Jinseok, Kim, and Yang Gi-Hun. Improvement of Dynamic Window Approach Using Reinforcement Learning in Dynamic Environments,International journal of control, automation, and systems 20.9 : 2983-2992. (2022)","DOI":"10.1007\/s12555-021-0462-9"},{"key":"5774_CR12","first-page":"3068","volume":"40","author":"M Dobrevski","year":"2024","unstructured":"Dobrevski, M.: Dynamic adaptive dynamic window approach. IEEE J. Rob. Autom 40, 3068\u20133081 (2024)","journal-title":"IEEE J. Rob. Autom"},{"issue":"3","key":"5774_CR13","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s12555-022-0495-8","volume":"22","author":"Z Rui","year":"2024","unstructured":"Rui, Z., Kun, Z., ,Lina, W., et al.: An improved dynamic window path planning algorithm using Multi-algorithm Fusion[J]. Int. J. Control Autom. Syst. 22(3), 1005\u20131020 (2024)","journal-title":"Int. J. Control Autom. Syst."},{"key":"5774_CR14","doi-asserted-by":"publisher","unstructured":"\u738b\u5411\u5b87.\u57fa\u4e8e\u6539\u8fdbA*\u7b97\u6cd5\u548c\u52a8\u6001\u7a97\u53e3\u6cd5\u7684\u5ba4\u5185\u79fb\u52a8\u673a\u5668\u4eba\u8def\u5f84\u89c4\u5212\u7814\u7a76[D].\u6c5f\u897f\u7406\u5de5\u5927\u5b66: (2023). https:\/\/doi.org\/10.27176\/d.cnki.gnfyc.2023.000563","DOI":"10.27176\/d.cnki.gnfyc.2023.000563"},{"key":"5774_CR15","doi-asserted-by":"publisher","unstructured":"\u5218\u7ea2.\u878d\u5408\u6539\u8fdbA*\u7b97\u6cd5\u548c\u4eba\u5de5\u52bf\u573a\u6cd5\u7684\u79fb\u52a8\u673a\u5668\u4eba\u6df7\u5408\u8def\u5f84\u89c4\u5212[D].\u71d5\u5c71\u5927\u5b66: (2023). https:\/\/doi.org\/10.27440\/d.cnki.gysdu.2023.000340","DOI":"10.27440\/d.cnki.gysdu.2023.000340"},{"key":"5774_CR16","doi-asserted-by":"publisher","unstructured":"\u8d56\u8363\u71ca,\u7aa6\u78ca: \u5deb\u5fd7\u52c7,\u7b49.\u878d\u5408\u6539\u8fdbA*\u7b97\u6cd5\u548c\u52a8\u6001\u7a97\u53e3\u6cd5\u7684\u79fb\u52a8\u673a\u5668\u4eba\u8def\u5f84\u89c4\u5212[J].\u7cfb\u7edf\u4eff\u771f\u5b66\u62a5,2024,36(08):1884\u20131894.https:\/\/doi.org\/10.16182\/j.issn1004731x.joss.24-0233","DOI":"10.16182\/j.issn1004731x.joss.24-0233"},{"key":"5774_CR17","doi-asserted-by":"publisher","unstructured":"Li, B., et al.: Autonomous driving on curvy roads without reliance on Frenet frame: A Cartesian-Based trajectory planning Method[J]. IEEE Trans. Intell. Transp. Syst 23(9), 15729\u201315741 (2022). https:\/\/doi.org\/10.1109\/tits.2022.3145389","DOI":"10.1109\/tits.2022.3145389"},{"key":"5774_CR18","doi-asserted-by":"publisher","unstructured":"\u9ec4\u5d07\u534e.\u57fa\u4e8e\u6539\u8fdbA*\u7b97\u6cd5\u7684\u8def\u5f84\u89c4\u5212\u53ca\u52a8\u6001\u907f\u969c\u51b3\u7b56\u7814\u7a76[D].\u91cd\u5e86\u7406\u5de5\u5927\u5b66: (2024). https:\/\/doi.org\/10.27753\/d.cnki.gcqgx.2024.000357","DOI":"10.27753\/d.cnki.gcqgx.2024.000357"},{"issue":"17","key":"5774_CR19","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.3390\/electronics11172683","volume":"11","author":"X Yicheng Sun","year":"2022","unstructured":"Yicheng Sun, X., Zhao, Yazhou Yu: Research on a random Route-Planning method based on the fusion of the A* algorithm and dynamic window method[J]. Electronics. 11(17), 2683\u20132683 (2022)","journal-title":"Electronics"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05774-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05774-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05774-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:15:07Z","timestamp":1764771307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05774-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":19,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["5774"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05774-3","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"1 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":4,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1059"}}