Shadoks Approach to Low-Makespan Coordinated Motion Planning

03/25/2021
by   Loïc Crombez, et al.
0

This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach their targets without collisions and minimizing the makespan. Using the heuristics outlined in this paper, our team won first place with the best solution to 202 out of 203 instances and optimal solutions to at least 105 of them.

READ FULL TEXT

page 1

page 3

page 5

page 6

page 7

page 8

page 9

page 13

research
08/12/2020

Dynamically Constrained Motion Planning Networks for Non-Holonomic Robots

Reliable real-time planning for robots is essential in today's rapidly e...
research
03/28/2021

Coordinated Motion Planning Through Randomized k-Opt

This paper examines the approach taken by team gitastrophe in the CG:SHO...
research
10/31/2020

GTOC X: Karmarkar's Gang's Approach and Results

This paper describes the methods used and the results obtained by team K...
research
07/09/2020

Computing High-Quality Clutter Removal Solutions for Multiple Robots

We investigate the task and motion planning problem of clearing clutter ...
research
02/25/2018

Pareto optimal multi-robot motion planning

This paper studies a class of multi-robot coordination problems where a ...
research
12/10/2018

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard

We build a general theory for characterizing the computational complexit...
research
08/13/2018

Automatic Playlist Continuation through a Composition of Collaborative Filters

The RecSys Challenge 2018 focused on automatic playlist continuation, i....

Please sign up or login with your details

Forgot password? Click here to reset