{"id":"https://openalex.org/W7125963155","doi":"https://doi.org/10.1109/mrs66243.2025.11357251","title":"Bounded Sub-Optimal Algorithms for Teamwise Cooperative Multi-Agent Path Finding","display_name":"Bounded Sub-Optimal Algorithms for Teamwise Cooperative Multi-Agent Path Finding","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7125963155","doi":"https://doi.org/10.1109/mrs66243.2025.11357251"},"language":null,"primary_location":{"id":"doi:10.1109/mrs66243.2025.11357251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs66243.2025.11357251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5124109909","display_name":"Zhenlong Fang","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenlong Fang","raw_affiliation_strings":["Shanghai Jiao Tong University,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Shanghai,China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103273543","display_name":"Yilin Cai","orcid":"https://orcid.org/0000-0002-7778-9092"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yilin Cai","raw_affiliation_strings":["Georgia Institute of Technology,Atlanta,GA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,Atlanta,GA,USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Georgia Institute of Technology,Atlanta,GA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,Atlanta,GA,USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"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.60933216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9692999720573425,"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.9692999720573425,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.013199999928474426,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10524","display_name":"Traffic control and management","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/bounded-function","display_name":"Bounded function","score":0.816100001335144},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5946999788284302},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5921000242233276},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.4708999991416931},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4611000120639801},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4147000014781952}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.816100001335144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59579998254776},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5946999788284302},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5921000242233276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.524399995803833},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.4708999991416931},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4611000120639801},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4147000014781952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39500001072883606},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28139999508857727},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2637999951839447}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mrs66243.2025.11357251","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs66243.2025.11357251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1559954218","https://openalex.org/W1989407213","https://openalex.org/W2123030512","https://openalex.org/W2191404279","https://openalex.org/W2241553860","https://openalex.org/W2964997335","https://openalex.org/W2965850033","https://openalex.org/W3083743049","https://openalex.org/W3128804089","https://openalex.org/W3134901932","https://openalex.org/W3175724379","https://openalex.org/W3216907783","https://openalex.org/W4200140837","https://openalex.org/W4283798458","https://openalex.org/W4285249829","https://openalex.org/W4302557773","https://openalex.org/W4313148659","https://openalex.org/W4382866835","https://openalex.org/W4383172025","https://openalex.org/W4399175888","https://openalex.org/W4405786608","https://openalex.org/W4409364570","https://openalex.org/W4410217766","https://openalex.org/W4412508470"],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Teamwise":[1],"Cooperative":[2],"Path":[3],"Finding":[4],"(TC-MAPF)":[5],"seeks":[6],"collision-free":[7],"paths":[8],"for":[9,54,86,110,116,127],"the":[10,42,56,97],"agents":[11,20,100],"from":[12,58,93],"their":[13],"start":[14],"to":[15,34,81,129,146,153],"goal":[16],"locations.":[17],"In":[18],"addition,":[19],"are":[21],"grouped":[22],"into":[23],"multiple":[24,45,131],"teams,":[25],"and":[26,69,120,139,149],"each":[27,59],"team":[28],"has":[29,75],"its":[30],"own":[31],"objective":[32],"function":[33],"optimize.":[35],"TC-MAPF":[36,65],"arises":[37],"in":[38,134],"scenarios":[39],"such":[40,72],"as":[41,73,96,133],"coordination":[43],"of":[44,99],"autonomous":[46],"vehicles":[47,57],"at":[48],"a":[49,63,105],"signal-free":[50],"traffic":[51],"intersection,":[52],"where,":[53],"example,":[55],"direction":[60],"naturally":[61],"forms":[62],"team.":[64],"was":[66],"recently":[67],"studied":[68],"optimal":[70,89],"planners":[71,90],"TC-CBS":[74],"been":[76],"developed.":[77],"While":[78],"being":[79],"able":[80],"find":[82],"all":[83],"Pareto-optimal":[84],"solutions":[85],"TC-MAPF,":[87,111],"these":[88],"usually":[91],"suffer":[92],"limited":[94],"scalability":[95],"number":[98],"grows.":[101],"This":[102],"paper":[103],"develops":[104],"bounded":[106,123],"sub-optimal":[107,124],"planner":[108],"TC-CBS-TF":[109,138,150],"trading":[112],"off":[113],"solution":[114],"quality":[115],"scalability,":[117],"by":[118],"leveraging":[119],"extending":[121],"several":[122],"search":[125],"techniques":[126],"MAPF":[128],"handle":[130],"teams":[132],"TC-MAPF.":[135],"We":[136],"test":[137],"baselines":[140],"on":[141],"various":[142],"maps":[143],"with":[144],"up":[145,152],"50":[147],"agents,":[148],"achieves":[151],"68":[154],"%":[155],"higher":[156],"success":[157],"rates.":[158]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-29T00:00:00"}