{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:27:20Z","timestamp":1775813240637,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T00:00:00Z","timestamp":1771718400000},"content-version":"vor","delay-in-days":52,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1016\/j.procs.2026.02.250","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:17:59Z","timestamp":1774250279000},"page":"2125-2134","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Low-Level Planner on Conflict-Based Search Efficiency in Multi-Agent Path Finding"],"prefix":"10.1016","volume":"277","author":[{"given":"Marco","family":"Ricci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Accorsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Battarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacomo","family":"Lupi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2026.02.250_bib1","doi-asserted-by":"crossref","DOI":"10.1609\/socs.v10i1.18510","article-title":"\u201cMulti-Agent Pathfinding: Definitions, Variants, and Benchmarks\u201d.","volume":"10","author":"Stern","year":"2021","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"key":"10.1016\/j.procs.2026.02.250_bib2","unstructured":"Lehoux Vassilissa, Silander Tomi, Loiodice Christelle, Lee Seungjoon, Wang Albert, Michel Sofia. (2024). \u201cMulti-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses\u201d. ECAI 2024"},{"key":"10.1016\/j.procs.2026.02.250_bib3","doi-asserted-by":"crossref","unstructured":"Jianqi Gao, Yanjie Li, Xinyi Li, Kejian Yan, Ke Lin, Xinyu Wu. (2024). \u201cA review of graph-based multi-agent pathfinding solvers: From classical to beyond classical\u201d, Knowledge-Based Systems, 283","DOI":"10.1016\/j.knosys.2023.111121"},{"key":"10.1016\/j.procs.2026.02.250_bib4","article-title":"\u201cAn improved A-Star based path planning algorithm for autonomous land vehicles\u201d.","volume":"17","author":"Shang","year":"2020","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"10.1016\/j.procs.2026.02.250_bib5","first-page":"99","article-title":"\"Path Planning Based on Combinaion of Improved A-STAR Algorithm and DWA Algorithm,\" 2nd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM)","author":"Li","year":"2020","journal-title":"Manchester, United Kingdom"},{"key":"10.1016\/j.procs.2026.02.250_bib6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/17298814211042730","article-title":"\u201cAutonomous land vehicle path planning algorithm based on improved heuristic function of A-Star\u201d.","volume":"18","author":"Zhang","year":"2021","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"10.1016\/j.procs.2026.02.250_bib7","doi-asserted-by":"crossref","unstructured":"Peiying Li, Lingjuan Hao,Yanjie Zhao,Jianmin Lu (2024). \u201cRobot obstacle avoidance optimization by A* and DWA fusion algorithm.\u201d PLOS ONE, 19(4).","DOI":"10.1371\/journal.pone.0302026"},{"key":"10.1016\/j.procs.2026.02.250_bib8","doi-asserted-by":"crossref","first-page":"3103","DOI":"10.3390\/app14073103","article-title":"\u201cA path planning method based on improved A* and fuzzy control DWA of underground mine vehicles.\u201d","volume":"14","author":"Zhang","year":"2024","journal-title":"Applied Science"},{"key":"10.1016\/j.procs.2026.02.250_bib9","doi-asserted-by":"crossref","unstructured":"Mengxue Yu, Qiang Luo, Haibao Wang, Yushu Lai. (2023). \u201cElectric Logistics Vehicle Path Planning Based on the Fusion of the Improved A-Star Algorithm and Dynamic Window Approach\u201d. World Electric Vehicle Journal, 14, 213","DOI":"10.3390\/wevj14080213"},{"key":"10.1016\/j.procs.2026.02.250_bib10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.3390\/wevj16030144","article-title":"\u201cResearch on the A* Algorithm Based on Adaptive Weights and Heuristic Reward Values.\u201d","volume":"16","author":"Xizheng","year":"2025","journal-title":"World Electric Vehicle Journal"},{"key":"10.1016\/j.procs.2026.02.250_bib11","doi-asserted-by":"crossref","unstructured":"Li Jiaoyang, Rum Wheeler, Koenig Sven. (2021). \u201cEECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding.\u201d In Proceedings of the 35th AAAI Conference on Artificial Intelligence\/33rd Conference on Innovative Applications of Artificial Intelligence\/11th Symposium on Educational Advances in Artificial Intelligence.","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"10.1016\/j.procs.2026.02.250_bib12","first-page":"1","article-title":"\u201cGreedy Priority-Based Search for Suboptimal Multi-Agent Path Finding.\u201d","volume":"16","author":"Shao-Hung","year":"2023","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"key":"10.1016\/j.procs.2026.02.250_bib13","unstructured":"Tan Jiaqi, Luo Yudong, Li Jiaoyang, Ma Hang. (2024). \u201cBenchmarking Large Neighborhood Search for Multi-Agent Path Finding.\u201d arXiv preprint arXiv:2407.09451."},{"key":"10.1016\/j.procs.2026.02.250_bib14","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","article-title":"\u201cConflict-based search for optimal multi-agent pathfinding.\u201d","volume":"219","author":"Guni","year":"2015","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.procs.2026.02.250_bib15","doi-asserted-by":"crossref","unstructured":"Wang Zhouran, Wen Jiayan, Lu Jingjing (2023).\u201d Improved CBS algorithm based on the idea of pre-planning.\u201d Proceedings of the SPIE","DOI":"10.1117\/12.2682558"},{"key":"10.1016\/j.procs.2026.02.250_bib16","doi-asserted-by":"crossref","unstructured":"Kottinger Justin, Almgor Shaull, Lahijanian Morteza. (2022) \u201cConflict-Based Search for Multi-Robot Motion Planning with Kinodynamic Constraints\u201d International Conference on Intelligent Robots and Systems (IROS)","DOI":"10.1109\/IROS47612.2022.9982018"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926003704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926003704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:28:24Z","timestamp":1775809704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050926003704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":16,"alternative-id":["S1877050926003704"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2026.02.250","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Low-Level Planner on Conflict-Based Search Efficiency in Multi-Agent Path Finding","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2026.02.250","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}