mlsanityData to 7 Oct 2026

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

arXiv 2103.15381 ↗First posted 29 Mar 2021cs.CG cs.ROcited by 3

Not on the map. Why?

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.

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.

  1. 2023The Parameterized Complexity of Coordinated Motion Planningcited by 3
  2. 2023On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzlescited by 2
  3. 2024Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Boundscited by 0