{"id":"https://openalex.org/W2998967952","doi":"https://doi.org/10.1109/lra.2020.2967326","title":"DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics","display_name":"DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics","publication_year":2020,"publication_date":"2020-01-17","ids":{"openalex":"https://openalex.org/W2998967952","doi":"https://doi.org/10.1109/lra.2020.2967326","mag":"2998967952"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2020.2967326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.2967326","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/A5037243756","display_name":"Shuai D. Han","orcid":"https://orcid.org/0000-0001-7741-2378"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuai D. Han","raw_affiliation_strings":["Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, USA"],"raw_orcid":"https://orcid.org/0000-0001-7741-2378","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076210154","display_name":"Jingjin Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, USA"],"raw_orcid":"https://orcid.org/0000-0003-4112-2250","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":4.8063,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.96094924,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"5","issue":"2","first_page":"1350","last_page":"1357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.979200005531311,"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/T12288","display_name":"Optimization and Search Problems","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/heuristics","display_name":"Heuristics","score":0.8421916961669922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6547906398773193},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6444882154464722},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6080754995346069},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5912768840789795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5846181511878967},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5591226816177368},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5449200868606567},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5419579148292542},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.42720699310302734},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.25730717182159424},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2187327742576599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1649007499217987}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8421916961669922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6547906398773193},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6444882154464722},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6080754995346069},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5912768840789795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5846181511878967},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5591226816177368},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5449200868606567},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5419579148292542},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.42720699310302734},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.25730717182159424},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2187327742576599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1649007499217987},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2020.2967326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.2967326","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/G4722403830","display_name":null,"funder_award_id":"IIS-1845888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5201265038","display_name":null,"funder_award_id":"IIS-1734419","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":74,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W126122642","https://openalex.org/W196900508","https://openalex.org/W964554611","https://openalex.org/W1488757178","https://openalex.org/W1510564526","https://openalex.org/W1549280300","https://openalex.org/W1628219785","https://openalex.org/W1662166164","https://openalex.org/W1865351023","https://openalex.org/W1964462572","https://openalex.org/W1997417333","https://openalex.org/W1998716564","https://openalex.org/W2007193228","https://openalex.org/W2032894041","https://openalex.org/W2070224057","https://openalex.org/W2097639646","https://openalex.org/W2100695938","https://openalex.org/W2109835212","https://openalex.org/W2112224432","https://openalex.org/W2117701425","https://openalex.org/W2120633474","https://openalex.org/W2123030512","https://openalex.org/W2125523198","https://openalex.org/W2128453677","https://openalex.org/W2133067819","https://openalex.org/W2136644454","https://openalex.org/W2137952598","https://openalex.org/W2140994944","https://openalex.org/W2142943472","https://openalex.org/W2152754876","https://openalex.org/W2153239294","https://openalex.org/W2166462345","https://openalex.org/W2169240708","https://openalex.org/W2169742265","https://openalex.org/W2171940562","https://openalex.org/W2191404279","https://openalex.org/W2241553860","https://openalex.org/W2294562513","https://openalex.org/W2296356821","https://openalex.org/W2321951475","https://openalex.org/W2399153727","https://openalex.org/W2574186214","https://openalex.org/W2807443225","https://openalex.org/W2913211223","https://openalex.org/W2948511273","https://openalex.org/W2949992533","https://openalex.org/W2952280826","https://openalex.org/W2962769831","https://openalex.org/W2962969317","https://openalex.org/W2963358853","https://openalex.org/W2963891176","https://openalex.org/W2964997335","https://openalex.org/W2966625830","https://openalex.org/W2988145053","https://openalex.org/W2998967952","https://openalex.org/W3021537808","https://openalex.org/W4229668751","https://openalex.org/W4243386470","https://openalex.org/W6629161821","https://openalex.org/W6630487674","https://openalex.org/W6632662516","https://openalex.org/W6637123243","https://openalex.org/W6675090247","https://openalex.org/W6678131887","https://openalex.org/W6687175555","https://openalex.org/W6712589207","https://openalex.org/W6732555561","https://openalex.org/W6738126737","https://openalex.org/W6753134240","https://openalex.org/W6756546695","https://openalex.org/W6760919354","https://openalex.org/W6763368627","https://openalex.org/W6763563180"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,28,36,54,94],"novel":[3],"centralized":[4],"and":[5,20,53,81,134],"decoupled":[6],"algorithm,":[7],"DDM,":[8],"for":[9,63,109],"solving":[10],"multi-robot":[11],"path":[12,79,98,122],"planning":[13],"problems":[14],"in":[15],"grid":[16],"graphs,":[17],"targeting":[18],"on-demand":[19],"automated":[21],"warehouse-like":[22],"settings.":[23],"Two":[24],"settings":[25],"are":[26],"studied:":[27],"traditional":[29],"one":[30,56],"whose":[31],"objective":[32],"is":[33,71],"to":[34,45,61,138],"move":[35],"set":[37],"of":[38,93,105,120,132],"robots":[39],"from":[40],"their":[41],"respective":[42],"initial":[43],"vertices":[44,48],"the":[46,101,106,117,139],"goal":[47,64],"as":[49,51],"quickly":[50],"possible,":[52],"dynamic":[55],"which":[57],"requires":[58],"frequent":[59],"re-planning":[60],"accommodate":[62],"configuration":[65],"adjustments.":[66],"Among":[67],"other":[68],"techniques,":[69],"DDM":[70,128],"mainly":[72],"enabled":[73],"through":[74],"exploiting":[75],"two":[76,87,90],"innovative":[77],"heuristics:":[78],"diversification":[80,99],"optimal":[82,112],"sub-problem":[83,113],"solution":[84,114,135],"databases.":[85],"The":[86],"heuristics":[88],"attack":[89],"distinct":[91],"phases":[92],"decoupling-based":[95],"planner:":[96],"while":[97],"allows":[100],"more":[102],"effective":[103],"use":[104],"entire":[107],"workspace":[108],"robot":[110],"travel,":[111],"databases":[115],"facilitate":[116],"fast":[118],"resolution":[119],"local":[121],"conflicts.":[123],"Extensive":[124],"evaluation":[125],"demonstrates":[126],"that":[127],"achieves":[129],"high":[130],"levels":[131],"scalability":[133],"quality":[136],"close":[137],"optimum.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}