{"id":"https://openalex.org/W4391549658","doi":"https://doi.org/10.1109/mrs60187.2023.10416794","title":"Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree","display_name":"Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree","publication_year":2023,"publication_date":"2023-12-04","ids":{"openalex":"https://openalex.org/W4391549658","doi":"https://doi.org/10.1109/mrs60187.2023.10416794"},"language":"en","primary_location":{"id":"doi:10.1109/mrs60187.2023.10416794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs60187.2023.10416794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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/A5101517921","display_name":"Yimin Tang","orcid":"https://orcid.org/0000-0002-5091-9926"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yimin Tang","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101499733","display_name":"Jiaoyang Li","orcid":"https://orcid.org/0000-0002-0032-1758"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiaoyang Li","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087505541","display_name":"Katia Sycara","orcid":"https://orcid.org/0000-0001-5635-1406"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katia Sycara","raw_affiliation_strings":["Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.4566,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88792079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9932000041007996,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9843000173568726,"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/search-tree","display_name":"Search tree","score":0.7910910844802856},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7624256610870361},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.706745982170105},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6702285408973694},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6615906953811646},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.48732122778892517},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48487672209739685},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4540293514728546},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4427383840084076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4312365651130676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39918410778045654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.207167387008667},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09730693697929382}],"concepts":[{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.7910910844802856},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7624256610870361},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.706745982170105},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6702285408973694},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6615906953811646},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.48732122778892517},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48487672209739685},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4540293514728546},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4427383840084076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4312365651130676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39918410778045654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.207167387008667},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09730693697929382},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mrs60187.2023.10416794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs60187.2023.10416794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306185","display_name":"Richard King Mellon Foundation","ror":"https://ror.org/03qevzg44"},{"id":"https://openalex.org/F4320316514","display_name":"Arm","ror":"https://ror.org/04mmhzs81"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W152613852","https://openalex.org/W177987302","https://openalex.org/W1537272759","https://openalex.org/W1551562380","https://openalex.org/W1989407213","https://openalex.org/W1992340583","https://openalex.org/W2011087880","https://openalex.org/W2137514195","https://openalex.org/W2141461755","https://openalex.org/W2191404279","https://openalex.org/W2222512263","https://openalex.org/W2314323423","https://openalex.org/W2539586701","https://openalex.org/W2541273873","https://openalex.org/W2808475207","https://openalex.org/W2914296650","https://openalex.org/W2963382051","https://openalex.org/W2964997335","https://openalex.org/W2991337620","https://openalex.org/W3037164939","https://openalex.org/W3105864617","https://openalex.org/W3158757609","https://openalex.org/W3171557341","https://openalex.org/W3206820044","https://openalex.org/W4205985266","https://openalex.org/W4213060883","https://openalex.org/W4285022255","https://openalex.org/W4312728348","https://openalex.org/W4312785523","https://openalex.org/W4367281433","https://openalex.org/W4377246895","https://openalex.org/W6603775515","https://openalex.org/W6680701603","https://openalex.org/W6721983959","https://openalex.org/W6763121698"],"related_works":["https://openalex.org/W2037710955","https://openalex.org/W3098335909","https://openalex.org/W2166539025","https://openalex.org/W2789480285","https://openalex.org/W3094979732","https://openalex.org/W2810821464","https://openalex.org/W2402589461","https://openalex.org/W1745899943","https://openalex.org/W183780713","https://openalex.org/W2049361636"],"abstract_inverted_index":{"The":[0],"Combined":[1],"Target-Assignment":[2],"and":[3,13,49,77,104],"Path-Finding":[4],"(TAPF)":[5],"problem":[6],"requires":[7],"simultaneously":[8],"assigning":[9],"targets":[10],"to":[11,23,31,44,53,69,91,127],"agents":[12],"planning":[14],"collision-free":[15],"paths":[16],"for":[17],"them":[18],"from":[19],"their":[20,24],"start":[21],"locations":[22],"assigned":[25],"targets.":[26],"As":[27],"a":[28,100],"leading":[29],"approach":[30],"addressing":[32],"TAPF,":[33],"Conflict-Based":[34,50],"Search":[35,51],"with":[36],"Target":[37,87],"Assignment":[38,88],"(CBS-TA)":[39],"leverages":[40],"K-best":[41,82,107],"target":[42],"assignments":[43,108,115],"create":[45],"multiple":[46,75],"search":[47,102],"trees":[48,76],"(CBS)":[52],"resolve":[54],"collisions":[55],"in":[56,74,123,132,138],"each":[57],"tree.":[58],"While":[59],"CBSTA":[60],"finds":[61],"optimal":[62,129],"solutions,":[63],"it":[64],"faces":[65],"scalability":[66],"challenges":[67],"due":[68],"the":[70,78,117],"duplicated":[71],"collision":[72],"resolution":[73],"expensive":[79],"computation":[80],"of":[81,140],"assignments.":[83],"We":[84,119],"introduce":[85],"Incremental":[86],"CBS":[89],"(ITA-CBS)":[90],"bypass":[92],"these":[93],"two":[94],"computational":[95],"bottlenecks.":[96],"ITA-CBS":[97],"generates":[98],"only":[99],"single":[101],"tree":[103],"avoids":[105],"computing":[106,111],"by":[109],"incrementally":[110],"new":[112],"1":[113],"-best":[114],"during":[116],"search.":[118],"show":[120],"that":[121],"ITA-CBS,":[122],"theory,":[124],"is":[125],"guaranteed":[126],"find":[128],"solutions":[130],"and,":[131],"practice,":[133],"runs":[134],"faster":[135],"than":[136],"CBS-TA":[137],"96.1%":[139],"6,334":[141],"test":[142],"cases.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}