{"id":"https://openalex.org/W3216907783","doi":"https://doi.org/10.1109/tase.2022.3183183","title":"A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding","display_name":"A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding","publication_year":2022,"publication_date":"2022-06-20","ids":{"openalex":"https://openalex.org/W3216907783","doi":"https://doi.org/10.1109/tase.2022.3183183","mag":"3216907783"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3183183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3183183","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Transactions on Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/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":["Robotics Institute and Mechanical Engineering Department, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Robotics Institute and Mechanical Engineering Department, Carnegie Mellon University, Pittsburgh, PA, USA","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":["Department of Mechnical Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-9223-7456","affiliations":[{"raw_affiliation_string":"Department of Mechnical Engineering, Texas A&M University, College Station, TX, USA","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":["Robotics Institute and Mechanical Engineering Department, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-5434-7945","affiliations":[{"raw_affiliation_string":"Robotics Institute and Mechanical Engineering Department, 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":4.2284,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95788968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"20","issue":"2","first_page":"1262","last_page":"1274"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9896000027656555,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9832000136375427,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7268919944763184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.558594822883606},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5329042077064514},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5183066725730896},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.512187659740448},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49869322776794434},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47521454095840454},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.46311700344085693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23707687854766846},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20890632271766663},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20436683297157288}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7268919944763184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.558594822883606},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5329042077064514},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5183066725730896},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.512187659740448},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49869322776794434},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47521454095840454},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.46311700344085693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23707687854766846},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20890632271766663},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20436683297157288},{"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/tase.2022.3183183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3183183","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2101.03805","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.03805","pdf_url":"https://arxiv.org/pdf/2101.03805","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.03805","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.03805","pdf_url":"https://arxiv.org/pdf/2101.03805","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6210591215","display_name":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","funder_award_id":"2120529","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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":56,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W640136309","https://openalex.org/W1513540105","https://openalex.org/W1551562380","https://openalex.org/W1569658139","https://openalex.org/W1835488342","https://openalex.org/W1969219956","https://openalex.org/W1976159118","https://openalex.org/W1989407213","https://openalex.org/W1997188340","https://openalex.org/W2012109553","https://openalex.org/W2016049811","https://openalex.org/W2043293052","https://openalex.org/W2123030512","https://openalex.org/W2155992093","https://openalex.org/W2168424616","https://openalex.org/W2191404279","https://openalex.org/W2241357751","https://openalex.org/W2293465224","https://openalex.org/W2482025661","https://openalex.org/W2575733488","https://openalex.org/W2807637204","https://openalex.org/W2808475207","https://openalex.org/W2913845934","https://openalex.org/W2949992533","https://openalex.org/W2962969317","https://openalex.org/W2964035402","https://openalex.org/W2964997335","https://openalex.org/W2965230525","https://openalex.org/W2965682046","https://openalex.org/W2965850033","https://openalex.org/W3037152622","https://openalex.org/W3037164811","https://openalex.org/W3083359953","https://openalex.org/W3083743049","https://openalex.org/W3092554988","https://openalex.org/W3093793192","https://openalex.org/W3128804089","https://openalex.org/W3134901932","https://openalex.org/W3160323165","https://openalex.org/W3164019634","https://openalex.org/W3171043051","https://openalex.org/W3177374642","https://openalex.org/W3185306811","https://openalex.org/W3187140574","https://openalex.org/W3205463111","https://openalex.org/W3206794755","https://openalex.org/W3206820044","https://openalex.org/W4205985266","https://openalex.org/W4210773084","https://openalex.org/W4283786866","https://openalex.org/W4302557773","https://openalex.org/W6721983959","https://openalex.org/W6732388567","https://openalex.org/W6738126737","https://openalex.org/W6798656675"],"related_works":["https://openalex.org/W2359600231","https://openalex.org/W2115970849","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W2090178682","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W4241467429"],"abstract_inverted_index":{"Conventional":[0],"multi-agent":[1,86,138,185,228,243],"path":[2,17,87,139,201,235,286],"planners":[3],"typically":[4,230],"compute":[5,168],"an":[6,111,264],"ensemble":[7],"of":[8,56,66,69,97,106,125,143,154,191,267,298],"paths":[9,206,272],"while":[10,283],"optimizing":[11,232,284],"a":[12,63,70,133,180,233,240,280,296],"single":[13,71,234],"objective,":[14],"such":[15,80,213],"as":[16,81,94,214,245,247],"length.":[18],"However,":[19],"many":[20],"applications":[21,212],"may":[22,41,89],"require":[23],"multiple":[24,200,208,274],"objectives,":[25],"say":[26],"fuel":[27],"consumption":[28],"and":[29,38,46,141,164,221,288,294,315],"completion":[30],"time,":[31],"to":[32,61,85,91,120,156,188,198,253,270,307,316],"be":[33,43,92],"simultaneously":[34],"optimized":[35],"during":[36],"planning":[37,204,229],"these":[39],"criteria":[40,202],"not":[42],"readily":[44],"compared":[45],"sometimes":[47],"lie":[48],"in":[49,211,279],"competition":[50],"with":[51,103],"each":[52],"other.":[53],"The":[54],"goal":[55],"the":[57,95,98,104,169,196,259,268,305,309,318],"problem":[58],"is":[59],"thus":[60],"find":[62,254],"Pareto-optimal":[64,171,256,299],"set":[65,297],"solutions":[67,257,300],"instead":[68],"optimal":[72],"solution.":[73],"Naively":[74],"applying":[75],"existing":[76],"multi-objective":[77,82,146,184,242],"search":[78,99],"algorithms,":[79],"A*":[83],"(MOA*),":[84],"finding":[88],"prove":[90,161],"inefficient":[93],"dimensionality":[96,126],"space":[100],"grows":[101],"exponentially":[102],"number":[105],"agents.":[107],"This":[108,237],"article":[109,193,238],"presents":[110],"approach":[112],"named":[113],"Multi-Objective":[114],"Conflict-Based":[115,130],"Search":[116,131],"(MO-CBS)":[117],"that":[118,162,176,250,276],"attempts":[119],"address":[121],"this":[122,192,291],"so-called":[123],"curse":[124],"by":[127],"leveraging":[128],"prior":[129],"(CBS),":[132],"well-known":[134],"algorithm":[135,269],"for":[136,207,227,258,273,304,322],"single-objective":[137],"finding,":[140],"principles":[142],"dominance":[144],"from":[145,195],"optimization":[147],"literature.":[148],"We":[149,160,261],"also":[150,262],"develop":[151],"several":[152],"variants":[153,166,249],"MO-CBS":[155,163,177],"improve":[157],"its":[158,165,248],"performance.":[159],"can":[167],"entire":[170],"set.":[172],"Numerical":[173],"results":[174],"show":[175],"outperforms":[178],"MOM*,":[179],"recently":[181],"developed":[182],"state-of-the-art":[183],"planner.":[186],"Note":[187],"Practitioners\u2014The":[189],"motivation":[190],"originates":[194],"need":[197],"optimize":[199],"when":[203],"conflict-free":[205],"mobile":[209],"robots":[210],"warehouse":[215],"logistics,":[216],"surveillance,":[217],"construction":[218,281],"site":[219,282],"routing,":[220],"hazardous":[222],"material":[223],"transportation.":[224],"Existing":[225],"methods":[226],"consider":[231],"criteria.":[236],"develops":[239],"novel":[241],"planner":[244],"well":[246],"are":[251],"guaranteed":[252],"all":[255],"problem.":[260],"provide":[263],"illustrative":[265],"example":[266],"plan":[271],"agents":[275],"transport":[277],"materials":[278],"both":[285],"length":[287],"risk.":[289],"In":[290],"example,":[292],"computing":[293],"visualizing":[295],"makes":[301],"it":[302],"intuitive":[303],"practitioner":[306],"understand":[308],"underlying":[310],"trade-off":[311],"between":[312],"conflicting":[313],"objectives":[314],"choose":[317],"most":[319],"preferred":[320],"solution":[321],"execution":[323],"based":[324],"on":[325],"their":[326],"domain":[327],"knowledge.":[328]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}