Ändringar mellan två versioner
Här visas ändringar i "Assignment 2 " mellan 2015-02-13 10:33 av Petter Ögren och 2015-02-16 19:57 av Petter Ögren.
Visa < föregående | nästa > ändring.
Assignment 2
: Cooperative task aIn this assignment, you will solve problems involving multiple agents.¶
* Given a polygonal map, as in Assignment 1, setarch and pursuit¶ ¶ ting positions of N vehicles and M customers, find paths for all N vehicles such that all M customers are visited in (approximately) minimum time
* VRP
* MTSP (with collisions in maze)
* Formation maintenance
* Benefits of formations (kex)
* Search through graph