{"id":"https://openalex.org/W7148352290","doi":"https://doi.org/10.48550/arxiv.2604.00428","title":"Certificate-Driven Closed-Loop Multi-Agent Path Finding with Inheritable Factorization","display_name":"Certificate-Driven Closed-Loop Multi-Agent Path Finding with Inheritable Factorization","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148352290","doi":"https://doi.org/10.48550/arxiv.2604.00428"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.00428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00428","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2604.00428","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132790362","display_name":"Jiarui Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li, Jiarui","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132819708","display_name":"Runyu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Runyu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043524649","display_name":"Gioele Zardini","orcid":"https://orcid.org/0000-0002-6601-2237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zardini, Gioele","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5132790362"],"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.6862999796867371,"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.6862999796867371,"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/T11106","display_name":"Data Management and Algorithms","score":0.09269999712705612,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.026100000366568565,"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/scalability","display_name":"Scalability","score":0.6366999745368958},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5759000182151794},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.503600001335144},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5009999871253967},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47519999742507935},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4553000032901764},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.43709999322891235},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4284999966621399}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6672000288963318},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6366999745368958},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5759000182151794},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.503600001335144},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47519999742507935},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4553000032901764},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.41350001096725464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41200000047683716},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38519999384880066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3758000135421753},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.3127000033855438},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2727000117301941},{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C2780757406","wikidata":"https://www.wikidata.org/wiki/Q465837","display_name":"Skyline","level":2,"score":0.2563999891281128}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.00428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00428","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.00428","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00428","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.42169567942619324,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the 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],"coordination":[1],"in":[2,55,82,164],"automated":[3],"warehouses":[4],"and":[5,28,38,46,89,109],"logistics":[6],"is":[7,52],"commonly":[8],"modeled":[9],"as":[10,94],"the":[11,25,115,140,168],"Multi-Agent":[12],"Path":[13],"Finding":[14],"(MAPF)":[15],"problem.":[16],"Closed-loop":[17],"MAPF":[18],"algorithms":[19],"improve":[20],"scalability":[21],"by":[22],"planning":[23],"only":[24,119],"next":[26],"movement":[27],"replanning":[29],"online,":[30],"but":[31],"this":[32],"finite-horizon":[33],"viewpoint":[34],"can":[35],"be":[36],"shortsighted":[37],"makes":[39],"it":[40],"difficult":[41],"to":[42],"preserve":[43],"global":[44],"guarantees":[45],"exploit":[47],"compositional":[48],"structure.":[49],"This":[50],"issue":[51],"especially":[53],"visible":[54],"Anytime":[56],"Closed-Loop":[57],"Conflict-Based":[58,63,146],"Search":[59,64,147],"(ACCBS),":[60],"which":[61],"applies":[62],"(CBS)":[65],"over":[66],"dynamically":[67],"extended":[68],"finite":[69,73],"horizons":[70],"but,":[71],"under":[72],"computational":[74],"budgets,":[75],"may":[76],"terminate":[77],"with":[78],"short":[79],"active":[80],"prefixes":[81],"dense":[83,165],"instances.":[84],"We":[85],"introduce":[86],"certificate":[87,103],"trajectories":[88],"their":[90],"associated":[91],"fleet":[92],"budget":[93,126],"a":[95,105,110,129],"general":[96],"mechanism":[97],"for":[98],"filtering":[99],"closed-loop":[100],"updates.":[101],"A":[102],"provides":[104],"conflict-free":[106],"fallback":[107],"plan":[108],"monotone":[111],"upper":[112],"bound":[113],"on":[114,142,150],"remaining":[116],"cost;":[117],"accepting":[118],"certificate-improving":[120],"updates":[121],"yields":[122,144],"completeness.":[123],"The":[124],"same":[125],"information":[127],"induces":[128],"budget-limited":[130],"factorization":[131,170],"that":[132,154],"enables":[133],"global,":[134],"inheritable":[135],"decomposition":[136],"across":[137],"timesteps.":[138],"Instantiating":[139],"framework":[141],"ACCBS":[143],"Certificate-Driven":[145],"(CDCBS).":[148],"Experiments":[149],"benchmark":[151],"maps":[152],"show":[153],"CDCBS":[155],"achieves":[156],"more":[157],"consistent":[158],"solution":[159],"quality":[160],"than":[161],"ACCBS,":[162],"particularly":[163],"settings,":[166],"while":[167],"proposed":[169],"reduces":[171],"effective":[172],"group":[173],"size.":[174]},"counts_by_year":[],"updated_date":"2026-04-03T16:44:17.987007","created_date":"2026-04-03T00:00:00"}