Solving multi-agent path finding on strongly biconnected digraphs
From MaRDI portal
Recommendations
- Push and rotate: a complete multi-agent pathfinding algorithm
- Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
- Conflict-based search for optimal multi-agent pathfinding
- scientific article; zbMATH DE number 5959974
- Pairwise symmetry reasoning for multi-agent path finding search
Cited in
(10)- The snow team problem (clearing directed subgraphs by mobile agents)
- Priority inheritance with backtracking for iterative multi-agent path finding
- Push and rotate: a complete multi-agent pathfinding algorithm
- Path-based depth-first search for strong and biconnected components
- Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
- Continuous optimisation problem and game theory for multi-agent pathfinding
- The computational complexity of multi-agent pathfinding on directed graphs
- Constrained motion planning and multi-agent path finding on directed graphs
- New integer optimization models and decomposition-based algorithms for the multi-agent pathfinding problem with time-spacing constraints
- Multi-agent pathfinding on strongly connected digraphs: feasibility and solution algorithms
This page was built for publication: Solving multi-agent path finding on strongly biconnected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580265)
