# Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021

arXiv: https://arxiv.org/abs/2103.15381 · HTML: https://mlsanity.com/paper/2103.15381/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Mar 2021.

## Built on by (most cited first, 3 of 3)

- [The Parameterized Complexity of Coordinated Motion Planning](https://mlsanity.com/paper/2312.07144/) (2023)
- [On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles](https://mlsanity.com/paper/2312.10887/) (2023)
- [Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds](https://mlsanity.com/paper/2410.14947/) (2024)

## Abstract (arXiv)

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 set S of n pixel-shaped objects from a given start configuration into a desired target configuration.