{"id":"https://openalex.org/W7140072588","doi":"https://doi.org/10.1016/j.procs.2026.02.250","title":"Low-Level Planner on Conflict-Based Search Efficiency in Multi-Agent Path Finding","display_name":"Low-Level Planner on Conflict-Based Search Efficiency in Multi-Agent Path Finding","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7140072588","doi":"https://doi.org/10.1016/j.procs.2026.02.250"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2026.02.250","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.02.250","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2026.02.250","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130344404","display_name":"Marco Ricci","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Ricci","raw_affiliation_strings":["Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055011762","display_name":"R. Accorsi","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Riccardo Accorsi","raw_affiliation_strings":["Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049945927","display_name":"Ilaria Battarra","orcid":"https://orcid.org/0000-0002-8000-5893"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ilaria Battarra","raw_affiliation_strings":["Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083420372","display_name":"Giacomo Lupi","orcid":"https://orcid.org/0000-0003-3218-9154"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giacomo Lupi","raw_affiliation_strings":["Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057802256","display_name":"Riccardo Manzini","orcid":"https://orcid.org/0000-0003-1142-9139"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Riccardo Manzini","raw_affiliation_strings":["Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Alma Mater Studiorum Universit\u00e0 di Bologna, Viale del Risorgimento, 2 - 40136 Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5130344404"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93147388,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"277","issue":null,"first_page":"2125","last_page":"2134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9169999957084656,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9169999957084656,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.023600000888109207,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.006200000178068876,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.8115000128746033},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6341000199317932},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.579800009727478},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5787000060081482},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5753999948501587},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5649999976158142}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8815000057220459},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.8115000128746033},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6341000199317932},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.579800009727478},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5787000060081482},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5753999948501587},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5649999976158142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5184000134468079},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C91370436","wikidata":"https://www.wikidata.org/wiki/Q5608616","display_name":"Grid method multiplication","level":3,"score":0.31470000743865967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2994000017642975},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.29249998927116394},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2890999913215637},{"id":"https://openalex.org/C10485038","wikidata":"https://www.wikidata.org/wiki/Q48996162","display_name":"Hyperparameter optimization","level":3,"score":0.26489999890327454},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2632000148296356},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2605000138282776}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2026.02.250","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.02.250","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2026.02.250","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.02.250","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1989407213","https://openalex.org/W2964997335","https://openalex.org/W3175724379","https://openalex.org/W3199982239","https://openalex.org/W4313005818","https://openalex.org/W4385732716","https://openalex.org/W4388010330","https://openalex.org/W4391251385","https://openalex.org/W4394567380","https://openalex.org/W4396215678","https://openalex.org/W4408154868"],"related_works":[],"abstract_inverted_index":{"Research":[0],"on":[1,6,10],"MAPF":[2],"has":[3,25],"primarily":[4],"focused":[5],"high-level":[7,38],"planners":[8,24,109],"and":[9,40,66,87,101,112,141,196],"the":[11,20,71,130,147,155,160,187,198],"comparisons":[12],"of":[13,22,149,157],"alternative":[14],"algorithms":[15],"in":[16,90,119,129,154,190,203],"heterogeneous":[17],"settings,":[18],"while":[19,107],"role":[21],"low-level":[23,191],"received":[26],"little":[27],"attention.":[28],"These":[29,181],"components":[30],"are":[31],"essential":[32],"for":[33,175,194],"generating":[34],"agent":[35,85],"paths":[36],"under":[37],"constraints,":[39],"their":[41],"proper":[42],"selection":[43,193],"can":[44],"significantly":[45,179],"affect":[46],"performance.":[47],"This":[48],"work":[49],"addresses":[50],"this":[51],"gap":[52],"by":[53,165],"comparing":[54],"four":[55],"A*-based":[56],"variants":[57],"(Uniform":[58],"Cost":[59],"Search":[60],"(UCS),":[61],"standard":[62],"A*,":[63,65],"Weighted":[64,68,123],"Adaptive":[67,122],"A*)":[69],"within":[70],"CBS":[72,195],"framework.":[73],"The":[74,93],"comparison":[75],"is":[76,163],"carried":[77],"out":[78],"through":[79],"a":[80],"multi-scenario":[81],"analysis":[82],"with":[83],"varying":[84],"densities":[86],"obstacle":[88],"configurations":[89],"grid-based":[91],"environments.":[92,207],"evaluation":[94],"includes":[95],"computational":[96,139],"efficiency,":[97],"conflict":[98,143],"resolution":[99],"capability,":[100],"path":[102],"quality.":[103],"Results":[104],"indicate":[105],"that":[106],"weighted":[108],"reduce":[110],"runtime":[111],"node":[113],"expansions,":[114],"they":[115],"generate":[116],"more":[117,172],"conflicts":[118],"complex":[120],"scenarios.":[121],"A*":[124],"proves":[125],"effective":[126],"overall":[127,168],"performance":[128,162],"empty":[131],"grid":[132],"environment,":[133],"combining":[134],"high":[135],"success":[136],"rates,":[137],"low":[138],"effort,":[140],"moderate":[142],"levels,":[144],"even":[145],"as":[146],"number":[148],"agents":[150],"grows.":[151],"In":[152],"contrast,":[153],"case":[156],"random":[158],"obstacles,":[159],"best":[161],"achieved":[164],"1.5wA*,":[166],"although":[167],"planner":[169,192],"performances":[170],"become":[171],"comparable,":[173],"except":[174],"UCS,":[176],"which":[177],"performs":[178],"worse.":[180],"findings":[182],"provide":[183],"actionable":[184],"insights":[185],"into":[186],"trade-offs":[188],"involved":[189],"pave":[197],"way":[199],"to":[200],"its":[201],"application":[202],"operational":[204],"time-based":[205],"logistic":[206]},"counts_by_year":[],"updated_date":"2026-03-24T06:04:31.470712","created_date":"2026-03-24T00:00:00"}