Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids.
Tzvika GeftPublished in: SOCS (2023)
Keyphrases
- fine grained
- complexity analysis
- path finding
- multi agent
- coarse grained
- theoretical analysis
- access control
- first order logic
- lower bound
- reinforcement learning
- robocup rescue
- path planning
- computational complexity
- artificial neural networks
- search algorithm
- heuristic search
- rough sets
- information retrieval
- dynamic programming
- relational databases
- genetic algorithm