z-logo
Premium
Worst‐case optimal control for an electrical drive system with time‐delay
Author(s) -
Gao Yu,
Kostyukova Olga,
Chong Kil To
Publication year - 2009
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.116
Subject(s) - control theory (sociology) , bounded function , control (management) , optimal control , set (abstract data type) , computation , state (computer science) , computer science , value (mathematics) , control system , construct (python library) , simple (philosophy) , mathematical optimization , control engineering , mathematics , engineering , algorithm , mathematical analysis , philosophy , epistemology , artificial intelligence , machine learning , electrical engineering , programming language
This paper considers an optimal control developed for an electrical drive system with a DC motor. Since it is a linear control system with input time‐delay subject to unknown but bounded disturbances, we construct a worst‐case feedback control policy, which can guarantee that, for all admissible uncertain disturbances, the real system state should be in a prescribed neighborhood of a desired value at the given final time, and the cost functional takes the best guarantee value. The worst‐case feedback control policy is allowed to be corrected at a given set of correction points between the initial and the final time, which is equivalent to solving a (m‐1)‐level min‐max problem. Since the min‐max problem at each stage does not yield a simple analytical solution, construction of the optimal policy is computationally prohibitive. This is why we consider an approximate control policy which is more convenient for computation. The simulation results illustrate that this proposed approach is feasible. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here