Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
DOI10.4230/LIPICS.SOCG.2018.29zbMATH Open1489.68349MaRDI QIDQ5115797FDOQ5115797
Sándor P. Fekete, Henk Meijer, Christian Scheffer, Erik D. Demaine, Phillip Keldenich
Publication date: 18 August 2020
Recommendations
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated motion planning: the video (multimedia exposition)
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- scientific article; zbMATH DE number 2085300
- Motion planning for multiple robots
complexityapproximationmakespanrobot swarmsparallel motionbounded stretchcoordinated motion planning
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Cites Work
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Graph puzzles, homotopy, and the alternating group
- Games, puzzles, and computation
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Sorting in constant number of row and column phases on a mesh
- Moving coins
- Strong NP-hardness of moving many discs
- On reconfiguration of disks in the plane and related problems
- Reducing Multiple Object Motion Planning to Graph Searching
- Title not available (Why is that?)
- Motion planning for multiple robots
- Title not available (Why is that?)
- Title not available (Why is that?)
- SLIDING DISKS IN THE PLANE
Cited In (10)
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
- The Parameterized Complexity of Motion Planning for Snake-Like Robots
- Coordinated Motion Planning Through Randomized k -Opt
- Routing by matching on convex pieces of grid graphs
- Title not available (Why is that?)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard
- Coordinated Path Planning through Local Search and Simulated Annealing
- Title not available (Why is that?)
This page was built for publication: Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115797)
