{"id":"https://openalex.org/W2782130100","doi":"https://doi.org/10.1137/18m1194341","title":"Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch","display_name":"Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2782130100","doi":"https://doi.org/10.1137/18m1194341","mag":"2782130100"},"language":"en","primary_location":{"id":"doi:10.1137/18m1194341","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1194341","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1801.01689","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9062-4241","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076288432","display_name":"Phillip Keldenich","orcid":"https://orcid.org/0000-0002-6677-5090"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Phillip Keldenich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045375742","display_name":"Henk Meijer","orcid":"https://orcid.org/0000-0003-0406-3327"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henk Meijer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080464077","display_name":"Christian Scheffer","orcid":"https://orcid.org/0000-0002-3471-2706"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian Scheffer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6827,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.69539444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"48","issue":"6","first_page":"1727","last_page":"1762"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9976999759674072,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7475818991661072},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.614488422870636},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5929810404777527},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.576330304145813},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5637966394424438},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5564800500869751},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5544322729110718},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.535327136516571},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5274976491928101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5197305679321289},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.48157191276550293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4112253785133362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4030362665653229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38742053508758545},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26074153184890747},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10788324475288391},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08363473415374756}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7475818991661072},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.614488422870636},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5929810404777527},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.576330304145813},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5637966394424438},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5564800500869751},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5544322729110718},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.535327136516571},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5274976491928101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5197305679321289},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.48157191276550293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4112253785133362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4030362665653229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38742053508758545},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26074153184890747},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10788324475288391},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08363473415374756},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1137/18m1194341","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1194341","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.01689","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.01689","pdf_url":"https://arxiv.org/pdf/1801.01689","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8742","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.29","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol099-socg2018/LIPIcs.SoCG.2018.29/LIPIcs.SoCG.2018.29.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"mag:2782130100","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1801.01689","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:dspace.mit.edu:1721.1/137725","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137725","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DROPS","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"doi:10.48550/arxiv.1801.01689","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1801.01689","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.socg.2018.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2018.29","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1801.01689","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.01689","pdf_url":"https://arxiv.org/pdf/1801.01689","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G3330351792","display_name":null,"funder_award_id":"FOR 1800","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5662025764","display_name":null,"funder_award_id":"FE407/17-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W248545364","https://openalex.org/W1018525745","https://openalex.org/W1519425125","https://openalex.org/W1538864647","https://openalex.org/W1607355011","https://openalex.org/W1628219785","https://openalex.org/W1751446056","https://openalex.org/W1809214845","https://openalex.org/W1864797539","https://openalex.org/W1926863402","https://openalex.org/W1969483458","https://openalex.org/W1973396716","https://openalex.org/W1980353316","https://openalex.org/W1986164452","https://openalex.org/W1989407213","https://openalex.org/W1991482882","https://openalex.org/W1992707473","https://openalex.org/W1993436019","https://openalex.org/W2002357371","https://openalex.org/W2004815408","https://openalex.org/W2006121663","https://openalex.org/W2007193228","https://openalex.org/W2021042867","https://openalex.org/W2022020194","https://openalex.org/W2030775133","https://openalex.org/W2032056620","https://openalex.org/W2036722182","https://openalex.org/W2038498300","https://openalex.org/W2045403423","https://openalex.org/W2048036606","https://openalex.org/W2052551455","https://openalex.org/W2068796584","https://openalex.org/W2072839015","https://openalex.org/W2081789047","https://openalex.org/W2086019191","https://openalex.org/W2098637407","https://openalex.org/W2107654919","https://openalex.org/W2109835212","https://openalex.org/W2116446610","https://openalex.org/W2117939945","https://openalex.org/W2123030512","https://openalex.org/W2124015815","https://openalex.org/W2125968961","https://openalex.org/W2133067819","https://openalex.org/W2136323427","https://openalex.org/W2136644454","https://openalex.org/W2138308177","https://openalex.org/W2149951504","https://openalex.org/W2153159477","https://openalex.org/W2155992093","https://openalex.org/W2164060583","https://openalex.org/W2164322797","https://openalex.org/W2166462345","https://openalex.org/W2169742265","https://openalex.org/W2218203127","https://openalex.org/W2241553860","https://openalex.org/W2289228561","https://openalex.org/W2293119400","https://openalex.org/W2294364704","https://openalex.org/W2475743629","https://openalex.org/W2886401384","https://openalex.org/W2892258706","https://openalex.org/W2914514102","https://openalex.org/W2950964875","https://openalex.org/W2963095472","https://openalex.org/W2987233852","https://openalex.org/W4300449797"],"related_works":["https://openalex.org/W2810386942","https://openalex.org/W3202986082","https://openalex.org/W2001409397","https://openalex.org/W2116446610","https://openalex.org/W3020222504","https://openalex.org/W119243154","https://openalex.org/W3175107636","https://openalex.org/W2044725657","https://openalex.org/W161032696","https://openalex.org/W163770788","https://openalex.org/W2079010364","https://openalex.org/W1480113909","https://openalex.org/W2197741519","https://openalex.org/W2909216346","https://openalex.org/W1628219785","https://openalex.org/W2773147430","https://openalex.org/W2433098947","https://openalex.org/W1805728873","https://openalex.org/W1518222865","https://openalex.org/W2283069734"],"abstract_inverted_index":{"We":[0,142,191],"develop":[1],"constant-factor":[2],"approximation":[3,156,196],"algorithms":[4],"for":[5,16,113,220,230],"minimizing":[6,199],"the":[7,25,42,94,98,147,169,193,206,217],"execution":[8,200],"time":[9,201],"of":[10,21,27,49,97,129,140,241,253],"a":[11,17,36,119,137,165,231,238,250],"coordinated":[12,50,149],"parallel":[13,51,150,177],"motion":[14,151],"plan":[15,152],"relatively":[18],"dense":[19],"swarm":[20],"homogeneous":[22],"robots":[23,115,172],"in":[24,46,168,176],"absence":[26],"obstacles.":[28],"In":[29,72,158],"our":[30,75,159],"first":[31],"model,":[32,74,161],"each":[33,47,134,162],"robot":[34,54,83,117,131,163],"has":[35,118],"specified":[37],"start":[38],"and":[39,45,125,171],"destination":[40,135],"on":[41],"square":[43],"grid,":[44],"round":[48],"motion,":[52],"every":[53,82],"can":[55,173],"move":[56],"to":[57,107,179,198],"any":[58],"adjacent":[59],"position":[60],"that":[61,145,237],"is":[62,101,104,153,164,212,243,255],"either":[63],"empty":[64],"or":[65],"simultaneously":[66],"being":[67],"vacated":[68],"by":[69],"another":[70],"robot.":[71],"this":[73],"algorithm":[76,197],"achieves":[77],"constant":[78,108,203],"stretch":[79,204,239,251],"factor:":[80],"if":[81],"starts":[84],"at":[85,87,186,188,213,225,227],"distance":[86,226],"most":[88,126,228],"$d$":[89],"from":[90],"its":[91],"destination,":[92],"then":[93],"total":[95],"duration":[96],"overall":[99],"schedule":[100],"$O(d)$,":[102],"which":[103],"optimal":[105,148],"up":[106],"factors.":[109],"Our":[110],"result":[111],"holds":[112],"distinguished":[114],"(each":[116],"specific":[120],"destination),":[121],"identical":[122],"(unlabeled)":[123],"robots,":[124],"generally,":[127],"classes":[128],"different":[130],"types":[132],"(where":[133],"specifies":[136],"required":[138],"type":[139],"robot).":[141],"also":[143],"show":[144],"finding":[146],"NP-hard,":[154],"justifying":[155],"algorithms.":[157],"second":[160],"unit-radius":[166],"disk":[167,184,210],"plane,":[170],"translate":[174],"continuously":[175],"subject":[178],"not":[180],"intersecting,":[181],"i.e.,":[182],"having":[183],"centers":[185,211],"$L_2$-distance":[187],"least":[189,214],"$2$.":[190],"prove":[192,236],"same":[194],"result---constant-factor":[195],"via":[202],"factor---when":[205],"pairwise":[207],"$L_{\\infty}$-distance":[208],"between":[209],"$2\\sqrt{2}=2.8284\\dots$.":[215],"On":[216],"other":[218],"hand,":[219],"$N$":[221],"densely":[222,247],"packed":[223],"disks":[224],"$2+\\delta$":[229],"sufficiently":[232],"small":[233],"$\\delta>0$,":[234],"we":[235],"factor":[240,252],"$\\Omega(N^{1/4})$":[242],"sometimes":[244],"necessary":[245],"(when":[246],"packed),":[248],"while":[249],"$\\mathcal{O}(N^{1/2})$":[254],"always":[256],"possible.":[257]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2022-10-03T00:00:00"}
