Difference between revisions of "Path Planning Systems"
Jump to navigation
Jump to search
(Player no longer a needed resource.) |
(Added task list.) |
||
Line 2: | Line 2: | ||
− | == | + | == Task List == |
+ | * [ ] Research different types of path planning algorithms | ||
+ | * [ ] Determine relevant algorithms | ||
+ | ** [ ] for autonomous navigation challenge | ||
+ | ** [ ] for GPS waypoint navigation challenge | ||
+ | * [ ] Research control theory | ||
+ | ** [ ] Optimal switching | ||
+ | * [ ] Determine best type of map (representation of environment) | ||
+ | ** [ ] Coordinate with "Data Filtering Systems" group | ||
== Resources == | == Resources == |
Revision as of 16:33, 15 September 2007
The purpose of the "Path Planning Systems" is to find an optimal path through the environment, given a model of the environment from the data of the "Data Filtering Systems."
Task List
- [ ] Research different types of path planning algorithms
- [ ] Determine relevant algorithms
- [ ] for autonomous navigation challenge
- [ ] for GPS waypoint navigation challenge
- [ ] Research control theory
- [ ] Optimal switching
- [ ] Determine best type of map (representation of environment)
- [ ] Coordinate with "Data Filtering Systems" group
Resources
- "Planning Algorithms" by Steven M. LaValle
- IEEE Xplore