Journal
SIAM JOURNAL ON CONTROL AND OPTIMIZATION
Volume 47, Issue 4, Pages 1643-1666Publisher
SIAM PUBLICATIONS
DOI: 10.1137/070685051
Keywords
nonlinear control; optimal control; semidefinite programming; measures; moments
Categories
Funding
- French National Research Agency (ANR) [NT05-3-41612]
Ask authors/readers for more resources
We consider the class of nonlinear optimal control problems (OCPs) with polynomial data, i.e., the differential equation, state and control constraints, and cost are all described by polynomials, and more generally for OCPs with smooth data. In addition, state constraints as well as state and/or action constraints are allowed. We provide a simple hierarchy of LMI- (linear matrix inequality)-relaxations whose optimal values form a nondecreasing sequence of lower bounds on the optimal value. Under some convexity assumptions, the sequence converges to the optimal value of the OCP. Preliminary results show that good approximations are obtained with few moments.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available