An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.
Pavel SurynekAriel FelnerRoni SternEli BoyarskiPublished in: SOCS (2016)
Keyphrases
- path finding
- multi agent
- path planning
- heuristic search
- np hard
- search algorithm
- scheduling problem
- robocup rescue
- processing times
- hill climbing
- completion times
- optimal path
- np complete
- objective function
- search space
- lower bound
- single machine
- phase transition
- flowshop
- logic programs
- dynamic environments
- computational complexity
- rule learning
- data mining