On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs.
Bernhard NebelPublished in: CoRR (2019)
Keyphrases
- directed graph
- path finding
- multi agent
- computational complexity
- random walk
- path planning
- heuristic search
- search algorithm
- hill climbing
- reinforcement learning
- optimal path
- directed acyclic graph
- np hard
- complexity analysis
- np complete
- rule learning
- disjoint paths
- undirected graph
- graph structure
- search space
- social network analysis
- special case
- ai planning
- genetic algorithm
- graph structures