Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends.
Jirí SvancaraDor AtzmonKlaus StrauchRoland KaminskiTorsten SchaubPublished in: ICAART (3) (2024)
Keyphrases
- path finding
- multi agent
- objective function
- path planning
- search algorithm
- heuristic search
- optimization problems
- linear programming
- hill climbing
- reinforcement learning
- feasible solution
- optimal path
- optimal solution
- lower bound
- state abstraction
- mobile robot
- rough sets
- simulated annealing
- cost function
- real time search algorithms