Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract).
Bernhard NebelThomas BolanderThorsten EngesserRobert MattmüllerPublished in: IJCAI (2019)
Keyphrases
- extended abstract
- path finding
- multi agent
- computational complexity
- search algorithm
- cooperative
- path planning
- heuristic search
- np complete
- robocup rescue
- hill climbing
- special case
- virtual endoscopy
- reinforcement learning
- rule learning
- np hard
- neural network
- collision avoidance
- search space
- optimal path
- dynamic environments
- shortest path
- data analysis
- machine learning