{"id":"https://openalex.org/W4413014969","doi":"https://doi.org/10.1145/3759441.3759446","title":"DREAM: Distributed Regional Efficient Agent Management with LLMs for Online Multi-Agent Pathfinding","display_name":"DREAM: Distributed Regional Efficient Agent Management with LLMs for Online Multi-Agent Pathfinding","publication_year":2025,"publication_date":"2025-08-04","ids":{"openalex":"https://openalex.org/W4413014969","doi":"https://doi.org/10.1145/3759441.3759446"},"language":"en","primary_location":{"id":"doi:10.1145/3759441.3759446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3759441.3759446","pdf_url":null,"source":{"id":"https://openalex.org/S50071195","display_name":"ACM SIGOPS Operating Systems Review","issn_l":"0163-5980","issn":["0163-5980","1943-586X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGOPS Operating Systems Review","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101833239","display_name":"Rui Yang","orcid":"https://orcid.org/0000-0003-3525-1726"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rui Yang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5119231240","display_name":"Rajiv Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajiv Gupta","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101833239"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11259133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"1","first_page":"24","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9980000257492065,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"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/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.8008123636245728},{"id":"https://openalex.org/keywords/dream","display_name":"Dream","score":0.691986620426178},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.41730996966362},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.394100546836853},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.2242826521396637},{"id":"https://openalex.org/keywords/neuroscience","display_name":"Neuroscience","score":0.20544779300689697}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8008123636245728},{"id":"https://openalex.org/C2781095916","wikidata":"https://www.wikidata.org/wiki/Q36348","display_name":"Dream","level":2,"score":0.691986620426178},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.41730996966362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.394100546836853},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.2242826521396637},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.20544779300689697},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3759441.3759446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3759441.3759446","pdf_url":null,"source":{"id":"https://openalex.org/S50071195","display_name":"ACM SIGOPS Operating Systems Review","issn_l":"0163-5980","issn":["0163-5980","1943-586X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGOPS Operating Systems Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1510564526","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2123030512","https://openalex.org/W2135125135","https://openalex.org/W2155313135","https://openalex.org/W2191404279","https://openalex.org/W2399153727","https://openalex.org/W2406007181","https://openalex.org/W2579451340","https://openalex.org/W2744979297","https://openalex.org/W2808475207","https://openalex.org/W2809708768","https://openalex.org/W2886374915","https://openalex.org/W2892258706","https://openalex.org/W2903998385","https://openalex.org/W2905054495","https://openalex.org/W2949992533","https://openalex.org/W2964945728","https://openalex.org/W2966875457","https://openalex.org/W3011643348","https://openalex.org/W3025088990","https://openalex.org/W3037524112","https://openalex.org/W3091239670","https://openalex.org/W3103635569","https://openalex.org/W3187649900","https://openalex.org/W4310269644","https://openalex.org/W4366999541","https://openalex.org/W4378499172","https://openalex.org/W4383994281","https://openalex.org/W4387210286","https://openalex.org/W4389523767","https://openalex.org/W4393967396","https://openalex.org/W6680234699","https://openalex.org/W6732989195","https://openalex.org/W6757169448","https://openalex.org/W6757549001","https://openalex.org/W6758754608","https://openalex.org/W6766431357","https://openalex.org/W6768746379","https://openalex.org/W6780106595","https://openalex.org/W6858692988","https://openalex.org/W6875302558"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1762480892","https://openalex.org/W1967962134"],"abstract_inverted_index":{"In":[0],"this":[1,171,183,200],"paper,":[2],"we":[3],"introduce":[4],"DREAM,":[5],"Distributed":[6],"Regional":[7],"Efficient":[8],"Agent":[9],"Management,":[10],"a":[11,98,188],"novel":[12,56,172],"method":[13],"using":[14],"Large":[15],"Language":[16],"Models":[17],"(LLMs)":[18],"to":[19,67,115,145,186],"solve":[20],"Multi-Agent":[21],"Pathfinding":[22],"(MAPF)":[23],"problems":[24],"in":[25,48,58,168,211],"complicated":[26],"environments.":[27],"Our":[28,152],"approach":[29,184,201],"splits":[30],"up":[31,204],"the":[32,70,148,163,177,205],"area":[33],"into":[34,192],"various":[35],"local":[36],"regions":[37],"and":[38,50,65,91,157,179,215],"an":[39,129],"LLM":[40,112,139],"agent":[41],"handles":[42],"each":[43],"one":[44],"of":[45,73,165,182,195,207],"them":[46],"intelligently":[47],"reasoning":[49,166],"decision":[51],"making.":[52],"We":[53],"present":[54],"some":[55],"designs":[57],"our":[59],"system:":[60],"1)":[61],"Adaptive":[62],"region":[63],"management":[64,132],"allocation":[66],"regions,":[68],"supporting":[69],"dynamic":[71],"partitioning":[72],"different":[74],"complexity":[75],"or":[76],"density":[77],"areas.":[78],"2)":[79],"The":[80],"multi-level":[81],"LLM-driven":[82],"agents":[83,140],"collaboration":[84],"framework":[85],"that":[86],"enables":[87],"peer-peer,":[88],"interLLM":[89],"coordination":[90,222],"controls":[92],"for":[93,225],"effective":[94],"monitoring":[95],"intelligence":[96],"across":[97],"hierarchical":[99,180],"path":[100],"planning":[101,118],"organization":[102],"hierarchy":[103],"level":[104],"ensures":[105],"autonomy":[106],"whilst":[107],"improving":[108],"overall":[109],"understanding":[110],"among":[111],"agents,":[113],"leading":[114],"more":[116,212],"accurate":[117],"decisions":[119],"from":[120],"real-time":[121],"analysis.":[122],"(3)":[123],"Failurereflection-":[124],"replanning":[125],"mechanism":[126],"integrated":[127],"within":[128],"individual":[130],"LLM's":[131],"scope":[133],"eventually":[134],"results":[135],"continual":[136],"improvement.":[137],"(4)":[138],"can":[141],"do":[142],"function":[143],"calling":[144],"interact":[146],"with":[147,170],"typical":[149],"algorithms":[150],"also.":[151],"system":[153],"successfully":[154],"processes":[155],"complex":[156,213],"large-scale":[158],"MAPF":[159,190],"scenarios":[160],"by":[161],"merging":[162],"higher-orderality":[164],"capabilities":[167],"LLMs":[169],"distributed":[173,178],"framework.":[174],"For":[175],"instance,":[176],"nature":[181],"helps":[185],"break":[187],"high-dimensional":[189],"problem":[191],"several":[193],"groups":[194],"smaller":[196],"dimension.":[197],"As":[198],"such,":[199],"also":[202],"opens":[203],"development":[206],"AI":[208],"language":[209],"models":[210],"robotics":[214],"logistics":[216],"scenarios,":[217],"potentially":[218],"changing":[219],"how":[220],"multi-agent":[221],"is":[223],"done":[224],"actual":[226],"situations.":[227]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}