assn2 - MIT OpenCourseWare http://ocw.mit.edu 16.323...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . 16.323 Prof. J. P. How Due: Handout #2 Feb 21, 2008 March 6, 2008 16.323 Homework Assignment #2 Any code for this homework should be submitted online using the class web page- do not forget, as it will be graded as part of your solution. 1. Using dynamic programming, find the minimum-time path and time from point A to point B, moving only to the right. The time to travel between points is shown on each segment. Compare the DP result (path and cost) with the forward greedy path (i.e. the one where you just decide the best path of the options available as you move from A to B assuming that you also only move to the right to avoid repeated nodes). 2. The discrete approximation to a nonlinear continuously operating system is given by x k +1 = x k . 4 x k 2 + u k The state and control values are constrained...
View Full Document

Page1 / 3

assn2 - MIT OpenCourseWare http://ocw.mit.edu 16.323...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online