{"id":"https://openalex.org/W7117254762","doi":"https://doi.org/10.1109/tase.2025.3648677","title":"Decomposing the Multi-Agent Pathfinding Problem for Large Agents: Accelerating Solving Without Compromising Solvability","display_name":"Decomposing the Multi-Agent Pathfinding Problem for Large Agents: Accelerating Solving Without Compromising Solvability","publication_year":2025,"publication_date":"2025-12-25","ids":{"openalex":"https://openalex.org/W7117254762","doi":"https://doi.org/10.1109/tase.2025.3648677"},"language":null,"primary_location":{"id":"doi:10.1109/tase.2025.3648677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2025.3648677","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065211721","display_name":"Zhuo Yao","orcid":"https://orcid.org/0000-0001-7532-4200"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhuo Yao","raw_affiliation_strings":["School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-7532-4200","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121298308","display_name":"Wei Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Wang","raw_affiliation_strings":["School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-7215-7627","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065647893","display_name":"Yueri Cai","orcid":"https://orcid.org/0000-0003-4494-6300"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yueri Cai","raw_affiliation_strings":["School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0003-4494-6300","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52454496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"1994","last_page":"2019"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9447000026702881,"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.9447000026702881,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.008299999870359898,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.004999999888241291,"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/decomposition","display_name":"Decomposition","score":0.6146000027656555},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5871999859809875},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.489300012588501},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4471000134944916},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44699999690055847},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4052000045776367},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.40400001406669617},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.4018999934196472}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6146000027656555},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5864999890327454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5317000150680542},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.489300012588501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.484499990940094},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4471000134944916},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44699999690055847},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4052000045776367},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.40400001406669617},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.4018999934196472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35249999165534973},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3091000020503998},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C2780771206","wikidata":"https://www.wikidata.org/wiki/Q3271761","display_name":"Safeguard","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C2779279789","wikidata":"https://www.wikidata.org/wiki/Q1060390","display_name":"Overhead crane","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2025.3648677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2025.3648677","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1652862293","display_name":null,"funder_award_id":"91748101","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1551562380","https://openalex.org/W1989407213","https://openalex.org/W2118382442","https://openalex.org/W2135125135","https://openalex.org/W2155313135","https://openalex.org/W2398043204","https://openalex.org/W2809051682","https://openalex.org/W2809102580","https://openalex.org/W2903837854","https://openalex.org/W2903998385","https://openalex.org/W2913211223","https://openalex.org/W2914296650","https://openalex.org/W2964997335","https://openalex.org/W2966625830","https://openalex.org/W3079592479","https://openalex.org/W3095606244","https://openalex.org/W4244044799","https://openalex.org/W4283795314","https://openalex.org/W4312706257","https://openalex.org/W4367281433","https://openalex.org/W4382202651","https://openalex.org/W4382866962","https://openalex.org/W4399261773","https://openalex.org/W4403021882","https://openalex.org/W4407555873","https://openalex.org/W4413371277"],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Path":[1],"Finding":[2],"(MAPF)":[3],"has":[4],"been":[5],"widely":[6],"studied":[7],"in":[8,25,34,69,94],"recent":[9],"years.":[10],"However,":[11],"most":[12],"existing":[13],"MAPF":[14,72,110,166],"algorithms":[15],"assume":[16],"that":[17,107,139,150],"an":[18],"agent":[19],"occupies":[20],"only":[21],"a":[22,26,105,109,135,143],"single":[23],"cell":[24],"grid-based":[27],"map.":[28],"This":[29,100,117],"assumption":[30],"limits":[31],"their":[32],"applicability":[33],"many":[35],"real-world":[36],"domains":[37],"where":[38],"agents":[39,68,75,86],"have":[40,174],"geometric":[41,98],"shapes":[42],"rather":[43],"than":[44],"being":[45],"point-like.":[46],"These":[47],"agents,":[48],"which":[49],"can":[50],"occupy":[51],"multiple":[52],"cells":[53],"simultaneously,":[54],"are":[55],"referred":[56],"to":[57,120],"as":[58,82],"\u201clarge\u201d":[59],"agents.":[60,99],"When":[61],"considering":[62],"the":[63,77,83,91,122,161,176,180],"shape":[64],"and":[65,159],"size":[66],"of":[67,85,90,164,183],"MAPF,":[70],"i.e.,":[71],"for":[73,179],"large":[74],"(LA-MAPF),":[76],"computational":[78],"complexity":[79],"increases":[80,160],"significantly":[81],"number":[84],"increases,":[87],"primarily":[88],"because":[89],"increased":[92],"overhead":[93],"conflict":[95],"detection":[96],"between":[97],"paper":[101],"introduces":[102],"Layered":[103,181],"Decomposition,":[104],"method":[106,153],"decomposes":[108],"problem":[111],"into":[112],"subproblems":[113,141],"through":[114],"iterative":[115],"bipartitioning.":[116],"approach":[118],"aims":[119],"reduce":[121],"time":[123,157],"cost":[124,158],"when":[125],"solving":[126],"LA-MAPF":[127,152,184],"problems.":[128],"To":[129,169],"address":[130],"unsolvable":[131],"subproblems,":[132],"we":[133,173],"propose":[134],"solvability":[136],"safeguard":[137],"mechanism":[138],"merges":[140],"until":[142],"solvable":[144],"subproblem":[145],"is":[146],"formed.":[147],"Experiments":[148],"show":[149],"our":[151],"with":[154],"decomposition":[155,182],"reduces":[156],"success":[162],"rate":[163],"state-of-art":[165],"methods":[167],"significantly.":[168],"facilitate":[170],"further":[171],"research,":[172],"made":[175],"source":[177],"code":[178],"publicly":[185],"available<sup":[186],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[187],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>.":[188]},"counts_by_year":[],"updated_date":"2026-01-17T23:10:49.606395","created_date":"2025-12-25T00:00:00"}