{{cds110b-wi06}}
This lecture provides an overview of optimal control theory. Beginning with a review of optimization, we introduce the notion of Lagrange multipliers and provide a summary of the Pontryagin's maximum principle. __NOTOC__

== Lecture Outline ==
<ol type=I>
<li> Introduction: two degree of freedom design and trajectory generation
<li> Review of optimization: necessary conditions for extrema, with and without constraints
<li> Optimal control: Pontryagin Maximum Principle
<li> Examples: bang-bang control and Caltech ducted fan (if time)
</ol>

== Lecture Materials ==
* {{cds110b-pdfs|L1-2_Optimal.pdf|Lecture Presentation}}
* {{cds110b-pdfs|optimal.pdf|Lecture notes on optimal control}}
* {{cds110b-pdfs|hw1.pdf|Homework 1}}

== References and Further Reading ==
* {{cds110b-pdfs|LS95-optimal.pdf|Excerpt from LS95 on optimal control}} - This excerpt is from [http://books.google.com/books?ie=UTF-8&hl=en&vid=ISBN0471033782&id=jkD37elP6NIC Lewis and Syrmos, 1995] and gives a derivation of the necessary conditions for optimaliity. A few pages have been left out from the middle that contained some additional examples (which you can find in similar books in the library, if you are interested). Other parts of the book can be searched via [http://books.google.com Google Books] and purchased online.
* [http://www.cds.caltech.edu/~macmardg/cds110b/pontryagin.pdf Notes on Pontryagin's Maximum Principle] (courtesy of Doug MacMynowski) - this comes from a book on dynamic programming (DP) and uses a slightly different notation than we used in class.

== Frequently Asked Questions ==

'''Q: In the example on Bang-Bang control discussed in the lecture, how is the control law for <math>u</math> obtained?'''

<blockquote>
<p>Pontryagin's Maximum Principle says that <math>u</math> has to be chosen to minimise the Hamiltonian <math>H(x,u,\lambda)</math> for given values of <math>x</math> and <math>\lambda</math>. In the example, <math>H = 1 + ({\lambda}^TA)x + ({\lambda}^TB)u</math>. At first glance, it seems that the more negative <math>u</math> is the more <math>H</math> will be minimised. And since the most negative value of <math>u</math> allowed is <math>-1</math>, <math>u=-1</math>. However, the co-efficient of <math>u</math> may be of either sign. Therefore, the sign of <math>u</math> has to be chosen such that the sign of the term <math>({\lambda}^TB)u</math> is negative. That's how we come up with <math>u = -sign({\lambda}^TB)</math>.</p>

<p>Shaunak Sen, 12 Jan 06</p>
</blockquote>

'''Q: Notation question for you: In the Lecture notes from Wednesday, I'm assuming that <math>T</math> is the final time and <sup><math>T</math></sup> (superscript T) is a transpose operation. Am I correct in my assumption?'''

<blockquote>
<p>Yes, you are correct.</p>

<p>Jeremy Gillula, 07 Jan 05</p>
</blockquote>

'''Q: What do you mean by penalizing something, from Q>=0 "penalizes" state error?'''

<blockquote>
<p>According to the form of the quadratic cost function <math>J</math>, there are three quadratic terms such
as <math>x^T Q x</math>, <math>u^T R u</math>, and <math>x(T)^T P_1 x(T)</math>. When <math>Q \geq 0</math> and if <math>Q</math> is relative big, the value of <math>x</math> will have bigger contribution to the value of <math>J</math>. In order to keep <math>J</math> small, <math>x</math> must be relatively small. So selecting a big <math>Q</math> can keep <math>x</math> in small value regions. This is what the "penalizing" means.</p>

<p>So in the optimal control design, the relative values of <math>Q</math>, <math>R</math>, and <math>P_1</math> represent how important <math>X</math>, <math>U</math>, and <math>X(T)</math> are in the designer's concerns.</p>

<p>Zhipu Jin,13 Jan 03</p>
</blockquote>