Answers are grounded in this paper and cite their sources.
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 S of n pixel-shaped objects from a given start configuration to a desired target configuration.
No takes yet. Share an insight, caveat, or question.
Fekete et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: