Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021-Reference-Cited by-同舟云学术

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

Published:2022-07-27 Issue: Volume:27 Page:1-12
ISSN:1084-6654
Container-title:ACM Journal of Experimental Algorithmics
language:en
Short-container-title:ACM J. Exp. Algorithmics

Author:

Fekete Sándor P.¹^ORCID,Keldenich Phillip¹^ORCID,Krupke Dominik¹^ORCID,Mitchell Joseph S. B.²^ORCID

Affiliation:

1. Department of Computer Science, TU Braunschweig, Braunschweig, Germany

2. Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA

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.

Funder

DFG project “Computational Geometry: Solving Hard Optimization Problems”

National Science Foundation

US-Israel Binational Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3532773

Reference27 articles.

1. Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons

2. A Survey on Aerial Swarm Robotics

3. Daniel Delahaye, Stéphane Puechmorel, Panagiotis Tsiotras, and Eric Féron. 2014. Mathematical models for aircraft trajectory design: A survey. In Air Traffic Management and Systems. Springer, 205–247.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficiently reconfiguring a connected swarm of labeled robots;Autonomous Agents and Multi-Agent Systems;2024-08-07

2. Connected coordinated motion planning with bounded stretch;Autonomous Agents and Multi-Agent Systems;2023-10-17

3. Coordinated Motion Planning Through Randomized k -Opt;ACM Journal of Experimental Algorithmics;2022-07-27