Multi-agent pathfinding with n agents on graphs with n vertices: combinatorial classification and tight algorithmic bounds
From MaRDI portal
(Redirected from Publication:5283371)
Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
- Graph puzzles, homotopy, and the alternating group
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- The \((n^ 2-1)\)-puzzle and related relocation problems
Cited in
(11)- Complexity of planning for connected agents in a partially known environment
- Push and rotate: a complete multi-agent pathfinding algorithm
- scientific article; zbMATH DE number 5959974 (Why is no real title available?)
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
- k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
- The increasing cost tree search for optimal multi-agent pathfinding
- Solving multi-agent path finding on strongly biconnected digraphs
- Token Swapping on Trees
- Reconfiguration of connected graph partitions
- The computational complexity of multi-agent pathfinding on directed graphs
- Constrained motion planning and multi-agent path finding on directed graphs
This page was built for publication: Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283371)
