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

Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S.B. Mitchell

doi:10.1145/3532773

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

Sándor P. Fekete
, Phillip Keldenich
, Dominik Krupke
, Joseph S.B. Mitchell

Applied Mathematics and Statistics

Stony Brook University

Technical University of Braunschweig

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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 S of n pixel-shaped objects from a given start configuration to a desired target configuration.

Original language	English
Article number	3.1
Journal	ACM Journal of Experimental Algorithmics
Volume	27
Issue number	4
DOIs	https://doi.org/10.1145/3532773
State	Published - Jul 27 2022

Keywords

Computational geometry
algorithm engineering
complexity
contest
geometric optimization
motion planning

Access to Document

10.1145/3532773

Cite this

@article{3ae62bffd6f04c5bbe2677e1c1e1ad7a,

title = "Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021",

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 S of n pixel-shaped objects from a given start configuration to a desired target configuration.",

keywords = "Computational geometry, algorithm engineering, complexity, contest, geometric optimization, motion planning",

author = "Fekete, \{S{\'a}ndor P.\} and Phillip Keldenich and Dominik Krupke and Mitchell, \{Joseph S.B.\}",

note = "Publisher Copyright: {\textcopyright} 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM.",

year = "2022",

month = jul,

day = "27",

doi = "10.1145/3532773",

language = "English",

volume = "27",

journal = "ACM Journal of Experimental Algorithmics",

issn = "1084-6654",

publisher = "Association for Computing Machinery",

number = "4",

}

TY - JOUR

T1 - Computing Coordinated Motion Plans for Robot Swarms

T2 - The CG:SHOP Challenge 2021

AU - Fekete, Sándor P.

AU - Keldenich, Phillip

AU - Krupke, Dominik

AU - Mitchell, Joseph S.B.

PY - 2022/7/27

Y1 - 2022/7/27

N2 - 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 S of n pixel-shaped objects from a given start configuration to a desired target configuration.

AB - 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 S of n pixel-shaped objects from a given start configuration to a desired target configuration.

KW - Computational geometry

KW - algorithm engineering

KW - complexity

KW - contest

KW - geometric optimization

KW - motion planning

UR - https://www.scopus.com/pages/publications/85149928452

U2 - 10.1145/3532773

DO - 10.1145/3532773

M3 - Article

SN - 1084-6654

VL - 27

JO - ACM Journal of Experimental Algorithmics

JF - ACM Journal of Experimental Algorithmics

IS - 4

M1 - 3.1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this