{"id":"https://openalex.org/W7151868044","doi":"https://doi.org/10.48550/arxiv.2604.05416","title":"Multi-Agent Pathfinding with Non-Unit Integer Edge Costs via Enhanced Conflict-Based Search and Graph Discretization","display_name":"Multi-Agent Pathfinding with Non-Unit Integer Edge Costs via Enhanced Conflict-Based Search and Graph Discretization","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7151868044","doi":"https://doi.org/10.48550/arxiv.2604.05416"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.05416","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05416","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.2604.05416","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051780992","display_name":"Hongkai Fan","orcid":"https://orcid.org/0009-0003-7354-9360"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fan, Hongkai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133185452","display_name":"Qinjing Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Qinjing","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100750387","display_name":"Bo Ouyang","orcid":"https://orcid.org/0000-0003-2378-981X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ouyang, Bo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133166283","display_name":"Yaonan Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yaonan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133175946","display_name":"Zhi Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Zhi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066935918","display_name":"Jiawen He","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"He, Jiawen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133228013","display_name":"Zheng Fang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang, Zheng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5051780992"],"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.9319000244140625,"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.9319000244140625,"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/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.006399999838322401,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.003800000064074993,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5544000267982483},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.4975000023841858},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4869999885559082},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.48399999737739563},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47699999809265137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4742000102996826},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4616999924182892},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4442000091075897},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3944999873638153}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5946999788284302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5626999735832214},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5544000267982483},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.4975000023841858},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4869999885559082},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.48399999737739563},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4742000102996826},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4521999955177307},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4002000093460083},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3919000029563904},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34929999709129333},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.27639999985694885},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2596000134944916}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.05416","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05416","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.2604.05416","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05416","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],"Pathfinding":[1],"(MAPF)":[2],"plays":[3],"a":[4,63,75,120,133],"critical":[5],"role":[6],"in":[7,146],"various":[8],"domains.":[9],"Traditional":[10],"MAPF":[11,30,65],"methods":[12,145],"typically":[13],"assume":[14],"unit":[15],"edge":[16,37,125],"costs":[17,34,38,72,126],"and":[18,39,102,130,148],"single-timestep":[19],"actions,":[20,41],"which":[21],"limit":[22],"their":[23],"applicability":[24],"to":[25,31,48],"real-world":[26],"scenarios.":[27,154],"MAPFR":[28],"extends":[29],"handle":[32],"non-unit":[33,70,124],"with":[35,69,132],"real-valued":[36],"continuous-time":[40],"but":[42],"its":[43],"geometric":[44],"collision":[45],"model":[46],"leads":[47],"an":[49,93,103],"unbounded":[50],"state":[51,77],"space":[52,78],"that":[53,73,127,140],"compromises":[54],"solver":[55],"efficiency.":[56],"In":[57],"this":[58],"paper,":[59],"we":[60,90,112],"propose":[61,113],"MAPFZ,":[62],"novel":[64],"variant":[66],"on":[67],"graphs":[68],"integer":[71],"preserves":[74],"finite":[76],"while":[79],"offering":[80],"improved":[81,104],"realism":[82],"over":[83],"classical":[84],"MAPF.":[85],"To":[86],"solve":[87],"MAPFZ":[88],"efficiently,":[89],"develop":[91],"CBS-NIC,":[92],"enhanced":[94],"Conflict-Based":[95],"Search":[96],"framework":[97],"incorporating":[98],"time-interval-based":[99],"conflict":[100],"detection":[101],"Safe":[105],"Interval":[106],"Path":[107],"Planning":[108],"(SIPP)":[109],"algorithm.":[110],"Additionally,":[111],"Bayesian":[114],"Optimization":[115],"for":[116,123],"Graph":[117],"Design":[118],"(BOGD),":[119],"discretization":[121],"method":[122],"balances":[128],"efficiency":[129],"accuracy":[131],"sub-linear":[134],"regret":[135],"bound.":[136],"Extensive":[137],"experiments":[138],"demonstrate":[139],"our":[141],"approach":[142],"outperforms":[143],"state-of-the-art":[144],"runtime":[147],"success":[149],"rate":[150],"across":[151],"diverse":[152],"benchmark":[153]},"counts_by_year":[],"updated_date":"2026-04-09T06:13:59.934233","created_date":"2026-04-09T00:00:00"}