{"id":"https://openalex.org/W4383172025","doi":"https://doi.org/10.1109/icra48891.2023.10160864","title":"Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding","display_name":"Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding","publication_year":2023,"publication_date":"2023-05-29","ids":{"openalex":"https://openalex.org/W4383172025","doi":"https://doi.org/10.1109/icra48891.2023.10160864"},"language":"en","primary_location":{"id":"doi:10.1109/icra48891.2023.10160864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10160864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","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/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,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101585007","display_name":"Chaoran Zhang","orcid":"https://orcid.org/0000-0003-0649-2555"},"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":"Chaoran Zhang","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570895","display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakumar Rathinam","raw_affiliation_strings":["Texas A&M University,Department of Mechanical Engineering,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Mechanical Engineering,College Station,TX,77843-3123","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048906141","display_name":"Howie Choset","orcid":null},"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":"Howie Choset","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0847,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8488937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1407","last_page":"1413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9775000214576721,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9754999876022339,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6699173450469971},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5853363275527954},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5741217136383057},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5603739023208618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5185564160346985},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5023987293243408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5019090175628662},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.44732826948165894},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.433278352022171},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.3815746307373047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3502616286277771},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18029966950416565}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6699173450469971},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5853363275527954},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5741217136383057},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5603739023208618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5185564160346985},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5023987293243408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5019090175628662},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.44732826948165894},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.433278352022171},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3815746307373047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3502616286277771},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18029966950416565},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/icra48891.2023.10160864","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10160864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7481737389","display_name":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","funder_award_id":"2120219","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1559954218","https://openalex.org/W1969483458","https://openalex.org/W1989407213","https://openalex.org/W2039107569","https://openalex.org/W2123030512","https://openalex.org/W2241553860","https://openalex.org/W2914296650","https://openalex.org/W2949992533","https://openalex.org/W2963095307","https://openalex.org/W3037454447","https://openalex.org/W3038106444","https://openalex.org/W3083743049","https://openalex.org/W3128804089","https://openalex.org/W3185306811","https://openalex.org/W3187649900","https://openalex.org/W3216907783","https://openalex.org/W4200140837","https://openalex.org/W4285249829","https://openalex.org/W4302557773","https://openalex.org/W4304944116","https://openalex.org/W4307810815","https://openalex.org/W4313148659","https://openalex.org/W6763563180","https://openalex.org/W6780343270"],"related_works":["https://openalex.org/W2768210113","https://openalex.org/W2073298047","https://openalex.org/W1963790170","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2033790662","https://openalex.org/W2049264236","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W2001591765"],"abstract_inverted_index":{"Multi-Agent":[0,28],"Path":[1,31],"Finding":[2,32],"(MA-PF)":[3],"computes":[4],"a":[5,23,80],"set":[6],"of":[7,25,61,65,87,101,150],"collision-free":[8],"paths":[9],"for":[10,121,147],"multiple":[11,39],"agents":[12,35],"from":[13],"their":[14],"respective":[15],"starting":[16],"locations":[17],"to":[18,48,138],"destinations.":[19],"This":[20],"paper":[21],"considers":[22],"generalization":[24],"MA-PF":[26],"called":[27],"Teamwise":[29],"Cooperative":[30],"(MA-TC-PF),":[33],"where":[34],"are":[36,133,136],"grouped":[37],"as":[38],"teams":[40],"and":[41,76,112,119,135],"each":[42],"team":[43],"has":[44],"its":[45],"own":[46],"objective":[47,54],"be":[49,56],"minimized.":[50],"For":[51],"example,":[52],"an":[53],"can":[55],"the":[57,66,85,89,99,102,116,126,130,140],"sum":[58],"or":[59],"max":[60],"individual":[62],"arrival":[63],"times":[64],"agents.":[67],"In":[68],"general,":[69],"there":[70],"is":[71,78],"more":[72],"than":[73],"one":[74],"team,":[75],"MA-TC-PF":[77,151],"thus":[79],"multi-objective":[81],"planning":[82],"problem":[83],"with":[84],"goal":[86],"finding":[88],"entire":[90],"Pareto-optimal":[91,141],"front":[92],"that":[93],"represents":[94],"all":[95],"possible":[96],"trade-offs":[97],"among":[98],"objectives":[100],"teams.":[103],"To":[104],"solve":[105],"MA-TC-PF,":[106],"we":[107],"propose":[108],"two":[109],"algorithms":[110,132],"TC-CBS":[111],"TC-M*,":[113],"which":[114,129],"leverage":[115],"existing":[117],"CBS":[118],"M*":[120],"conventional":[122],"MA-PF.":[123],"We":[124,143],"discuss":[125],"conditions":[127],"under":[128],"proposed":[131],"complete":[134],"guaranteed":[137],"find":[139],"front.":[142],"present":[144],"numerical":[145],"results":[146],"several":[148],"types":[149],"problems.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}