{"id":"https://openalex.org/W7160945236","doi":"https://doi.org/10.48550/arxiv.2605.10917","title":"Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schr\u00f6dinger Bridges","display_name":"Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schr\u00f6dinger Bridges","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160945236","doi":"https://doi.org/10.48550/arxiv.2605.10917"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10917","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.10917","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122863766","display_name":"Usman A. Khan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khan, Usman A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085289306","display_name":"Joseph W. Durham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Durham, Joseph W.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.6327999830245972,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.6327999830245972,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.156700000166893,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.08110000193119049,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7019000053405762},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5618000030517578},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4666999876499176},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4277999997138977},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.42010000348091125},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.39309999346733093},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.39250001311302185},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3889999985694885},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.3792000114917755}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7019000053405762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5834000110626221},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5618000030517578},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49399998784065247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4666999876499176},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4277999997138977},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4189000129699707},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3792000114917755},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3416000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3287000060081482},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3107999861240387},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.27950000762939453},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C117797892","wikidata":"https://www.wikidata.org/wiki/Q286363","display_name":"Shadow (psychology)","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C154018700","wikidata":"https://www.wikidata.org/wiki/Q898323","display_name":"Path integral formulation","level":3,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10917","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.10917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10917","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":"Preprint"},"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":{"We":[0,26],"consider":[1],"anonymous":[2,66],"multi-agent":[3],"path":[4],"finding":[5],"(MAPF)":[6],"where":[7],"a":[8,17,22,34,56,108,143,147,155,159,172],"set":[9,18],"of":[10,19,37,129,184],"robots":[11],"is":[12,76],"tasked":[13],"to":[14,16,55,100,125,157],"travel":[15],"targets":[20],"on":[21,64],"finite,":[23],"connected":[24],"graph.":[25],"show":[27,118],"that":[28,87,119,133,151,164],"MAPF":[29],"can":[30],"be":[31],"cast":[32,104],"as":[33,154],"special":[35],"class":[36],"multi-marginal":[38],"optimal":[39],"transport":[40,150],"(MMOT)":[41],"problems":[42],"with":[43],"an":[44,126,135],"underlying":[45],"Markovian":[46],"structure,":[47],"under":[48,71],"which":[49,72],"the":[50,65,73,98,105,120,130,180,185],"exponentially":[51],"large":[52],"MMOT":[53,132],"collapses":[54],"linear":[57],"program":[58],"(LP)":[59],"polynomial":[60],"in":[61,91,107,167,175],"size.":[62],"Focusing":[63],"setting,":[67],"we":[68,103,117,152],"establish":[69],"conditions":[70],"corresponding":[74,131],"LP":[75,161],"feasible,":[77],"totally":[78],"unimodular,":[79],"and":[80,94,162,182],"consequently,":[81],"yields":[82],"min-cost,":[83],"integral":[84,169],"$(\\{0,1\\})$":[85],"transports":[86,170],"do":[88],"not":[89],"overlap":[90],"both":[92],"space":[93],"time.":[95],"To":[96],"adapt":[97],"approach":[99],"large-scale":[101],"problems,":[102],"MAPF-MMOT":[106],"probabilistic":[109,144],"framework":[110],"via":[111],"Schr\u00f6dinger":[112,121,140],"bridges.":[113],"Under":[114],"standard":[115],"assumptions,":[116],"bridge":[122],"formulation":[123],"reduces":[124],"entropic":[127],"regularization":[128],"admits":[134],"iterative":[136],"Sinkhorn-type":[137],"solution.":[138],"The":[139],"bridge,":[141],"being":[142],"framework,":[145],"provides":[146],"shadow":[148],"(fractional)":[149],"use":[153],"template":[156],"solve":[158],"reduced":[160],"demonstrate":[163],"it":[165],"results":[166],"near-optimal,":[168],"at":[171],"significant":[173],"reduction":[174],"complexity.":[176],"Extensive":[177],"experiments":[178],"highlight":[179],"optimality":[181],"scalability":[183],"proposed":[186],"approaches.":[187]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}