On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs.
Bernhard NebelPublished in: ICAPS (2020)
Keyphrases
- directed graph
- path finding
- multi agent
- computational complexity
- path planning
- random walk
- heuristic search
- search algorithm
- np complete
- special case
- graph structure
- reinforcement learning
- optimal path
- rule learning
- np hard
- directed acyclic graph
- strongly connected
- complexity analysis
- hill climbing
- undirected graph
- exhaustive search
- approximation algorithms
- search space
- graph structures
- objective function