Discrete approximation of relaxed optimal control problems
- 62 Downloads
We consider a general nonlinear optimal control problem for systems governed by ordinary differential equations with terminal state constraints. No convexity assumptions are made. The problem, in its so-called relaxed form, is discretized and necessary conditions for discrete relaxed optimality are derived. We then prove that discrete optimality [resp., extremality] in the limit carries over to continuous optimality [resp., extremality]. Finally, we prove that limits of sequences of Gamkrelidze discrete relaxed controls can be approximated by classical controls.
Key WordsOptimal control nonlinear systems discretization nonconvexity relaxed controls approximation
Unable to display preview. Download preview PDF.
- 1.McShane, E. J.,Generalized Curves, Duke Mathematical Journal, Vol. 6, pp. 513–536, 1940.Google Scholar
- 2.Warga, J.,Optimal Control of Differential and Functional Equations, Academic Press, New York, New York, 1972.Google Scholar
- 3.Chryssoverghi, I.,Numerical Approximation of Nonconvex Optimal Control Problems Defined by Parabolic Equations, Journal of Optimization Theory and Applications, Vol. 45, pp. 73–88, 1985.Google Scholar
- 4.Chryssoverghi, I.,Nonconvex Optimal Control of Nonlinear Monotone Parabolic Systems, Systems and Control Letters, Vol. 8, pp. 55–62, 1986.Google Scholar
- 5.Warga, J.,Steepest Descent with Relaxed Controls, SIAM Journal on Control and Optimization, Vol. 15, pp. 674–682, 1977.Google Scholar
- 6.Cullum, J.,An Explicit Procedure for Discretizing Continuous Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 8, pp. 14–34, 1971.Google Scholar