{"id":"https://openalex.org/W3128804089","doi":"https://doi.org/10.1109/lra.2021.3096744","title":"Subdimensional Expansion for Multi-Objective Multi-Agent Path Finding","display_name":"Subdimensional Expansion for Multi-Objective Multi-Agent Path Finding","publication_year":2021,"publication_date":"2021-07-28","ids":{"openalex":"https://openalex.org/W3128804089","doi":"https://doi.org/10.1109/lra.2021.3096744","mag":"3128804089"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2021.3096744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3096744","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2102.01353","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"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"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"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, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-9223-7456","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":null,"display_name":"Howie Choset","orcid":"https://orcid.org/0000-0002-5434-7945"},"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"],"raw_orcid":"https://orcid.org/0000-0002-5434-7945","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","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.4527,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.81589637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"7153","last_page":"7160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.7409999966621399,"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.7409999966621399,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.06379999965429306,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.04520000144839287,"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/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6453999876976013},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6123999953269958},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5837000012397766},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5680999755859375},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5568000078201294},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.444599986076355}],"concepts":[{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6453999876976013},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.608299970626831},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5837000012397766},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5680999755859375},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5568000078201294},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.444599986076355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4368000030517578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4307999908924103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3919000029563904},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.35600000619888306},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2021.3096744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3096744","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2102.01353","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.01353","pdf_url":"https://arxiv.org/pdf/2102.01353","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2102.01353","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.01353","pdf_url":"https://arxiv.org/pdf/2102.01353","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1513540105","https://openalex.org/W1969483458","https://openalex.org/W1989407213","https://openalex.org/W2005600449","https://openalex.org/W2016049811","https://openalex.org/W2027531431","https://openalex.org/W2085041447","https://openalex.org/W2094544836","https://openalex.org/W2102660061","https://openalex.org/W2123030512","https://openalex.org/W2137651302","https://openalex.org/W2155992093","https://openalex.org/W2293465224","https://openalex.org/W2738842532","https://openalex.org/W2757968903","https://openalex.org/W2903998385","https://openalex.org/W2909085420","https://openalex.org/W2914296650","https://openalex.org/W2964664157","https://openalex.org/W3037164811","https://openalex.org/W3083743049","https://openalex.org/W3175724379","https://openalex.org/W6603775515","https://openalex.org/W6625145268","https://openalex.org/W6632662516","https://openalex.org/W6632973643","https://openalex.org/W6687175555","https://openalex.org/W6740473721","https://openalex.org/W6740638739","https://openalex.org/W6763563180","https://openalex.org/W6788319512"],"related_works":[],"abstract_inverted_index":{"Conventional":[0],"multi-agent":[1,60,105],"path":[2,7,15,61],"planners":[3],"typically":[4],"determine":[5],"a":[6,10,108,130,144,217],"that":[8,94],"optimizes":[9],"single":[11,131],"objective,":[12],"such":[13],"as":[14],"length.":[16],"Many":[17],"applications,":[18],"however,":[19],"may":[20,40,63],"require":[21],"multiple":[22,174],"objectives,":[23],"say":[24],"time-to-completion":[25],"and":[26,45,125,139,177,187],"fuel":[27],"use,":[28],"to":[29,59,65,120,129,142,162,194],"be":[30,42,66],"simultaneously":[31],"optimized":[32],"in":[33,48],"the":[34,69,72,78,85,169,184,196,208],"planning":[35,156],"process.":[36],"Often,":[37],"these":[38],"criteria":[39],"not":[41,214],"directly":[43],"compared":[44],"sometimes":[46],"lie":[47],"competition":[49],"with":[50,84,107,164,203],"each":[51,165],"other.":[52,166],"Simply":[53],"applying":[54],"standard":[55,209],"multi-objective":[56,148,210],"search":[57],"algorithms":[58,212],"finding":[62],"prove":[64],"inefficient":[67],"because":[68],"size":[70],"of":[71,74,87,99,115,137,183,205],"space":[73],"possible":[75],"solutions,":[76],"i.e.,":[77],"Pareto-optimal":[79,171,185,198],"set,":[80],"can":[81],"grow":[82],"exponentially":[83],"number":[86],"agents.":[88],"This":[89],"letter":[90],"presents":[91],"an":[92],"approach":[93,191],"bypasses":[95],"this":[96],"so-called":[97],"curse":[98],"dimensionality":[100],"by":[101],"leveraging":[102],"our":[103],"prior":[104],"work":[106],"framework":[109],"called":[110,123],"subdimensional":[111,116,140],"expansion.":[112],"One":[113],"example":[114],"expansion,":[117],"when":[118,158],"applied":[119],"A$^*$,":[121],"is":[122,192],"M$^*$":[124,126,149],"was":[127],"limited":[128],"objective":[132],"function.":[133],"We":[134],"combine":[135],"principles":[136],"dominance":[138],"expansion":[141],"create":[143],"new":[145],"algorithm,":[146],"named":[147],"(MOM$^*$),":[150],"which":[151,207],"dynamically":[152],"couples":[153],"agents":[154,160,175],"for":[155,173,200],"only":[157],"those":[159],"have":[161],"\u201cinteract\u201d":[163],"MOM$^*$":[167],"computes":[168],"complete":[170,197],"set":[172,186,199],"efficiently":[176],"naturally":[178],"trades":[179],"off":[180],"sub-optimal":[181],"approximations":[182],"computational":[188],"efficiency.":[189],"Our":[190],"able":[193],"find":[195,215],"problem":[201],"instances":[202],"hundreds":[204],"solutions":[206],"A$^*$":[211],"could":[213],"within":[216],"bounded":[218],"time.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2021-02-15T00:00:00"}