{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:40:18Z","timestamp":1781386818338,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["grant nos.62072477 and 61602529"],"award-info":[{"award-number":["grant nos.62072477 and 61602529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["grant nos.62072477 and 61602529"],"award-info":[{"award-number":["grant nos.62072477 and 61602529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["grant nos.62072477 and 61602529"],"award-info":[{"award-number":["grant nos.62072477 and 61602529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["grant nos.62072477 and 61602529"],"award-info":[{"award-number":["grant nos.62072477 and 61602529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation","doi-asserted-by":"crossref","award":["grant nos.62072477 and 61602529"],"award-info":[{"award-number":["grant nos.62072477 and 61602529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Hunan Key Laboratory of Intelligent Lo gistics Technology","award":["2019TP1015"],"award-info":[{"award-number":["2019TP1015"]}]},{"name":"the Hunan Key Laboratory of Intelligent Lo gistics Technology","award":["2019TP1015"],"award-info":[{"award-number":["2019TP1015"]}]},{"name":"the Hunan Key Laboratory of Intelligent Lo gistics Technology","award":["2019TP1015"],"award-info":[{"award-number":["2019TP1015"]}]},{"name":"the Hunan Key Laboratory of Intelligent Lo gistics Technology","award":["2019TP1015"],"award-info":[{"award-number":["2019TP1015"]}]},{"name":"the Hunan Key Laboratory of Intelligent Lo gistics Technology","award":["2019TP1015"],"award-info":[{"award-number":["2019TP1015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-06960-1","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T09:11:28Z","timestamp":1739437888000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-robot Collaborative 3D Path Planning Based On Game Theory and Particle Swarm Optimization Hybrid Method"],"prefix":"10.1007","volume":"81","author":[{"given":"Hong","family":"Qiu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wentao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"issue":"7","key":"6960_CR1","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.16383\/j.aas.c201059","volume":"47","author":"S Wei","year":"2021","unstructured":"Wei S, Yang-He F, Guang-Quan C, Hong-Lan H, Jin-Cai H, Zhong L, Wei H (2021) Research on multi-aircraft cooperative air combat method based on deep reinforcement learning. Acta Automatica Sinica 47(7):1610\u20131623. https:\/\/doi.org\/10.16383\/j.aas.c201059","journal-title":"Acta Automatica Sinica"},{"key":"6960_CR2","unstructured":"Morris R, Pasareanu CS, Luckow K, Malik W, Ma H, Kumar TS, Koenig S (2016) Planning, scheduling and monitoring for airport surface operations. In: Workshops at the Thirtieth AAAI Conference on Artificial Intelligence"},{"issue":"1","key":"6960_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1609\/socs.v15i1.21776","volume":"15","author":"H Zhang","year":"2022","unstructured":"Zhang H, Li Y, Li J, Kumar TS, Koenig S (2022) Mutex propagation in multi-agent path finding for large agents. Proc Int Symp Combin Search 15(1):249\u2013253. https:\/\/doi.org\/10.1609\/socs.v15i1.21776","journal-title":"Proc Int Symp Combin Search"},{"key":"6960_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114660","volume":"173","author":"\u00c1 Madridano","year":"2021","unstructured":"Madridano \u00c1, Al-Kaff A, Mart\u00edn D, De La Escalera A (2021) Trajectory planning for multi-robot systems: Methods and applications. Expert Syst Appl 173:114660. https:\/\/doi.org\/10.1016\/j.eswa.2021.114660","journal-title":"Expert Syst Appl"},{"issue":"3","key":"6960_CR5","doi-asserted-by":"publisher","first-page":"5349","DOI":"10.1109\/LRA.2021.3074878","volume":"6","author":"Z Jian","year":"2021","unstructured":"Jian Z, Zhang S, Chen S, Nan Z, Zheng N (2021) A global-local coupling two-stage path planning method for mobile robots. IEEE Robotics and Automation Letters 6(3):5349\u20135356. https:\/\/doi.org\/10.1109\/LRA.2021.3074878","journal-title":"IEEE Robotics and Automation Letters"},{"key":"6960_CR6","doi-asserted-by":"publisher","unstructured":"Li H, Long, T, Xu G, Wang Y (2019) Coupling-degree-based heuristic prioritized planning method for UAV swarm path generation. 2019 Chinese Automation Congress (CAC), 3636\u20133641 https:\/\/doi.org\/10.1109\/CAC48633.2019.8997273","DOI":"10.1109\/CAC48633.2019.8997273"},{"key":"6960_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1609\/socs.v5i1.18315","volume":"5","author":"M Barer","year":"2014","unstructured":"Barer M, Sharon G, Stern R, Felner A (2014) Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Proceedings of the International Symposium on Combinatorial Search 5:19\u201327. https:\/\/doi.org\/10.1609\/socs.v5i1.18315","journal-title":"In: Proceedings of the International Symposium on Combinatorial Search"},{"issue":"1","key":"6960_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1609\/aaai.v24i1.7564","volume":"24","author":"T Standley","year":"2010","unstructured":"Standley T (2010) Finding optimal solutions to cooperative pathfinding problems. Proceedings of the AAAI conference on artificial intelligence 24(1):173\u2013178. https:\/\/doi.org\/10.1609\/aaai.v24i1.7564","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"6960_CR9","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.artint.2012.11.006","volume":"195","author":"G Sharon","year":"2013","unstructured":"Sharon G, Stern R, Goldenberg M, Felner A (2013) The increasing cost tree search for optimal multi-agent pathfinding. Artif Intell 195:470\u2013495. https:\/\/doi.org\/10.1016\/j.artint.2012.11.006","journal-title":"Artif Intell"},{"key":"6960_CR10","doi-asserted-by":"publisher","unstructured":"Han SD, Rodriguez EJ, Yu J (2018) Sear: A polynomial-time multi-robot path planning algorithm with expected constant-factor optimality guarantee. 2018 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), 1\u20139 https:\/\/doi.org\/10.1109\/IROS.2018.8594417","DOI":"10.1109\/IROS.2018.8594417"},{"issue":"6","key":"6960_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1080\/0952813X.2017.1310142","volume":"29","author":"SS Chouhan","year":"2017","unstructured":"Chouhan SS, Niyogi R (2017) DiMPP: a complete distributed algorithm for multi-agent path planning. Journal of Experimental & Theoretical Artificial Intelligence 29(6):1129\u20131148. https:\/\/doi.org\/10.1080\/0952813X.2017.1310142","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"key":"6960_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.15607\/rss.2009.v.018","volume":"2","author":"J Den Berg","year":"2009","unstructured":"Den Berg J, Snoeyink J, Lin MC (2009) Centralized path planning for multiple robots: Optimal decoupling into sequential plans. In: Robotics: Science and Systems 2:2\u20133. https:\/\/doi.org\/10.15607\/rss.2009.v.018","journal-title":"In: Robotics: Science and Systems"},{"key":"6960_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon G, Stern R, Felner A, Sturtevant NR (2015) Conflict-based search for optimal multi-agent pathfinding. Artif Intell 219:40\u201366. https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"Artif Intell"},{"issue":"1","key":"6960_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1609\/aiide.v1i1.18726","volume":"1","author":"D Silver","year":"2005","unstructured":"Silver D (2005) Cooperative pathfinding. Proceedings of the aaai conference on artificial intelligence and interactive digital entertainment 1(1):117\u2013122. https:\/\/doi.org\/10.1609\/aiide.v1i1.18726","journal-title":"Proceedings of the aaai conference on artificial intelligence and interactive digital entertainment"},{"key":"6960_CR15","doi-asserted-by":"publisher","unstructured":"Li H, Long T, Xu G, Wang Y (2019) Coupling-degree-based heuristic prioritized planning method for UAV swarm path generation. 2019 Chinese Automation Congress (CAC), 3636\u20133641. https:\/\/doi.org\/10.1109\/CAC48633.2019.8997273","DOI":"10.1109\/CAC48633.2019.8997273"},{"key":"6960_CR16","doi-asserted-by":"publisher","unstructured":"Wu W, Bhattacharya S, Prorok A (2020) Multi-robot path deconfliction through prioritization by path prospects. 2020 IEEE international conference on robotics and automation (ICRA), 9809\u20139815 https:\/\/doi.org\/10.1109\/ICRA40945.2020.9196813","DOI":"10.1109\/ICRA40945.2020.9196813"},{"key":"6960_CR17","doi-asserted-by":"publisher","first-page":"168743","DOI":"10.1109\/ACCESS.2020.3023200","volume":"8","author":"J Jiang","year":"2020","unstructured":"Jiang J, Wu K (2020) Cooperative pathfinding based on memory-efficient multi-agent RRT*. IEEE Access 8:168743\u2013168750. https:\/\/doi.org\/10.1109\/ACCESS.2020.3023200","journal-title":"IEEE Access"},{"key":"6960_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2022.103018","volume":"138","author":"E Yanmaz","year":"2023","unstructured":"Yanmaz E (2023) Joint or decoupled optimization: Multi-UAV path planning for search and rescue. Ad Hoc Netw 138:103018. https:\/\/doi.org\/10.1016\/j.adhoc.2022.103018","journal-title":"Ad Hoc Netw"},{"issue":"3","key":"6960_CR19","doi-asserted-by":"publisher","first-page":"4608","DOI":"10.48550\/arXiv.1909.13352","volume":"6","author":"I Solis","year":"2021","unstructured":"Solis I, Motes J, Sandstr\u00f6m R, Amato NM (2021) Representation-optimal multi-robot motion planning using conflict-based search. IEEE Robotics and Automation Letters 6(3):4608\u20134615. https:\/\/doi.org\/10.48550\/arXiv.1909.13352","journal-title":"IEEE Robotics and Automation Letters"},{"key":"6960_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.11.001","volume":"219","author":"G Wagner","year":"2015","unstructured":"Wagner G, Choset H (2015) Subdimensional expansion for multirobot path planning. Artif Intell 219:1\u201324. https:\/\/doi.org\/10.1016\/j.artint.2014.11.001","journal-title":"Artif Intell"},{"key":"6960_CR21","doi-asserted-by":"publisher","first-page":"108034","DOI":"10.1109\/ACCESS.2022.3213035","volume":"10","author":"L Van Nguyen","year":"2022","unstructured":"Van Nguyen L, Phung MD, Ha QP (2022) Game theory-based optimal cooperative path planning for multiple UAVs. IEEE Access 10:108034\u2013108045. https:\/\/doi.org\/10.1109\/ACCESS.2022.3213035","journal-title":"IEEE Access"},{"key":"6960_CR22","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.isatra.2020.03.004","volume":"102","author":"H Wu","year":"2020","unstructured":"Wu H, Shang H (2020) Potential game for dynamic task allocation in multi-agent system. ISA Trans 102:208\u2013220. https:\/\/doi.org\/10.1016\/j.isatra.2020.03.004","journal-title":"ISA Trans"},{"issue":"3","key":"6960_CR23","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.isatra.2020.03.004","volume":"39","author":"Y Zheng","year":"2019","unstructured":"Zheng Y, Wang L, Xi P, Fan W, Han M (2019) Multi-agent path planning algorithm based on ant colony algorithm and game theory. Journal of Computer Applications 39(3):681. https:\/\/doi.org\/10.1016\/j.isatra.2020.03.004","journal-title":"Journal of Computer Applications"},{"key":"6960_CR24","doi-asserted-by":"publisher","unstructured":"Guo Y, Pan Q, Sun Q, Zhao C, Wang D, Feng M (2019) Cooperative game-based multi-agent path planning with obstacle avoidance. 2019 IEEE 28th International Symposium on Industrial Electronics (ISIE), 1385\u20131390 https:\/\/doi.org\/10.1109\/ISIE.2019.8781205","DOI":"10.1109\/ISIE.2019.8781205"},{"issue":"4","key":"6960_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/S43154-022-00090-9","volume":"3","author":"J Gielis","year":"2022","unstructured":"Gielis J, Shankar A, Prorok A (2022) A critical review of communications in multi-robot systems. Current robotics reports 3(4):213\u2013225. https:\/\/doi.org\/10.1007\/S43154-022-00090-9","journal-title":"Current robotics reports"},{"key":"6960_CR26","doi-asserted-by":"crossref","unstructured":"Ajeil FH, Ibraheem IK, Sahib MA, Humaidi AJ (2020) Multi-objective path planning of an autonomous mobile robot using hybrid pso-mfb optimization algorithm. Applied Soft Computing 89:106076","DOI":"10.1016\/j.asoc.2020.106076"},{"issue":"8","key":"6960_CR27","doi-asserted-by":"publisher","first-page":"7238","DOI":"10.1109\/LRA.2024.3420548","volume":"9","author":"I Solis","year":"2024","unstructured":"Solis I, Motes J, Qin M, Morales M, Amato NM (2024) Adaptive robot coordination: A subproblem-based approach for hybrid multi-robot motion planning. IEEE Robotics and Automation Letters 9(8):7238\u20137245. https:\/\/doi.org\/10.1109\/LRA.2024.3420548","journal-title":"IEEE Robotics and Automation Letters"},{"key":"6960_CR28","doi-asserted-by":"publisher","unstructured":"Sun Y, Fu L (2018) Real-time game theory based artificial potential field method for multiple unmanned aerial vehicles path planning. In: Proceedings of the 2018 International Technical Meeting of The Institute of Navigation, pp. 521\u2013528. https:\/\/doi.org\/10.33012\/2018.15583","DOI":"10.33012\/2018.15583"},{"key":"6960_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107376","volume":"107","author":"MD Phung","year":"2021","unstructured":"Phung MD, Ha QP (2021) Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization. Appl Soft Comput 107:107376. https:\/\/doi.org\/10.1016\/j.asoc.2021.107376","journal-title":"Appl Soft Comput"},{"issue":"1","key":"6960_CR30","doi-asserted-by":"publisher","first-page":"26","DOI":"10.5391\/IJFIS.2020.20.1.26","volume":"20","author":"J-H Jung","year":"2020","unstructured":"Jung J-H, Kim D-H (2020) Local path planning of a mobile robot using a novel grid-based potential method. International Journal of Fuzzy Logic and Intelligent Systems 20(1):26\u201334. https:\/\/doi.org\/10.5391\/IJFIS.2020.20.1.26","journal-title":"International Journal of Fuzzy Logic and Intelligent Systems"},{"key":"6960_CR31","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s10489-018-1384-y","volume":"49","author":"RK Dewangan","year":"2019","unstructured":"Dewangan RK, Shukla A, Godfrey WW (2019) Three dimensional path planning using grey wolf optimizer for UAVs. Appl Intell 49:2201\u20132217. https:\/\/doi.org\/10.1007\/s10489-018-1384-y","journal-title":"Appl Intell"},{"key":"6960_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2021.107287","volume":"121","author":"X Chai","year":"2022","unstructured":"Chai X, Zheng Z, Xiao J, Yan L, Qu B, Wen P, Wang H, Zhou Y, Sun H (2022) Multi-strategy fusion differential evolution algorithm for UAV path planning in complex environment. Aerosp Sci Technol 121:107287. https:\/\/doi.org\/10.1016\/j.ast.2021.107287","journal-title":"Aerosp Sci Technol"},{"issue":"20","key":"6960_CR33","doi-asserted-by":"publisher","first-page":"5873","DOI":"10.3390\/s20205873","volume":"20","author":"K Hao","year":"2020","unstructured":"Hao K, Zhao J, Yu K, Li C, Wang C (2020) Path planning of mobile robots based on a multi-population migration genetic algorithm. Sensors 20(20):5873. https:\/\/doi.org\/10.3390\/s20205873","journal-title":"Sensors"},{"key":"6960_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230","volume":"156","author":"C Miao","year":"2021","unstructured":"Miao C, Chen G, Yan C, Wu Y (2021) Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm. Computers & Industrial Engineering 156:107230. https:\/\/doi.org\/10.1016\/j.cie.2021.107230","journal-title":"Computers & Industrial Engineering"},{"key":"6960_CR35","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.procs.2018.07.036","volume":"133","author":"HS Dewang","year":"2018","unstructured":"Dewang HS, Mohanty PK, Kundu S (2018) A robust path planning for mobile robot using smart particle swarm optimization. Procedia computer science 133:290\u2013297. https:\/\/doi.org\/10.1016\/j.procs.2018.07.036","journal-title":"Procedia computer science"},{"issue":"4","key":"6960_CR36","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1007\/s13369-020-05046-9","volume":"46","author":"H Paikray","year":"2021","unstructured":"Paikray H, Das P, Panda S (2021) Optimal multi-robot path planning using particle swarm optimization algorithm improved by sine and cosine algorithms. Arab J Sci Eng 46(4):3357\u20133381. https:\/\/doi.org\/10.1007\/s13369-020-05046-9","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"6960_CR37","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TSMCA.2011.2159586","volume":"42","author":"Y Fu","year":"2011","unstructured":"Fu Y, Ding M, Zhou C (2011) Phase angle-encoded and quantum-behaved particle swarm optimization applied to three-dimensional route planning for UAV. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans 42(2):511\u2013526. https:\/\/doi.org\/10.1109\/TSMCA.2011.2159586","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans"},{"issue":"6","key":"6960_CR38","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1631\/jzus.A071278","volume":"9","author":"Z Wei-Min","year":"2008","unstructured":"Wei-Min Z, Shao-Jun L, Feng Q (2008) $$\\theta$$-pso: a new strategy of particle swarm optimization. Journal of Zhejiang University-SCIENCE A 9(6):786\u2013790. https:\/\/doi.org\/10.1631\/jzus.A071278","journal-title":"Journal of Zhejiang University-SCIENCE A"},{"issue":"3","key":"6960_CR39","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/ACCESS.2020.3023200","volume":"20","author":"J Sun","year":"2012","unstructured":"Sun J, Fang W, Wu X, Palade V, Xu W (2012) Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection. Evol Comput 20(3):349\u2013393. https:\/\/doi.org\/10.1109\/ACCESS.2020.3023200","journal-title":"Evol Comput"},{"key":"6960_CR40","doi-asserted-by":"publisher","unstructured":"Onwubolu GC, Babu B, Clerc M (2004) Discrete particle swarm optimization, illustrated by the traveling salesman problem. New optimization techniques in engineering, 219\u2013239 https:\/\/doi.org\/10.1007\/978-3-540-39930-8_8","DOI":"10.1007\/978-3-540-39930-8_8"},{"key":"6960_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107376","volume":"107","author":"MD Phung","year":"2021","unstructured":"Phung MD, Ha QP (2021) Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization. Appl Soft Comput 107:107376. https:\/\/doi.org\/10.1016\/j.asoc.2021.107376","journal-title":"Appl Soft Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06960-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-06960-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06960-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T09:11:35Z","timestamp":1739437895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-06960-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":41,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["6960"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-06960-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]},"assertion":[{"value":"16 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","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 that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"487"}}