{"id":"https://openalex.org/W3120307626","doi":"https://doi.org/10.1109/icra48506.2021.9560985","title":"Multi-objective Conflict-based Search for Multi-agent Path Finding","display_name":"Multi-objective Conflict-based Search for Multi-agent Path Finding","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3120307626","doi":"https://doi.org/10.1109/icra48506.2021.9560985","mag":"3120307626"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9560985","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9560985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2101.03805","any_repository_has_fulltext":true},"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","Carnegie Mellon University, Pittsburgh, PA, USA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"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, College Station, TX","Texas A&M University,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University,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","Carnegie Mellon University, Pittsburgh, PA, USA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"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":0.4774,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70274673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"8786","last_page":"8791"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9944999814033508,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9842000007629395,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7243615984916687},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6480187773704529},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6294683814048767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5458323359489441},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5177930593490601},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5174639821052551},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4896612763404846},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45377522706985474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3659176826477051},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15188488364219666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07816958427429199}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7243615984916687},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6480187773704529},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6294683814048767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5458323359489441},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5177930593490601},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5174639821052551},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4896612763404846},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45377522706985474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3659176826477051},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15188488364219666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07816958427429199},{"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":2,"locations":[{"id":"doi:10.1109/icra48506.2021.9560985","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9560985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"mag:3120307626","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2101.03805","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:3120307626","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2101.03805","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W93645818","https://openalex.org/W1513540105","https://openalex.org/W1595498733","https://openalex.org/W1969219956","https://openalex.org/W1969483458","https://openalex.org/W1976159118","https://openalex.org/W1989407213","https://openalex.org/W2007193228","https://openalex.org/W2027531431","https://openalex.org/W2043293052","https://openalex.org/W2085041447","https://openalex.org/W2102660061","https://openalex.org/W2109802566","https://openalex.org/W2123030512","https://openalex.org/W2191404279","https://openalex.org/W2293465224","https://openalex.org/W2728000785","https://openalex.org/W2909085420","https://openalex.org/W2949992533","https://openalex.org/W2965230525","https://openalex.org/W3037152622","https://openalex.org/W3037164811","https://openalex.org/W3083743049","https://openalex.org/W3103262232","https://openalex.org/W3128804089","https://openalex.org/W6603775515","https://openalex.org/W6625145268","https://openalex.org/W6629161821","https://openalex.org/W6680701603","https://openalex.org/W6738126737","https://openalex.org/W6740473721","https://openalex.org/W6758754608","https://openalex.org/W6763563180","https://openalex.org/W6766599742"],"related_works":["https://openalex.org/W3205463111","https://openalex.org/W3185306811","https://openalex.org/W1488757178","https://openalex.org/W3174340188","https://openalex.org/W3175724379","https://openalex.org/W2047599849","https://openalex.org/W53338022","https://openalex.org/W178935948","https://openalex.org/W2060912974","https://openalex.org/W1598200163","https://openalex.org/W1587828942","https://openalex.org/W2896305407","https://openalex.org/W3119344485","https://openalex.org/W2098999170","https://openalex.org/W2229429638","https://openalex.org/W761691338","https://openalex.org/W1795280816","https://openalex.org/W75704762","https://openalex.org/W3176030603","https://openalex.org/W2788436806"],"abstract_inverted_index":{"Conventional":[0],"multi-agent":[1,61,124],"path":[2,17,62,125],"planners":[3],"typically":[4],"compute":[5,142],"an":[6,99],"ensemble":[7],"of":[8,72,75,88,92,111,129,158],"paths":[9],"while":[10],"optimizing":[11],"a":[12,119,171],"single":[13],"objective,":[14],"such":[15],"as":[16,69],"length.":[18],"However,":[19],"many":[20],"applications":[21],"may":[22,41,64],"require":[23],"multiple":[24],"objectives,":[25],"say":[26],"fuel":[27],"consumption":[28],"and":[29,38,46,127],"completion":[30],"time,":[31],"to":[32,60,66,141],"be":[33,43,67],"simultaneously":[34],"optimized":[35],"during":[36],"planning":[37],"these":[39],"criteria":[40],"not":[42,168],"readily":[44],"compared":[45],"sometimes":[47],"lie":[48],"in":[49],"competition":[50],"with":[51,85,156],"each":[52],"other.":[53],"Naively":[54],"applying":[55],"existing":[56],"multi-objective":[57,132,164],"search":[58,94],"algorithms":[59,166],"finding":[63],"prove":[65,136],"inefficient":[68],"the":[70,73,79,86,93,143,162],"size":[71],"space":[74],"possible":[76],"solutions,":[77],"i.e.,":[78],"Pareto-optimal":[80,145,159],"set,":[81],"can":[82,152],"grow":[83],"exponentially":[84],"number":[87],"agents":[89],"(the":[90],"dimension":[91],"space).":[95],"This":[96],"article":[97],"presents":[98],"approach":[100],"named":[101],"Multi-objective":[102],"Conflict-based":[103,116],"Search":[104,117],"(MO-CBS)":[105],"that":[106,137,150],"bypasses":[107],"this":[108],"so-called":[109],"curse":[110],"dimensionality":[112],"by":[113],"leveraging":[114],"prior":[115],"(CBS),":[118],"well-known":[120],"algorithm":[121],"for":[122],"single-objective":[123],"finding,":[126],"principles":[128],"dominance":[130],"from":[131],"optimization":[133],"literature.":[134],"We":[135],"MO-CBS":[138,151],"is":[139],"able":[140],"entire":[144],"set.":[146],"Our":[147],"results":[148],"show":[149],"solve":[153],"problem":[154],"instances":[155],"hundreds":[157],"solutions":[160],"which":[161],"standard":[163],"A*":[165],"could":[167],"find":[169],"within":[170],"bounded":[172],"time.":[173]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}