Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
DOI10.4230/LIPICS.SOCG.2018.29zbMATH Open1489.68349MaRDI QIDQ5115797FDOQ5115797
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)
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
Cites Work
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated motion planning: the video (multimedia exposition)
- Games, puzzles, and computation
- Graph puzzles, homotopy, and the alternating group
- Motion planning for multiple robots
- Moving coins
- On reconfiguration of disks in the plane and related problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reducing Multiple Object Motion Planning to Graph Searching
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- SLIDING DISKS IN THE PLANE
- Sorting in constant number of row and column phases on a mesh
- Strong NP-hardness of moving many discs
Cited In (13)
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated Motion Planning Through Randomized k -Opt
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- The parameterized complexity of coordinated motion planning
- The parameterized complexity of motion planning for snake-like robots
- Routing by matching on convex pieces of grid graphs
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard
- Coordinated Path Planning through Local Search and Simulated Annealing
- Unlabeled multi-robot motion planning with tighter separation bounds
- Space ants: Episode II -- coordinating connected catoms (media exposition)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated motion planning: the video (multimedia exposition)
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)
