{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T12:59:52Z","timestamp":1782737992766,"version":"3.54.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"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":["No.61971339"],"award-info":[{"award-number":["No.61971339"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Program of Natural Science of Shaanxi province","award":["No. 2022JM407"],"award-info":[{"award-number":["No. 2022JM407"]}]},{"name":"Innovation and Entrepreneurship training program for university students","award":["No. 202310709041"],"award-info":[{"award-number":["No. 202310709041"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s11370-025-00681-3","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T05:53:32Z","timestamp":1773726812000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A dynamic threat model-based conflict resolution method for multiple mobile robots in constrained spaces"],"prefix":"10.1007","volume":"19","author":[{"given":"Zhuang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3403-7990","authenticated-orcid":false,"given":"Xun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuoliang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yushuai","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"issue":"10","key":"681_CR1","doi-asserted-by":"publisher","DOI":"10.3390\/machines11100980","volume":"11","author":"L Yang","year":"2023","unstructured":"Yang L, Li P, Qian S et al (2023) Path planning technique for mobile robots: a review. Machines 11(10):980. https:\/\/doi.org\/10.3390\/machines11100980","journal-title":"Machines"},{"key":"681_CR2","doi-asserted-by":"publisher","DOI":"10.1177\/17298814211060650","author":"X Li","year":"2021","unstructured":"Li X, Zhang Z, Wu DD et al (2021) A multi-robot allocation model for multi-object based on global optimal evaluation of revenue. Int J Adv Robot Syst. https:\/\/doi.org\/10.1177\/17298814211060650","journal-title":"Int J Adv Robot Syst"},{"issue":"6","key":"681_CR3","doi-asserted-by":"publisher","first-page":"6196","DOI":"10.1109\/JSEN.2022.3150098","volume":"22","author":"L Jiao","year":"2022","unstructured":"Jiao L, Peng Z, Xi L, Ding S et al (2022) Multi-agent coverage path planning via proximity interaction and cooperation. IEEE Sens J 22(6):6196\u20136207. https:\/\/doi.org\/10.1109\/JSEN.2022.3150098","journal-title":"IEEE Sens J"},{"key":"681_CR4","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s12369-021-00858-7","volume":"14","author":"F Babel","year":"2022","unstructured":"Babel F, Vogt A, Hock P et al (2022) Step aside! VR-based evaluation of adaptive robot conflict resolution strategies for domestic service robots. Int J Soc Robot 14:1239\u20131260. https:\/\/doi.org\/10.1007\/s12369-021-00858-7","journal-title":"Int J Soc Robot"},{"issue":"22","key":"681_CR5","doi-asserted-by":"publisher","DOI":"10.3390\/s22228948","volume":"22","author":"L Yu","year":"2022","unstructured":"Yu L, Wu H, Liu C et al (2022) An optimization-based motion planner for car-like logistics robots on narrow roads. Sensors 22(22):8948. https:\/\/doi.org\/10.3390\/s22228948","journal-title":"Sensors"},{"issue":"9","key":"681_CR6","doi-asserted-by":"publisher","DOI":"10.3390\/machines10090773","volume":"10","author":"S Lin","year":"2022","unstructured":"Lin S, Liu A, Wang J et al (2022) A review of path-planning approaches for multiple mobile robots. Machines 10(9):773. https:\/\/doi.org\/10.3390\/machines10090773","journal-title":"Machines"},{"issue":"2","key":"681_CR7","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9020316","volume":"9","author":"S Hyunwoo","year":"2020","unstructured":"Hyunwoo S, Junjae C (2020) A performance review of collision-free path planning algorithms. Electronics 9(2):316. https:\/\/doi.org\/10.3390\/electronics9020316","journal-title":"Electronics"},{"key":"681_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121112","volume":"235","author":"X Li","year":"2024","unstructured":"Li X, Wang L, An Y et al (2024) Dynamic path planning of mobile robots using adaptive dynamic programming. Expert Syst Appl 235:121112. https:\/\/doi.org\/10.1016\/j.eswa.2023.121112","journal-title":"Expert Syst Appl"},{"key":"681_CR9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-89549-1","volume":"15","author":"K Jia","year":"2025","unstructured":"Jia K, Peng C, Du Y et al (2025) Conflict-based strategy combined integrated optimal conflict avoidance algorithm. Sci Rep 15:5670. https:\/\/doi.org\/10.1038\/s41598-025-89549-1","journal-title":"Sci Rep"},{"key":"681_CR10","doi-asserted-by":"crossref","unstructured":"Fredriksson S, Bai Y,  Saradagi A, Nikolakopoulos G (2025) Multi-agent path finding using conflict-based search and structural-semantic topometric maps. arXiv preprint arXiv:2501.17661.","DOI":"10.1109\/ICRA55743.2025.11128758"},{"key":"681_CR11","doi-asserted-by":"publisher","unstructured":"Liu G, Wang Y, Dong X, Ran K (2024) Multi-UAV distributed collaborative path planning based on NTVPPSO. In: 2024 IEEE international conference on systems, man, and cybernetics (SMC), Kuching, Malaysia, pp. 1846\u20131853. https:\/\/doi.org\/10.1109\/SMC54092.2024.10831657.","DOI":"10.1109\/SMC54092.2024.10831657"},{"key":"681_CR12","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s11370-021-00387-2","volume":"14","author":"J Choi","year":"2021","unstructured":"Choi J, Lee G, Lee C (2021) Reinforcement learning-based dynamic obstacle avoidance and integration of path planning. Intel Serv Robotics 14:663\u2013677. https:\/\/doi.org\/10.1007\/s11370-021-00387-2","journal-title":"Intel Serv Robotics"},{"key":"681_CR13","doi-asserted-by":"crossref","unstructured":"Di W, Hongbin D (2021) Multirobot coordination with deep reinforcement learning in complex environments. Expert Syst Appl, p. 180","DOI":"10.1016\/j.eswa.2021.115128"},{"key":"681_CR14","doi-asserted-by":"publisher","unstructured":"Mai S, Mostaghim S (2022) Collective decision-making for conflict resolution in multi-agent pathfinding. In: Dorigo M et al (eds) Swarm intelligence. ANTS 2022. Lecture Notes in Computer Science, vol 13491. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-20176-9_7","DOI":"10.1007\/978-3-031-20176-9_7"},{"key":"681_CR15","unstructured":"Ding JX, Hu D, Duan YM, Li YHY, Ma HZ, Xie S, Jiang YJ, Wang H, Long JC (2025) Multi-robot conflict-free path planning method integrating bi-level programming and response algorithm (CN Patent No. 202411510268.X). China National Intellectual Property Administration."},{"issue":"13","key":"681_CR16","doi-asserted-by":"publisher","first-page":"11272","DOI":"10.1609\/aaai.v35i13.17344","volume":"35","author":"J Li","year":"2021","unstructured":"Li J, Tinka A, Kiesel S, Durham JW, Kumar TKS, Koenig S (2021) Lifelong multi-agent path finding in large-scale warehouses. Proc  AAAI Conf  Artif  Intell 35(13):11272\u201311281. https:\/\/doi.org\/10.1609\/aaai.v35i13.17344","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"681_CR17","doi-asserted-by":"publisher","unstructured":"Song Z, Zhang H, Liu F, Chen S, Zhang F (2018) Unmanned aerial vehicle coverage path planning algorithm based on cellular automata. In: 2018 International conference on information systems and computer aided education (ICISCAE), Changchun, China, 2018, pp. 371\u2013374. https:\/\/doi.org\/10.1109\/ICISCAE.2018.8666895.","DOI":"10.1109\/ICISCAE.2018.8666895"},{"key":"681_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.arcontrol.2020.10.00","volume":"50","author":"MN Ab Wahab","year":"2020","unstructured":"Ab Wahab MN, Nefti-Meziani S, Atyabi A (2020) A comparative review on mobile robot path planning: classical or meta-heuristic methods? Annu Rev Control 50:233\u2013252. https:\/\/doi.org\/10.1016\/j.arcontrol.2020.10.00","journal-title":"Annu Rev Control"},{"key":"681_CR19","doi-asserted-by":"publisher","unstructured":"Oliveira GMB et al (2019) A cellular automata-based path-planning for a cooperative and decentralized team of robots. In: 2019 IEEE congress on evolutionary computation (CEC), Wellington, New Zealand, pp. 739\u2013746. https:\/\/doi.org\/10.1109\/CEC.2019.8790205.","DOI":"10.1109\/CEC.2019.8790205"},{"issue":"2021","key":"681_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jmsy.2021.01.009","volume":"59","author":"F Basit","year":"2021","unstructured":"Basit F, Jinsong B, Hanan R et al (2021) Flow-shop path planning for multi-automated guided vehicles in intelligent textile spinning cyber-physical production systems dynamic environment. J Manuf Syst 59(2021):98\u2013116. https:\/\/doi.org\/10.1016\/j.jmsy.2021.01.009","journal-title":"J Manuf Syst"},{"issue":"5","key":"681_CR21","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1177\/09544062231181838","volume":"238","author":"Z Zhou","year":"2024","unstructured":"Zhou Z, Xu L, Qin H et al (2024) A multi-AGV fast path planning method based on improved CBS algorithm in workshops. Proc Inst Mech Eng C J Mech Eng Sci 238(5):1507\u20131521. https:\/\/doi.org\/10.1177\/09544062231181838","journal-title":"Proc Inst Mech Eng C J Mech Eng Sci"},{"key":"681_CR22","unstructured":"Zadeh MS, Powers WMD, Sammut K et al (2016) Optimal route planning with prioritized task scheduling for AUV missions. CoRR, abs\/1604.03303."},{"key":"681_CR23","doi-asserted-by":"publisher","unstructured":"Xia XH, Duanmu YX, Guo YY et al (2021) Multi-robot collaborative path planning and conflict resolution in stereoscopic warehouse. Xiandai Zhizao Gongcheng (Modern Manufacturing Engineering), 2021(11):49\u201357. https:\/\/doi.org\/10.16731\/j.cnki.1671-3133.2021.11.007","DOI":"10.16731\/j.cnki.1671-3133.2021.11.007"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00681-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00681-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00681-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:48:16Z","timestamp":1779425296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00681-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["681"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00681-3","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"2 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"49"}}