{"id":"https://openalex.org/W7137871038","doi":"https://doi.org/10.1609/aaai.v40i35.40205","title":"Multi-Agent Corridor Reasoning for Multi-Agent Path Finding","display_name":"Multi-Agent Corridor Reasoning for Multi-Agent Path Finding","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137871038","doi":"https://doi.org/10.1609/aaai.v40i35.40205"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i35.40205","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i35.40205","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i35.40205","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024903554","display_name":"Yiran Ni","orcid":"https://orcid.org/0000-0001-6901-2980"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiran Ni","raw_affiliation_strings":["Zhejiang University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039604763","display_name":"Deshi Ye","orcid":"https://orcid.org/0000-0002-4764-1847"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Deshi Ye","raw_affiliation_strings":["Zhejiang University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08903134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"35","first_page":"29617","last_page":"29624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9667999744415283,"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.9667999744415283,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.002199999988079071,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.0020000000949949026,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/semaphore","display_name":"Semaphore","score":0.9538000226020813},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7659000158309937},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7293999791145325},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6086000204086304},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5989999771118164},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5726000070571899},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5724999904632568}],"concepts":[{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.9538000226020813},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7659000158309937},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7293999791145325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6880000233650208},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5726000070571899},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5724999904632568},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.4611000120639801},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42809998989105225},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37400001287460327},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3012000024318695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27649998664855957},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i35.40205","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i35.40205","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/40205","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/40205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i35.40205","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i35.40205","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Multi-Agent":[1],"Path":[2],"Finding":[3],"(MAPF)":[4],"problem":[5],"is":[6],"a":[7,75,88],"computationally":[8],"challenging":[9],"task":[10],"that":[11,46,96],"involves":[12],"coordinating":[13],"collision-free":[14],"trajectories":[15],"for":[16],"multiple":[17,53],"cooperative":[18],"agents.":[19],"Although":[20],"existing":[21],"methods":[22],"address":[23],"corridor":[24,63,77,85],"symmetry,":[25],"where":[26],"agents":[27,54],"encounter":[28],"repeated":[29,59],"bidirectional":[30],"conflicts":[31],"in":[32,87],"constrained":[33],"environments,":[34],"they":[35],"typically":[36],"focus":[37],"exclusively":[38],"on":[39,129],"pairwise":[40,48],"agent":[41],"interactions.":[42],"Our":[43,92],"observations":[44],"reveal":[45],"such":[47],"symmetry":[49,86],"frequently":[50],"arises":[51],"when":[52],"traverse":[55],"shared":[56],"corridors,":[57],"necessitating":[58],"applications":[60],"of":[61,82,105],"the":[62,100],"reasoning":[64,78],"technology":[65,80,98,112],"over":[66],"extended":[67],"durations.":[68],"To":[69],"overcome":[70],"this":[71,97],"limitation,":[72],"we":[73,115],"propose":[74],"multi-agent":[76],"(MAC)":[79],"capable":[81],"resolving":[83],"group-level":[84],"single":[89],"optimization":[90],"step.":[91],"theoretical":[93],"analysis":[94],"demonstrates":[95],"preserves":[99],"completeness":[101],"and":[102,124,138],"optimality":[103],"guarantees":[104],"Conflict-Based":[106],"Search":[107],"(CBS).":[108],"By":[109],"integrating":[110],"MAC":[111],"with":[113,126],"CBSH-RTC,":[114],"developed":[116],"CBSH-MACRT,":[117],"which":[118],"significantly":[119],"outperforms":[120],"state-of-the-art":[121],"algorithms":[122],"(CBSH-RTC":[123],"CBSH":[125],"mutex":[127],"propagation)":[128],"standardized":[130],"MAPF":[131],"benchmarks,":[132],"improving":[133],"success":[134],"rates":[135],"by":[136,141],"8\u201340%":[137],"cutting":[139],"runtimes":[140],"14\u201367%.":[142]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-18T00:00:00"}