Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity.
Bernhard NebelThomas BolanderThorsten EngesserRobert MattmüllerPublished in: J. Artif. Intell. Res. (2019)
Keyphrases
- path finding
- multi agent
- computational complexity
- path planning
- heuristic search
- cooperative
- np complete
- optimal path
- special case
- reinforcement learning
- search algorithm
- collision avoidance
- shortest path
- robocup rescue
- hill climbing
- rule learning
- virtual endoscopy
- np hard
- knowledge acquisition
- mobile robot
- search space
- lower bound