Pith. sign in

Coordinated Motion Planning Through Randomized k-Opt

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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.

fields

astro-ph.GA 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.