{"id":"https://openalex.org/W2783094580","doi":"https://doi.org/10.1109/mrs.2017.8250930","title":"Expected constant-factor optimal multi-robot path planning in well-connected environments","display_name":"Expected constant-factor optimal multi-robot path planning in well-connected environments","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2783094580","doi":"https://doi.org/10.1109/mrs.2017.8250930","mag":"2783094580"},"language":"en","primary_location":{"id":"doi:10.1109/mrs.2017.8250930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs.2017.8250930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-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/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":true,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Computer Science, Rutgers University, New Brunswick"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076210154"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.4551,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73967142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"48","last_page":"55"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9922000169754028,"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/robot","display_name":"Robot","score":0.703883707523346},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6505429148674011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6360648274421692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6141433715820312},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5931463241577148},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5614418983459473},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5485332012176514},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.509374737739563},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4849388897418976},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4676268696784973},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.461076021194458},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4594796895980835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4461968243122101},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4225148856639862},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3671317994594574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2568797171115875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23942053318023682},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1944233477115631}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.703883707523346},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6505429148674011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6360648274421692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6141433715820312},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5931463241577148},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5614418983459473},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5485332012176514},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.509374737739563},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4849388897418976},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4676268696784973},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.461076021194458},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4594796895980835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4461968243122101},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4225148856639862},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3671317994594574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2568797171115875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23942053318023682},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1944233477115631},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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":1,"locations":[{"id":"doi:10.1109/mrs.2017.8250930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs.2017.8250930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":82,"referenced_works":["https://openalex.org/W3359552","https://openalex.org/W93645818","https://openalex.org/W125001008","https://openalex.org/W126122642","https://openalex.org/W196900508","https://openalex.org/W211895014","https://openalex.org/W964554611","https://openalex.org/W1510564526","https://openalex.org/W1516027685","https://openalex.org/W1521785144","https://openalex.org/W1525190438","https://openalex.org/W1530765895","https://openalex.org/W1537022493","https://openalex.org/W1753742327","https://openalex.org/W1844237500","https://openalex.org/W1900710004","https://openalex.org/W1964462572","https://openalex.org/W1973396716","https://openalex.org/W1981040965","https://openalex.org/W1986164452","https://openalex.org/W1997417333","https://openalex.org/W1998716564","https://openalex.org/W2016374168","https://openalex.org/W2017714866","https://openalex.org/W2032894041","https://openalex.org/W2034604437","https://openalex.org/W2036722182","https://openalex.org/W2039107569","https://openalex.org/W2052819251","https://openalex.org/W2068796584","https://openalex.org/W2072839015","https://openalex.org/W2083721544","https://openalex.org/W2086807633","https://openalex.org/W2103120971","https://openalex.org/W2105932936","https://openalex.org/W2117701425","https://openalex.org/W2119120935","https://openalex.org/W2120633474","https://openalex.org/W2124015815","https://openalex.org/W2128453677","https://openalex.org/W2130774864","https://openalex.org/W2135939055","https://openalex.org/W2137952598","https://openalex.org/W2139369541","https://openalex.org/W2142943472","https://openalex.org/W2152754876","https://openalex.org/W2153159477","https://openalex.org/W2153239294","https://openalex.org/W2157411165","https://openalex.org/W2163502413","https://openalex.org/W2166462345","https://openalex.org/W2168958225","https://openalex.org/W2169240708","https://openalex.org/W2169742265","https://openalex.org/W2191404279","https://openalex.org/W2222512263","https://openalex.org/W2241553860","https://openalex.org/W2399153727","https://openalex.org/W2550873457","https://openalex.org/W2579451340","https://openalex.org/W2783094580","https://openalex.org/W2914296650","https://openalex.org/W2962769831","https://openalex.org/W2963309123","https://openalex.org/W2963358853","https://openalex.org/W2963972190","https://openalex.org/W2984170232","https://openalex.org/W4214629267","https://openalex.org/W4229668751","https://openalex.org/W4243386470","https://openalex.org/W4312258073","https://openalex.org/W6600116910","https://openalex.org/W6603775515","https://openalex.org/W6608015362","https://openalex.org/W6608555317","https://openalex.org/W6625145268","https://openalex.org/W6631783260","https://openalex.org/W6678131887","https://openalex.org/W6687175555","https://openalex.org/W6712589207","https://openalex.org/W6758754608","https://openalex.org/W6764488352"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2106119116","https://openalex.org/W2084091668"],"abstract_inverted_index":{"Fast":[0],"algorithms":[1],"for":[2,31,127],"optimal":[3],"multi-robot":[4,49],"path":[5,50],"planning":[6,51],"are":[7,106],"sought":[8],"after":[9],"in":[10,66,91],"both":[11],"research":[12],"and":[13,27,55,58,63,122],"real-world":[14],"applications.":[15],"Known":[16],"methods,":[17],"however,":[18],"generally":[19],"do":[20],"not":[21],"simultaneously":[22],"guarantee":[23],"good":[24],"solution":[25],"optimality":[26],"fast":[28],"run":[29],"time":[30,42],"difficult":[32],"instances.":[33],"In":[34,68],"this":[35],"work,":[36],"we":[37],"develop":[38],"a":[39,92,116],"low-polynomial":[40],"running":[41],"algorithm,":[43],"called":[44],"SplitAndGroup,":[45],"that":[46],"solves":[47],"the":[48,83,95,103,129],"problem":[52],"on":[53],"grids":[54],"grid-like":[56],"environments,":[57],"produces":[59],"constant":[60],"factor":[61],"time-":[62],"distance-optimal":[64],"solutions,":[65],"expectation.":[67],"particular,":[69],"SplitAndGroup":[70,76,110],"computes":[71],"solutions":[72],"with":[73],"sub-linear":[74],"makespan.":[75],"is":[77,87],"capable":[78],"of":[79,85,102,119],"handling":[80],"cases":[81,98],"when":[82],"density":[84],"robot":[86],"extremely":[88],"high":[89],"-":[90],"graph-theoretic":[93],"setting,":[94],"algorithm":[96],"supports":[97],"where":[99],"all":[100],"vertices":[101],"underlying":[104],"graph":[105],"occupied":[107],"by":[108],"robots.":[109,130],"attains":[111],"its":[112],"desirable":[113],"properties":[114],"through":[115],"careful":[117],"combination":[118],"divide-and-conquer":[120],"technique":[121],"network":[123],"flow":[124],"based":[125],"methods":[126],"routing":[128]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}