Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T05:50:38.271Z Has data issue: false hasContentIssue false

AN EFFICIENT COMPUTATIONAL APPROACH TO A CLASS OF MINMAX OPTIMAL CONTROL PROBLEMS WITH APPLICATIONS

Published online by Cambridge University Press:  20 May 2010

B. LI*
Affiliation:
Harbin Institute of Technology, PR China (email: g.r.duan@hit.edu.cn) Curtin University of Technology, Australia (email: bin.li@postgrad.curtin.edu.au, k.l.teo@curtin.edu.au)
K. L. TEO
Affiliation:
Harbin Institute of Technology, PR China (email: g.r.duan@hit.edu.cn) Curtin University of Technology, Australia (email: bin.li@postgrad.curtin.edu.au, k.l.teo@curtin.edu.au)
G. H. ZHAO
Affiliation:
Dalian University of Technology, PR China (email: ghzhao6961@hotmail.com)
G. R. DUAN
Affiliation:
Harbin Institute of Technology, PR China (email: g.r.duan@hit.edu.cn)
*
For correspondence; e-mail: bin.li@postgrad.curtin.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, an efficient computation method is developed for solving a general class of minmax optimal control problems, where the minimum deviation from the violation of the continuous state inequality constraints is maximized. The constraint transcription method is used to construct a smooth approximate function for each of the continuous state inequality constraints. We then obtain an approximate optimal control problem with the integral of the summation of these smooth approximate functions as its cost function. A necessary condition and a sufficient condition are derived showing the relationship between the original problem and the smooth approximate problem. We then construct a violation function from the solution of the smooth approximate optimal control problem and the original continuous state inequality constraints in such a way that the optimal control of the minmax problem is equivalent to the largest root of the violation function, and hence can be solved by the bisection search method. The control parametrization and a time scaling transform are applied to these optimal control problems. We then consider two practical problems: the obstacle avoidance optimal control problem and the abort landing of an aircraft in a windshear downburst.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2010

References

[1]Arkin, R., Behavior-based robotics (MIT Press, Cambridge, MA, 1998).Google Scholar
[2]Axelsson, H., Egerstedt, M. and Wardi, Y., “Reactive robot navigation using optimal timing control”, Proc. of the American Control Conference (2005) 49294934.Google Scholar
[3]Boccadoro, M., Wardi, Y., Egerstedt, M. and Verriest, E., “Optimal control of switching surfaces in hybrid dynamical systems”, Discrete Event Dyn. Syst. 15 (2005) 433448.Google Scholar
[4]Bulirsch, R., Montrone, F. and Pesch, H. J., “Abort landing in the presence of windshear as a minmax optimal control problem, Part 1: Necessary conditions”, J. Optim. Theory Appl. 70 (1991) 123.Google Scholar
[5]Bulirsch, R., Montrone, F. and Pesch, H. J., “Abort landing in the presence of windshear as a minmax optimal control problem, Part 2: Multiple shooting and homotopy”, J. Optim. Theory Appl. 70 (1991) 223254.Google Scholar
[6]Goh, C. J. and Teo, K. L., “Alternative algorithms for solving nonlinear function and functional inequalities”, Appl. Math. Comput. 41 (1991) 159177.Google Scholar
[7]Jennings, L. S., Fisher, M. E., Teo, K. L. and Goh, C. J., “Miser3, Optimal control software version 3: Theory and user manual” Centre for Applied Dynamics and Optimization, The University of Western Australia, URL: http://www.cado.uwa.edu.au/miser/manual.html, 2004.Google Scholar
[8]Miele, A., “Aircraft survival in windshear flight”, in: Mechanics and control, Volume 151 of Lecture Notes in Control and Information Sciences (eds J. M. Skowronski, H. Flashner and R. S. Guttalu) (Springer-Verlag, Berlin, 1991) 281–294.Google Scholar
[9]Teo, K. L., Goh, C. J. and Wong, K. H., A unified computational approach for optimal control problems (Longman Scientific and Technical, New York, 1991).Google Scholar
[10]Teo, K. L., Jennings, L. S., Lee, H. W. J. and Rehbock, V. L., “The control parameterization enhancing transformation for constrained optimal control problems”, J. Aust. Math. Soc. Ser. B 40 (1997) 314335.CrossRefGoogle Scholar
[11]Teo, K. L. and Yang, X. Q., “A root finding approach for continuous minmax optimal control problems”, Nonlinear Stud. 4 (1997) 3752.Google Scholar