{"id":"https://openalex.org/W4401163469","doi":"https://doi.org/10.1109/lra.2024.3436333","title":"DMS*: Towards Minimizing Makespan for Multi-Agent Combinatorial Path Finding","display_name":"DMS*: Towards Minimizing Makespan for Multi-Agent Combinatorial Path Finding","publication_year":2024,"publication_date":"2024-07-31","ids":{"openalex":"https://openalex.org/W4401163469","doi":"https://doi.org/10.1109/lra.2024.3436333"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2024.3436333","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2024.3436333","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":["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/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102748398","display_name":"Anushtup Nandy","orcid":"https://orcid.org/0009-0005-3143-7285"},"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":"Anushtup Nandy","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"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":["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":"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"],"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":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9671,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73757099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"9","issue":"9","first_page":"7987","last_page":"7994"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.978600025177002,"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/path","display_name":"Path (computing)","score":0.5549672842025757},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.511435866355896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4694361686706543},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44765979051589966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24787664413452148},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11437448859214783},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09273549914360046}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5549672842025757},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.511435866355896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4694361686706543},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44765979051589966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24787664413452148},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11437448859214783},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09273549914360046}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2024.3436333","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2024.3436333","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"}],"best_oa_location":null,"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":24,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W1549280300","https://openalex.org/W1551562380","https://openalex.org/W1646038686","https://openalex.org/W1969483458","https://openalex.org/W1989407213","https://openalex.org/W2050819731","https://openalex.org/W2117226423","https://openalex.org/W2123030512","https://openalex.org/W2139059344","https://openalex.org/W2191404279","https://openalex.org/W2579451340","https://openalex.org/W2808475207","https://openalex.org/W2914296650","https://openalex.org/W3086406985","https://openalex.org/W3134901932","https://openalex.org/W3206820044","https://openalex.org/W4205985266","https://openalex.org/W4285022255","https://openalex.org/W4312728348","https://openalex.org/W4367281433","https://openalex.org/W4383172025","https://openalex.org/W6632662516","https://openalex.org/W6721983959"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2112121444"],"abstract_inverted_index":{"Multi-Agent":[0],"Combinatorial":[1],"Path":[2],"Finding":[3],"(MCPF)":[4],"seeks":[5],"collision-free":[6,39],"paths":[7,40,88],"for":[8,41,61,130],"multiple":[9,42],"agents":[10,43,172],"from":[11],"their":[12],"start":[13],"to":[14,52,55,68,95,135,153,170],"goal":[15],"locations,":[16],"while":[17,71],"visiting":[18,59],"a":[19,82,96,109],"set":[20],"of":[21,28,75,112,121,162],"intermediate":[22],"target":[23,45,149],"locations":[24],"in":[25,87],"the":[26,29,58,62,73,99,104,119,122,125,147,155,160,163,178],"middle":[27],"paths.":[30],"MCPF":[31,70,131],"is":[32],"challenging":[33],"as":[34,115],"it":[35],"involves":[36],"both":[37],"planning":[38,152],"and":[44,56,93,167,173],"sequencing,":[46],"i.e.,":[47],"solving":[48],"traveling":[49],"salesman":[50],"problems":[51],"assign":[53],"targets":[54],"find":[57],"order":[60],"agents.":[63,105,123],"Recent":[64],"work":[65],"develops":[66],"methods":[67,127],"address":[69],"minimizing":[72],"sum":[74],"individual":[76],"arrival":[77,91,101],"times":[78,92],"at":[79],"goals.":[80],"Such":[81],"problem":[83],"formulation":[84],"may":[85],"result":[86],"with":[89],"different":[90],"lead":[94],"long":[97],"makespan,":[98],"maximum":[100],"time,":[102],"among":[103],"This":[106],"letter":[107],"proposes":[108],"min-max":[110],"variant":[111],"MCPF,":[113],"denoted":[114],"MCPF-max,":[116,137],"that":[117],"minimizes":[118],"makespan":[120],"While":[124],"existing":[126],"(such":[128],"asMS*)":[129],"can":[132],"be":[133],"adapted":[134],"solve":[136],"we":[138],"further":[139],"develop":[140],"two":[141],"new":[142],"techniques":[143],"based":[144],"onMS*to":[145],"defer":[146],"expensive":[148],"sequencing":[150],"during":[151],"expedite":[154],"overall":[156],"computation.":[157],"We":[158,176],"analyze":[159],"properties":[161],"resulting":[164],"algorithm":[165],"DeferredMS*(DMS*),":[166],"testDMS*with":[168],"up":[169],"20":[171],"80":[174],"targets.":[175],"demonstrate":[177],"use":[179],"ofDMS*on":[180],"differential-drive":[181],"robots.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-09T07:27:16.801131","created_date":"2024-08-01T00:00:00"}