{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T14:46:47Z","timestamp":1782744407290,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T00:00:00Z","timestamp":1779840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"vor","delay-in-days":33,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFC3807402-02"],"award-info":[{"award-number":["2023YFC3807402-02"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-026-50845-z","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T06:03:53Z","timestamp":1779861833000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An improved Q-learning approach for rescue path planning in mass casualty incidents under damaged road network conditions"],"prefix":"10.1038","volume":"16","author":[{"given":"Sheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingrong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,27]]},"reference":[{"key":"50845_CR1","unstructured":"Centre for Research on the Epidemiology of Disasters (CRED). 2024 Disasters in Numbers (CRED, 2025)."},{"key":"50845_CR2","unstructured":"Centre for Research on the Epidemiology of Disasters (CRED). Disaster year in review 2024. CRED Crunch 78 (2025)."},{"key":"50845_CR3","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph19137876","volume":"19","author":"F Wang","year":"2022","unstructured":"Wang, F., Xie, Z., Liu, H., Pei, Z. & Liu, D. Multiobjective emergency resource allocation under the natural disaster chain with path planning. Int. J. Environ. Res. Public Health 19, 7876 (2022).","journal-title":"Int. J. Environ. Res. Public Health"},{"key":"50845_CR4","doi-asserted-by":"publisher","first-page":"572","DOI":"10.3390\/drones7090572","volume":"7","author":"W Wang","year":"2023","unstructured":"Wang, W. et al. Multiple unmanned aerial vehicle autonomous path planning algorithm based on whale-inspired deep Q-network. Drones 7, 572 (2023).","journal-title":"Drones"},{"key":"50845_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.robot.2019.02.013","volume":"115","author":"ES Low","year":"2019","unstructured":"Low, E. S., Ong, P. & Cheah, K. C. Solving the optimal path planning of a mobile robot using improved Q-learning. Robot. Auton. Syst. 115, 143\u2013161 (2019).","journal-title":"Robot. Auton. Syst."},{"key":"50845_CR6","first-page":"491","volume":"33","author":"D Luviano","year":"2017","unstructured":"Luviano, D. & Yu, W. Continuous-time path planning for multi-agents with fuzzy reinforcement learning. J. Intell. Fuzzy Syst. 33, 491\u2013501 (2017).","journal-title":"J. Intell. Fuzzy Syst."},{"key":"50845_CR7","first-page":"2312","volume":"52","author":"Z Lou","year":"2024","unstructured":"Lou, Z., Peng, Y. & Xin, K. Research on path planning system based on improved Q-learning algorithm. Comput. Digit. Eng. 52, 2312\u20132316 (2024).","journal-title":"Comput. Digit. Eng."},{"key":"50845_CR8","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-06374-2","volume":"15","author":"J Liang","year":"2025","unstructured":"Liang, J., Liu, M., Zhang, Z. & Yang, L. Shortest path planning and dynamic rescue forces dispatching for urban flood disasters. Sci. Rep. 15, 23643 (2025).","journal-title":"Sci. Rep."},{"key":"50845_CR9","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/s10479-024-05933-6","volume":"338","author":"G Wang","year":"2024","unstructured":"Wang, G. Disaster relief supply chain network planning under uncertainty. Ann. Oper. Res. 338, 1127\u20131156 (2024).","journal-title":"Ann. Oper. Res."},{"key":"50845_CR10","volume":"25","author":"SK Bahar","year":"2025","unstructured":"Bahar, S. K., Najafi, M. & Molana, S. M. H. Optimizing injured people transportation in earthquake response: Considering traffic congestion with BPR function. Oper. Res. 25, 86 (2025).","journal-title":"Oper. Res."},{"key":"50845_CR11","doi-asserted-by":"crossref","unstructured":"Tabakis, M. & Dasygenis, M. Deep reinforcement learning-based path planning for dynamic and heterogeneous environments. In Proc. 2024 Panhellenic Conference on Electronics & Telecommunications (PACET), 1\u20134 (Thessaloniki, Greece, 2024).","DOI":"10.1109\/PACET60398.2024.10496999"},{"key":"50845_CR12","doi-asserted-by":"crossref","unstructured":"Ma, Z. & Liu, Z. An improved Q-learning algorithm with particle swarm optimization for path planning. In Proc. 2024 6th International Conference on Frontier Technologies of Information and Computer (ICFTIC), 1662\u20131667 (Qingdao, China, 2024).","DOI":"10.1109\/ICFTIC64248.2024.10913234"},{"key":"50845_CR13","doi-asserted-by":"crossref","unstructured":"Rocha, L. G. S., Caldas, K. A. Q., Terra, M. H., Ramos, F. & Vivaldini, K. C. T. Dynamic Q-planning for online UAV path planning in unknown and complex environments. (2024). https:\/\/arxiv.org\/abs\/2402.06297","DOI":"10.21203\/rs.3.rs-3942682\/v1"},{"key":"50845_CR14","doi-asserted-by":"publisher","first-page":"15391","DOI":"10.1109\/TVT.2023.3297837","volume":"72","author":"J Wu","year":"2023","unstructured":"Wu, J. et al. An adaptive conversion speed Q-learning algorithm for search and rescue UAV path planning in unknown environments. IEEE Trans. Veh. Technol. 72, 15391\u201315404 (2023).","journal-title":"IEEE Trans. Veh. Technol."},{"key":"50845_CR40","doi-asserted-by":"crossref","unstructured":"Sichkar, V. N. Reinforcement Learning Algorithms in Global Path Planning for Mobile Robot. in 2019 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)IEEE, (2019).","DOI":"10.1109\/ICIEAM.2019.8742915"},{"key":"50845_CR41","doi-asserted-by":"crossref","unstructured":"Mohan, P., Sharma, L. & Narayan, P. Optimal Path Finding using Iterative SARSA. in 2021 5th International Conference on Intelligent Computing and Control Systems (ICICCS) 811\u2013817IEEE, (2021).","DOI":"10.1109\/ICICCS51141.2021.9432202"},{"key":"50845_CR42","doi-asserted-by":"crossref","unstructured":"Yin, Z., Cao, W., Song, T., Yang, X. & Zhang, T. Reinforcement learning path planning based on step batch Q-learning algorithm. in Proc. 2022 IEEE Int. Conf. Artif. Intell. Comput. Appl. (ICAICA) 630\u2013633IEEE, Dalian, China, (2022).","DOI":"10.1109\/ICAICA54878.2022.9844553"},{"key":"50845_CR43","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.3390\/sym17091530","volume":"17","author":"J Zhao","year":"2025","unstructured":"Zhao, J. et al. Application of an improved double Q-learning algorithm in ground mobile robots. Symmetry 17, 1530 (2025).","journal-title":"Symmetry"},{"key":"50845_CR44","doi-asserted-by":"publisher","first-page":"7664","DOI":"10.1109\/ACCESS.2021.3139534","volume":"10","author":"D Li","year":"2022","unstructured":"Li, D., Yin, W., Wong, W. E., Jian, M. & Chau, M. Quality-oriented hybrid path planning based on A* and Q-learning for unmanned aerial vehicle. IEEE Access. 10, 7664\u20137674 (2022).","journal-title":"IEEE Access."},{"key":"50845_CR45","doi-asserted-by":"publisher","first-page":"113836","DOI":"10.1016\/j.knosys.2025.113836","volume":"324","author":"M Ben-Akka","year":"2025","unstructured":"Ben-Akka, M., Tanougast, C. & Diou, C. Novel design of reward and epsilon-greedy decay strategy tailored for Q-learning in optimizing local mobile robot path planning. Knowl. -Based Syst. 324, 113836 (2025).","journal-title":"Knowl. -Based Syst."},{"key":"50845_CR46","doi-asserted-by":"publisher","first-page":"00011","DOI":"10.1051\/bioconf\/20249700011","volume":"97","author":"NH Fallooh","year":"2024","unstructured":"Fallooh, N. H., Sadiq, A. T., Abbas, E. I. & Hashim, I. A. Dynamic path planning using a modification Q-learning algorithm for a mobile robot. BIO Web Conf. 97, 00011 (2024).","journal-title":"BIO Web Conf."},{"key":"50845_CR47","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N. & Fischer, P. Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2002).","journal-title":"Mach. Learn."},{"key":"50845_CR48","doi-asserted-by":"publisher","first-page":"5358","DOI":"10.1109\/TVT.2024.3503552","volume":"74","author":"C Sheng","year":"2025","unstructured":"Sheng, C., An, H., Nie, J., Wang, H. & Lu, X. Improved M-DQN with \u03b5-UCB action selection policy and multi-goal fusion reward function for mobile robot path planning. IEEE Trans. Veh. Technol. 74, 5358\u20135369 (2025).","journal-title":"IEEE Trans. Veh. Technol."},{"key":"50845_CR49","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.3390\/math12131979","volume":"12","author":"D Chen","year":"2024","unstructured":"Chen, D. et al. Deceptive path planning via count-based reinforcement learning under specific time constraint. Mathematics 12, 1979 (2024).","journal-title":"Mathematics"},{"key":"50845_CR50","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Chen, Y., Huang, H. & Liu, S. Enhancing UAV coverage path planning via deep reinforcement learning with intrinsic curiosity. in IEEE Smart World Congress (SWC) (IEEE, 2024). (2024).","DOI":"10.1109\/SWC62898.2024.00095"},{"key":"50845_CR51","doi-asserted-by":"crossref","unstructured":"Mao, Z. et al. Agent maze path planning based on simulated annealing Q-learning algorithm. in Proc. 41st Chinese Control Conference (CCC) 2272\u20132276 (IEEE, Hefei, China, 2022). (2022).","DOI":"10.23919\/CCC55666.2022.9902817"},{"key":"50845_CR52","doi-asserted-by":"publisher","first-page":"125388","DOI":"10.1016\/j.eswa.2024.125388","volume":"260","author":"Y Zhong","year":"2025","unstructured":"Zhong, Y. & Wang, Y. Cross-regional path planning based on improved Q-learning with dynamic exploration factor and heuristic reward value. Expert Syst. Appl. 260, 125388 (2025).","journal-title":"Expert Syst. Appl."},{"key":"50845_CR53","doi-asserted-by":"publisher","first-page":"3275","DOI":"10.1007\/s11760-023-02989-y","volume":"18","author":"K Shi","year":"2024","unstructured":"Shi, K., Wu, W., Wu, Z., Jiang, B. & Karimi, H. R. Coverage path planning for cleaning robot based on improved simulated annealing algorithm and ant colony algorithm. Signal. Image Video Process. 18, 3275\u20133284 (2024).","journal-title":"Signal. Image Video Process."},{"key":"50845_CR54","doi-asserted-by":"crossref","first-page":"6441","DOI":"10.3390\/app15126441","volume":"15","author":"R Jaramillo-Mart\u00ednez","year":"2025","unstructured":"Jaramillo-Mart\u00ednez, R. & Chavero-Navarrete, E. Ibarra-P\u00e9rez, T. Reinforcement-learning-based path planning: a reward function strategy. Appl. Sci. 15, 6441 (2025).","journal-title":"Appl. Sci."},{"key":"50845_CR55","doi-asserted-by":"crossref","unstructured":"Hao, B., Du, H., Zhao, J., Zhang, J. & Wang, Q. A path-planning approach based on potential and dynamic Q-learning for mobile robots in unknown environment. Comput. Intell. Neurosci. 2540546 (2022). (2022).","DOI":"10.1155\/2022\/2540546"},{"key":"50845_CR56","doi-asserted-by":"crossref","unstructured":"Song, Z., Zheng, R., Zhang, S. & Liu, M. Cooperative reward shaping for multi-agent pathfinding. Preprint at (2024). https:\/\/arxiv.org\/abs\/2407.10403","DOI":"10.2139\/ssrn.5186548"},{"key":"50845_CR57","doi-asserted-by":"crossref","unstructured":"Van Hasselt, H., Guez, A. & Silver, D. Deep reinforcement learning with double Q-learning. in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) 2094\u20132100AAAI Press, (2016).","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"50845_CR58","doi-asserted-by":"publisher","first-page":"21858","DOI":"10.1007\/s10489-023-04601-9","volume":"53","author":"W Zhou","year":"2023","unstructured":"Zhou, W., Zhang, C. & Chen, S. Dual deep Q-learning network guiding a multiagent path planning approach for virtual fire emergency scenarios. Appl. Intell. 53, 21858\u201321874 (2023).","journal-title":"Appl. Intell."},{"key":"50845_CR59","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/JAS.2019.1911732","volume":"7","author":"L Jiang","year":"2020","unstructured":"Jiang, L., Huang, H. & Ding, Z. Path planning for intelligent robots based on deep Q-learning with experience replay and heuristic knowledge. IEEE\/CAA J. Autom. Sin. 7, 1179\u20131189 (2020).","journal-title":"IEEE\/CAA J. Autom. Sin"},{"key":"50845_CR60","doi-asserted-by":"publisher","first-page":"111503","DOI":"10.1016\/j.asoc.2024.111503","volume":"158","author":"M G\u00f6k","year":"2024","unstructured":"G\u00f6k, M. Dynamic path planning via dueling double deep Q-network (D3QN) with prioritized experience replay. Appl. Soft Comput. 158, 111503 (2024).","journal-title":"Appl. Soft Comput."},{"key":"50845_CR61","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.3390\/jmse9111267","volume":"9","author":"Z Zhu","year":"2021","unstructured":"Zhu, Z., Hu, C., Zhu, C., Zhu, Y. & Sheng, Y. An improved dueling deep double-Q network based on prioritized experience replay for path planning of unmanned surface vehicles. J. Mar. Sci. Eng. 9, 1267 (2021).","journal-title":"J. Mar. Sci. Eng."},{"key":"50845_CR62","doi-asserted-by":"publisher","first-page":"120254","DOI":"10.1016\/j.eswa.2023.120254","volume":"227","author":"L Liu","year":"2023","unstructured":"Liu, L. et al. Path planning techniques for mobile robots: review and prospect. Expert Syst. Appl. 227, 120254 (2023).","journal-title":"Expert Syst. Appl."},{"key":"50845_CR63","doi-asserted-by":"publisher","first-page":"12113","DOI":"10.1007\/s13369-023-08541-x","volume":"49","author":"Y Pan","year":"2024","unstructured":"Pan, Y. et al. Dynamic path planning of vehicles based on the adaptive potential field and hierarchical replacement immune algorithm. Arab. J. Sci. Eng. 49, 12113\u201312129 (2024).","journal-title":"Arab. J. Sci. Eng."},{"key":"50845_CR64","doi-asserted-by":"publisher","first-page":"111400","DOI":"10.1016\/j.knosys.2024.111400","volume":"286","author":"Q Zhou","year":"2024","unstructured":"Zhou, Q. et al. An optimized Q-learning algorithm for mobile robot local path planning. Knowl. -Based Syst. 286, 111400 (2024).","journal-title":"Knowl. -Based Syst."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-50845-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-50845-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-50845-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T14:24:31Z","timestamp":1782743071000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-50845-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,27]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["50845"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-50845-z","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,27]]},"assertion":[{"value":"16 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2026","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"19781"}}