Assignment 2

In this assignment, you will solve problems involving multiple agents.

• Given a polygonal map, as in Assignment 1, starting positions of N vehicles and M customers, find paths for all N vehicles such that all M customers are visited in (approximately) minimum time
• MTSP (with collisions in maze)
• Formation maintenance
• Benefits of formations (kex)
• Search through graph