{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:19:36Z","timestamp":1774495176042,"version":"3.50.1"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG project \u201cComputational Geometry: Solving Hard Optimization Problems\u201d","award":["FE407\/21-1"],"award-info":[{"award-number":["FE407\/21-1"]}]},{"name":"National Science Foundation","award":["CCF-2007275"],"award-info":[{"award-number":["CCF-2007275"]}]},{"name":"US-Israel Binational Science Foundation","award":["2016116"],"award-info":[{"award-number":["2016116"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>\n            We give an overview of the 2021 Computational Geometry Challenge, which targeted the problem of optimally coordinating a set of robots by computing a family of collision-free trajectories for a set\n            <jats:italic>S<\/jats:italic>\n            of\n            <jats:italic>n<\/jats:italic>\n            pixel-shaped objects from a given start configuration to a desired target configuration.\n          <\/jats:p>","DOI":"10.1145\/3532773","type":"journal-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T13:21:43Z","timestamp":1653398503000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021"],"prefix":"10.1145","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6677-5090","authenticated-orcid":false,"given":"Phillip","family":"Keldenich","sequence":"additional","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1573-3496","authenticated-orcid":false,"given":"Dominik","family":"Krupke","sequence":"additional","affiliation":[{"name":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0152-2279","authenticated-orcid":false,"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2470096"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2018.74."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2857475"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2021.63"},{"key":"e_1_3_1_6_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-4-431-54475-3_12","volume-title":"Air Traffic Management and Systems","author":"Delahaye Daniel","year":"2014","unstructured":"Daniel Delahaye, St\u00e9phane Puechmorel, Panagiotis Tsiotras, and Eric F\u00e9ron. 2014. Mathematical models for aircraft trajectory design: A survey. In Air Traffic Management and Systems. Springer, 205\u2013247."},{"key":"e_1_3_1_7_2","first-page":"29:1\u201329:17","volume-title":"Proceedings of the 34th International Symposium on Computational Geometry (SoCG\u201918)","author":"Demaine Erik D.","year":"2018","unstructured":"Erik D. Demaine, S\u00e1ndor P. Fekete, Phillip Keldenich, Henk Meijer, and Christian Scheffer. 2018. Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch. In Proceedings of the 34th International Symposium on Computational Geometry (SoCG\u201918). 29:1\u201329:17. Full version to appear in SIAM Journal on Computing."},{"key":"e_1_3_1_8_2","first-page":"1","article-title":"Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch","volume":"1801","author":"Demaine Erik D.","year":"2018","unstructured":"Erik D. Demaine, S\u00e1ndor P. Fekete, Phillip Keldenich, Henk Meijer, and Christian Schefffer. 2018. Coordinated motion planning: Reconfiguring a swarm of labeled robots with bounded stretch. Computing Research Repository (CoRR\u201918) 1801 (2018), 1\u201332. Available at https:\/\/arxiv.org\/abs\/1801.01689.","journal-title":"Computing Research Repository (CoRR\u201918)"},{"key":"e_1_3_1_9_2","first-page":"21","volume-title":"Nanoscale Computing and Communication (NANOCOM\u201915)","author":"Derakhshandeh Zahra","year":"2015","unstructured":"Zahra Derakhshandeh, Robert Gmyr, Andr\u00e9a W. Richa, Christian Scheideler, and Thim Strothmann. 2015. An algorithmic framework for shape formation problems in self-organizing particle systems. In Nanoscale Computing and Communication (NANOCOM\u201915). 21."},{"key":"e_1_3_1_10_2","first-page":"289","volume-title":"Symposium on Parallelism in Algorithms and Architectures (SPAA\u201916)","author":"Derakhshandeh Zahra","year":"2016","unstructured":"Zahra Derakhshandeh, Robert Gmyr, Andr\u00e9a W. Richa, Christian Scheideler, and Thim Strothmann. 2016. Universal shape formation for programmable matter. In Symposium on Parallelism in Algorithms and Architectures (SPAA\u201916). 289\u2013299."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0130-0_29"},{"key":"e_1_3_1_12_2","article-title":"Claytronics: A scalable basis for future robots","author":"Goldstein Seth Copen","year":"2004","unstructured":"Seth Copen Goldstein and Todd Mowry. 2004. Claytronics: A scalable basis for future robots. Robosphere November (2004).","journal-title":"Robosphere"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/0215055"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878952"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2021.64"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2016.7778628"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1254295"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-008-0020-6"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/1202661"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498300200304"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913506268"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916672311"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"},{"key":"e_1_3_1_25_2","first-page":"140","volume-title":"Autonomous Agents and MultiAgent Systems (AAMAS\u201919)","author":"Thalamy Pierre","year":"2019","unstructured":"Pierre Thalamy, Beno\u00eet Piranda, and Julien Bourgeois. 2019. Distributed self-reconfiguration using a deterministic autonomous scaffolding structure. In Autonomous Agents and MultiAgent Systems (AAMAS\u201919). 140\u2013148."},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-36279-8_11","volume-title":"Algorithmic Foundations of Robotics X","author":"Turpin M.","year":"2013","unstructured":"M. Turpin, N. Michael, and V. Kumar. 2013. Trajectory planning and assignment in multirobot systems. In Algorithmic Foundations of Robotics X. Springer, 175\u2013190."},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-014-9412-1"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2021.65"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:44Z","timestamp":1750186844000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":27,"alternative-id":["10.1145\/3532773"],"URL":"https:\/\/doi.org\/10.1145\/3532773","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,27]]}}}