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

03/29/2021
by   Sandor P. Fekete, et al.
0

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.

READ FULL TEXT
research
04/08/2020

Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020

We give an overview of the 2020 Computational Geometry Challenge, which ...
research
09/25/2021

Connected Coordinated Motion Planning with Bounded Stretch

We consider the problem of coordinated motion planning for a swarm of si...
research
09/22/2022

Efficiently Reconfiguring a Connected Swarm of Labeled Robots

When considering motion planning for a swarm of n labeled robots, we nee...
research
10/11/2020

Collision free motion planning on a wedge of circles

We exhibit an algorithm with continuous instructions for two robots movi...
research
09/15/2023

Geometric Projectors: Geometric Constraints based Optimization for Robot Behaviors

Generating motion for robots that interact with objects of various shape...
research
01/21/2021

Centralized Collision-free Polynomial Trajectories and Goal Assignment for Aerial Swarms

Computationally tractable methods are developed for centralized goal ass...
research
12/18/2019

CAT(0) geometry, robots, and society

How do we move a robot efficiently from one position to another? To answ...

Please sign up or login with your details

Forgot password? Click here to reset