Premium
Application of real/mixed μ computational techniques to an H ∞ missile autopilot
Author(s) -
Ferreres G.,
Fromion V.,
Duc G.,
M'Saad M.
Publication year - 1996
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/(sici)1099-1239(199610)6:8<743::aid-rnc187>3.0.co;2-o
Subject(s) - missile , autopilot , aerodynamics , singular value , parametric statistics , control theory (sociology) , actuator , interval (graph theory) , polynomial , stability (learning theory) , value (mathematics) , mathematics , upper and lower bounds , computer science , algorithm , control (management) , engineering , control engineering , mathematical analysis , aerospace engineering , artificial intelligence , physics , eigenvalues and eigenvectors , statistics , quantum mechanics , combinatorics , machine learning
A multivariable missile autopilot is synthesized using an H ∞ approach. A tradeoff is achieved between performance, actuators solicitation and uncertainties in the actuators and bending modes dynamics. Robust stability and performance of the control law are then studied in the face of large real parametric aerodynamic uncertainties: computational techniques for real and mixed μ analysis (namely De Gaston and Safonov's, Dailey's, Jones’, Young and Doyle's, Fan, Tits and Doyle's and Safonov and Lee's methods) are briefly reviewed before being used to compute either the exact value, or an interval of the structured singular value (SSV). For small amounts of parameters, the upper and lower bounds provided by these methods are compared to the exact value, computed by De Gaston and Safonov's method. For larger amounts of parameters, NP hardness of the problem prohibits the use of algorithms which compute the exact value: these algorithms are indeed necessarily exponential‐time. As an alternative in this case, the use of polynomial‐time methods for computing upper and lower bounds leads in our examples to accurate approximates of the real and mixed structured singular values.