On Global Search for Non-Convex Optimal Control Problems
In this paper we consider non-convex optimal control problems having the same goal: to maximize a convex function of the terminal state. A global search algorithm is given. The first numerical tests have been performed.
KeywordsLocal Search Optimal Control Problem Global Search Admissible Control Local Search Algorithm
Unable to display preview. Download preview PDF.
- 2.Vasiliev, F.P. (1988), Numerical Methods of Extremum Problems Solving, Moscow, Nauka (in Russian).Google Scholar
- 4.Krotov, V.F. and Gurman V.I. (1973), Methods and problems of Optimal Control, Moscow, Nauka (in Russian).Google Scholar
- 5.Srochko, V.A. (1989), Variational Maximum Principle and Linearization Methods in Optimal Control Problems, Irkutsk State University (in Russian).Google Scholar
- 7.Strekalovsky, A.S. (1993), On Global Maximum Search of a Convex Function over a Feasible Set. Journal of Computational Mathematics and Mathematical Physics, vol. 33, N 3, pp. 315–328, Pergamon Press Ltd.Google Scholar