Parameterized algorithms for coordinated motion planning: minimizing energy
From MaRDI portal
Cites work
- \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
- Conflict-based search for optimal multi-agent pathfinding
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Diameter and treewidth in minor-closed graph families
- Easy problems for tree-decomposable graphs
- Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- Local tree-width, excluded minors, and approximation algorithms
- Model checking on interpretations of classes of bounded local cliquewidth
- 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
- Parameterized algorithms
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Subdimensional expansion for multirobot path planning
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The parameterized complexity of coordinated motion planning
- Unlabeled multi-robot motion planning with tighter separation bounds
Cited in
(4)
This page was built for publication: Parameterized algorithms for coordinated motion planning: minimizing energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875149)
