Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds.
Klaus-Tycho FoersterLinus GronerTorsten HoeflerMichael KönigSascha SchmidRoger WattenhoferPublished in: CIAC (2017)
Keyphrases
- multi agent
- path finding
- single agent
- multi agent systems
- upper bound
- lower bound
- multiple agents
- multiagent systems
- decision trees
- machine learning
- reinforcement learning
- coalition formation
- search algorithm
- worst case
- heterogeneous agents
- autonomous agents
- weighted graph
- rule learning
- classification algorithm
- path planning
- hill climbing
- random graphs
- generalization error bounds
- classification rules
- heuristic search
- data mining
- metaheuristic
- dynamic environments
- computational complexity
- genetic algorithm