On the parameterized complexity of motion planning for rectangular robots
From MaRDI portal
Cites work
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- Mover problems
- Moving coins
- On reconfiguration of disks in the plane and related problems
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Parameterized algorithms
- Reducing Multiple Object Motion Planning to Graph Searching
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Shortest coordinated motion for square robots
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The parameterized complexity of coordinated motion planning
Cited in
(2)
This page was built for publication: On the parameterized complexity of motion planning for rectangular robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895833)
