Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
S\'andor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph, S. B. Mitchell
TL;DR
This paper reviews the 2021 CG:SHOP Challenge focused on developing algorithms to compute collision-free, coordinated motion plans for robot swarms, aiming to optimize their movement from start to target configurations.
Contribution
It presents an overview of the challenge, highlighting the problem of optimal, collision-free trajectory planning for multiple robots in a computational geometry context.
Findings
Analysis of different approaches to trajectory planning
Identification of key challenges in collision avoidance
Benchmark results for various algorithms
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Computational Geometry and Mesh Generation · Modular Robots and Swarm Intelligence