{"id":"https://openalex.org/W3205046744","doi":"https://doi.org/10.1109/icra48506.2021.9561899","title":"Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning","display_name":"Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3205046744","doi":"https://doi.org/10.1109/icra48506.2021.9561899","mag":"3205046744"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9561899","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561899","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047933060","display_name":"Teng Guo","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":"Teng Guo","raw_affiliation_strings":["Department of Computer Science, Rutgers, the State University of New Jersey, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers, the State University of New Jersey, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","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, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers, the State University of New Jersey, Piscataway, NJ, 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, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers, the State University of New Jersey, Piscataway, NJ, 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":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8009","last_page":"8015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9832000136375427,"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/T12288","display_name":"Optimization and Search Problems","score":0.9768999814987183,"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.8462526798248291},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6263507604598999},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5942381024360657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5803304314613342},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5399835109710693},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5164914131164551},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.46492958068847656},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.462261825799942},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.455031156539917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4344973862171173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3783707022666931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2763723134994507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2707533836364746}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8462526798248291},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6263507604598999},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5942381024360657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5803304314613342},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5399835109710693},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5164914131164551},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.46492958068847656},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.462261825799942},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.455031156539917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4344973862171173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3783707022666931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2763723134994507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2707533836364746},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48506.2021.9561899","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561899","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.550000011920929,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W93645818","https://openalex.org/W126122642","https://openalex.org/W146776796","https://openalex.org/W162201679","https://openalex.org/W964554611","https://openalex.org/W1488757178","https://openalex.org/W1510564526","https://openalex.org/W1549280300","https://openalex.org/W1551562380","https://openalex.org/W1588299616","https://openalex.org/W1659382545","https://openalex.org/W1969483458","https://openalex.org/W1973396716","https://openalex.org/W1980597356","https://openalex.org/W1986164452","https://openalex.org/W1989407213","https://openalex.org/W2015098966","https://openalex.org/W2117701425","https://openalex.org/W2120633474","https://openalex.org/W2124015815","https://openalex.org/W2136644454","https://openalex.org/W2152754876","https://openalex.org/W2153239294","https://openalex.org/W2166462345","https://openalex.org/W2169742265","https://openalex.org/W2191404279","https://openalex.org/W2241553860","https://openalex.org/W2294562513","https://openalex.org/W2600080636","https://openalex.org/W2807443225","https://openalex.org/W2914296650","https://openalex.org/W2949992533","https://openalex.org/W2963972190","https://openalex.org/W2964997335","https://openalex.org/W2998967952","https://openalex.org/W4243386470","https://openalex.org/W6603775515","https://openalex.org/W6606551078","https://openalex.org/W6625145268","https://openalex.org/W6629161821","https://openalex.org/W6632662516","https://openalex.org/W6637041833","https://openalex.org/W6678131887","https://openalex.org/W6687175555","https://openalex.org/W6758754608","https://openalex.org/W6763563180"],"related_works":["https://openalex.org/W2165127677","https://openalex.org/W2140318223","https://openalex.org/W3091401032","https://openalex.org/W2774921197","https://openalex.org/W2003480636","https://openalex.org/W2317627951","https://openalex.org/W2106773972","https://openalex.org/W1971882903","https://openalex.org/W1968110187","https://openalex.org/W2164855953"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,36],"systematically":[4],"examine":[5],"the":[6,13,33,83,107,112,120],"application":[7],"of":[8,68,85,103,122],"spatio-temporal":[9],"splitting":[10,42,77,109],"heuristics":[11],"to":[12,26,29,48],"Multi-Robot":[14],"Motion":[15],"Planning":[16],"(MRMP)":[17],"problem":[18,24,104],"in":[19,62],"a":[20,23,69,75],"graph-theoretic":[21],"setting:":[22],"known":[25],"be":[27,46],"NP-hard":[28],"optimally":[30],"solve.":[31],"Following":[32],"divide-and-conquer":[34],"principle,":[35],"design":[37],"multiple":[38],"spatial":[39,101],"and":[40,57,111,126],"temporal":[41,108],"schemes":[43],"that":[44],"can":[45],"applied":[47],"any":[49],"existing":[50],"MRMP":[51,72],"algorithm,":[52],"including":[53],"integer":[54],"programming":[55],"solvers":[56],"Enhanced":[58],"Conflict":[59],"Based":[60],"Search,":[61],"an":[63],"orthogonal":[64],"manner.":[65],"The":[66],"combination":[67],"good":[70],"baseline":[71],"algorithm":[73,118],"with":[74,106,133],"proper":[76],"heuristic":[78,110],"proves":[79],"highly":[80],"effective,":[81],"allowing":[82],"resolution":[84],"problems":[86],"10+":[87],"times":[88],"than":[89],"what":[90],"is":[91],"possible":[92],"previously,":[93],"as":[94],"corroborated":[95],"by":[96,130],"extensive":[97],"numerical":[98],"evaluations.":[99],"Notably,":[100],"partition":[102],"fusing":[105],"enhanced":[113],"conflict":[114],"based":[115],"search":[116],"(ECBS)":[117],"increases":[119],"scalability":[121],"ECBS":[123],"on":[124,136],"large":[125],"challenging":[127],"DAO":[128],"maps":[129],"5\u201315":[131],"folds":[132],"negligible":[134],"impact":[135],"solution":[137],"optimality.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}