{"id":"https://openalex.org/W7147098295","doi":"https://doi.org/10.48550/arxiv.2603.26684","title":"Decoupling Geometric Planning and Execution in Scalable Multi-Agent Path Finding","display_name":"Decoupling Geometric Planning and Execution in Scalable Multi-Agent Path Finding","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7147098295","doi":"https://doi.org/10.48550/arxiv.2603.26684"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26684","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26684","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26684","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132653038","display_name":"Fernando Salanova","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salanova, Fernando","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Montijano, Eduardo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Montijano, Eduardo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Mahulea, Cristian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahulea, Cristian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9641000032424927,"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.9641000032424927,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/scalability","display_name":"Scalability","score":0.6995999813079834},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5058000087738037},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.45260000228881836},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.43970000743865967},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4318999946117401},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.42879998683929443},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4235000014305115},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4156000018119812},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.412200003862381}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6995999813079834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6771000027656555},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48730000853538513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47290000319480896},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.43970000743865967},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4156000018119812},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.412200003862381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33570000529289246},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3246999979019165},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206000030040741},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.27810001373291016},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.25519999861717224},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26684","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26684","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26684","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26684","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Path":[1],"Finding":[2],"(MAPF)":[3],"requires":[4],"collision-free":[5],"trajectories":[6],"for":[7,78],"multiple":[8],"agents":[9,67,130],"on":[10,29,71,122,147],"a":[11,46,97,143],"shared":[12],"graph,":[13],"often":[14],"with":[15,69,126,136],"the":[16,20,59,72,94,103,133,150,156],"objective":[17],"of":[18,155],"minimizing":[19],"sum-of-costs":[21],"(SOC).":[22],"Many":[23],"optimal":[24],"and":[25,32,111,118,141],"bounded-suboptimal":[26],"solvers":[27],"rely":[28],"time-expanded":[30],"models":[31],"centralized":[33],"conflict":[34,56],"resolution,":[35],"which":[36],"limits":[37],"scalability":[38],"in":[39],"large":[40],"or":[41],"dense":[42],"instances.":[43],"We":[44],"propose":[45],"hybrid":[47],"prioritized":[48],"framework":[49],"that":[50,132],"separates":[51],"\\emph{geometric":[52],"planning}":[53],"from":[54],"\\emph{execution-time":[55],"resolution}.":[57],"In":[58,93],"first":[60],"stage,":[61,96],"\\emph{Geometric":[62],"Conflict":[63],"Preemption":[64],"(GCP)}":[65],"plans":[66],"sequentially":[68],"A*":[70],"original":[73],"graph":[74],"while":[75],"inflating":[76],"costs":[77],"transitions":[79],"entering":[80],"vertices":[81],"used":[82],"by":[83],"higher-priority":[84],"paths,":[85],"encouraging":[86],"spatial":[87],"detours":[88],"without":[89],"explicit":[90],"time":[91],"reasoning.":[92],"second":[95],"\\emph{Decentralized":[98],"Local":[99],"Controller":[100],"(DLC)}":[101],"executes":[102],"geometric":[104,151],"paths":[105],"using":[106],"per-vertex":[107],"FIFO":[108],"authorization":[109],"queues":[110],"inserts":[112],"wait":[113],"actions":[114],"to":[115,128],"avoid":[116],"vertex":[117],"edge-swap":[119],"conflicts.":[120],"Experiments":[121],"standard":[123],"benchmark":[124],"maps":[125],"up":[127],"1000":[129],"show":[131],"method":[134],"scales":[135],"an":[137],"near-linear":[138],"runtime":[139],"trend":[140],"attains":[142],"100\\%":[144],"success":[145],"rate":[146],"instances":[148],"satisfying":[149],"feasibility":[152],"assumption.":[153],"Page":[154],"project:":[157],"https://sites.google.com/unizar.es/multi-agent-path-finding/home":[158]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}