Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
From MaRDI portal
Publication:5115797
approximationbounded stretchcomplexitycoordinated motion planningmakespanparallel motionrobot swarms
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
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
- 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
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- 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
(16)- Routing by matching on convex pieces of grid graphs
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- Coordinating Swarms of Objects at Extreme Dimensions
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated motion planning: the video (multimedia exposition)
- The parameterized complexity of motion planning for snake-like robots
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Coordinated Motion Planning Through Randomized k -Opt
- Coordinated Path Planning through Local Search and Simulated Annealing
- Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard
- Unlabeled multi-robot motion planning with tighter separation bounds
- Space ants: Episode II -- coordinating connected catoms (media exposition)
- The parameterized complexity of coordinated motion planning
- Hardness of token swapping on trees
- Coordinated motion planning: multi-agent path finding in a densely packed, bounded domain
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)
