Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


A Convex Optimization Approach To Time-Optimum Path Planning


S. Colas

Semester/Bachelor Thesis, FS 09

This project analyzes the problem of determining a good, in a time-minimizing sense, trajectory and speed pro le for a car traveling along a known track. Since this problem is in general nonconvex, we investigate, and improve upon, an existing heuristic approach that simpli es the problem to the point of making it convex and allowing it to be run in an on-line scenario. We furthermore discuss applying this approach in a receding horizon setup.


Type of Publication:

(13)Semester/Bachelor Thesis

M. Morari

No Files for download available.
% Autogenerated BibTeX entry
@PhdThesis { Xxx:2009:IFA_3430
Permanent link