A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract).
Rodrigo LópezRoberto Javier Asín AcháJorge A. BaierPublished in: SOCS (2024)
Keyphrases
- solution space
- extended abstract
- optimal solution
- upper bound
- path finding
- lower bound
- multi agent
- total cost
- branch and bound algorithm
- search space
- metaheuristic
- optimal path
- path planning
- heuristic search
- feasible solution
- np hard
- branch and bound
- search algorithm
- objective function
- complexity analysis
- worst case
- constant factor
- robocup rescue
- scheduling problem
- rule learning
- state space
- processing times
- special case