Coordinated Motion Planning Through Randomized k-Opt

03/28/2021
by   Paul Liu, et al.
0

This paper examines the approach taken by team gitastrophe in the CG:SHOP 2021 challenge. The challenge was to find a sequence of simultaneous moves of square robots between two given configurations that minimized either total distance travelled or makespan (total time). Our winning approach has two main components: an initialization phase that finds a good initial solution, and a k-opt local search phase which optimizes this solution. This led to a first place finish in the distance category and a third place finish in the makespan category.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/25/2021

Shadoks Approach to Low-Makespan Coordinated Motion Planning

This paper describes the heuristics used by the Shadoks team for the CG:...
01/08/2021

Grasp and Motion Planning for Dexterous Manipulation for the Real Robot Challenge

This report describes our winning submission to the Real Robot Challenge...
05/08/2019

Anytime Multi-arm Task and Motion Planning for Pick-and-Place of Individual Objects via Handoffs

Automation applications are pushing the deployment of many high DoF mani...
09/26/2021

Singularities of serial robots: Identification and distance computation using geometric algebra

The singularities of serial robotic manipulators are those configuration...
03/21/2021

NeBula: Quest for Robotic Autonomy in Challenging Environments; TEAM CoSTAR at the DARPA Subterranean Challenge

This paper presents and discusses algorithms, hardware, and software arc...
05/17/2021

Compacting Squares

Edge-connected configurations of squares are a common model for modular ...
08/05/2021

An Interleaved Approach to Trait-Based Task Allocation and Scheduling

To realize effective heterogeneous multi-robot teams, researchers must l...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.