The computational complexity of multi-agent pathfinding on directed graphs.
Bernhard NebelPublished in: Artif. Intell. (2024)
Keyphrases
- directed graph
- path finding
- multi agent
- computational complexity
- path planning
- random walk
- heuristic search
- search algorithm
- np complete
- special case
- optimal path
- directed acyclic graph
- hill climbing
- strongly connected
- rule learning
- np hard
- concept learning
- exhaustive search
- mobile robot
- reinforcement learning
- graph structures
- dynamic environments
- genetic programming
- graph structure
- worst case
- undirected graph
- artificial neural networks
- neural network