Alice: Path Planning: Difference between revisions
From Murray Wiki
Jump to navigationJump to search
m (Alice: Path Planner moved to Alice: Path Planning) |
|||
| Line 9: | Line 9: | ||
== Reading == | == Reading == | ||
< | * <p>[http://grandchallenge.caltech.edu/wiki/images/b/b3/Thesis.pdf Realtime Path Planning Via Nonlinear Optimization Methods], Dmitriy Kogan. MS Thesis, 2005. This thesis describes most of the internals of the path planning algorithm. It was written before some of the final tuning was performed on Alice (during summer of 2005).</p> | ||
== Additional Resources == | == Additional Resources == | ||
<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. --> | <!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. --> | ||
Revision as of 20:56, 13 April 2006
| Prev: RHC | Course Home | Next: Kalman Filtering |
This is the template for CDS 270 lectures. If you edit this page, you will see comments describing what goes in each section. Do not edit this template. See CDS 270: Information for Lecturers for more information on how to create a wiki page corresponding to a lecture.
Lecture Materials
Reading
Realtime Path Planning Via Nonlinear Optimization Methods, Dmitriy Kogan. MS Thesis, 2005. This thesis describes most of the internals of the path planning algorithm. It was written before some of the final tuning was performed on Alice (during summer of 2005).
