Optimal Control Problem, Quasi-Assignment Problem and Genetic Algorithm

Authors: Omid S. Fard, Akbar H. Borzabadi

Abstract:

In this paper we apply one of approaches in category of heuristic methods as Genetic Algorithms for obtaining approximate solution of optimal control problems. The firs we convert optimal control problem to a quasi Assignment Problem by defining some usual characters as defined in Genetic algorithm applications. Then we obtain approximate optimal control function as an piecewise constant function. Finally the numerical examples are given.

Keywords: Optimal control, Integer programming, Genetic algorithm, Discrete approximation, Linear programming.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1084990

References:

[1] L. C. Young, "Calculus of Variation and Optimal Control Theory", Philadelphia: W.B Saunders, 1969.
[2] J. Vlassenbroeck, "A chebyshev polynomail method for optimal control with bounded state constraints", J. Automatica, Vol. 24, pp. 499-506, 1988.
[3] H. Maurer and W. Gillessen, "Application of multiple shooting to the numerical solution of optimal with bounded state variables", J. Computing, Vol 15, pp. 105-126,1975.
[4] G. Fraser Andrews, "Shooting method for the numerical solution of optimal control problems with bounded state variable", J. Optimization Theory and Applications, Vol 89, pp. 351-372, 1996.
[5] J. E. Rubio, "Control and Optimization, The Linear Treatment of Non- linear Problems", Manchester University Press, England, 1986.
[6] K. L. Teo, C.J. Goh, and K.H. Wong,"A unifed computational approach to optimal control problems", Longman Scientific and Tech- nical, 1991.