- T1: (Collision avoidance planning in a Maze) Given a discrete map, as in Assignment 1, starting and goal positions of N vehicles, find paths for all N vehicles such that the destinations are reached in (approximately) minimum time. Note that the vehicles must avoid collisions, i.e. they cannot pass through each other, or enter the same position at the same time.
- T2: (VRP in a Maze) Given a discrete 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 visitied in (approximately) minimum time. Note that the vehicles must avoid collisions, i.e. they cannot pass through each other, or enter the same position at the same time.
- T3: (VRP in polygonal map): 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. Assume that the vehicles occupy circular discs with radii R.
- T4: (Obstacle avoidance in empty space) Given an empty space, N vehicle starting positions, and a given destination for each vehicle. Solve the problem of reaching that destination without colliding with the other vehicles. Solve the problem in a decentralized/reactive manner (i.e. each vehicle has no knowledge of the starting positions or destinations of the others).
- T5: (mini Darpa Urban Challenge) Solve the same problem as above in a polygonal environment.
- T6: Implement the 3 different formation keeping algorithms (virtual structure, leader following and local interaction) using the kinematic point model
- T7: Implement the 3 different formation keeping algorithms for all motion models, by controlling each vehicle towards a point, the motion of which is given by T5 above.
- T8: Report in the form of a scientific paper.
- T9: Be ready to show your solutions at the final meeting.
-
Notifications
You must be signed in to change notification settings - Fork 0
Draggys/Agents2
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published