Abstract This chapter describes optimisation algorithms suitable for searching of worst-case pilot manoeuvres. The worst-case behaviour is determined by optimization of suitable criteria capturing the maximum departure of important flight parameters (e.g., angle of attack). The search must be performed over a parameter space consisting of pilot inputs, wind perturbations, aerodynamic coefficient’s uncertainties, and initial flight conditions, by applying global and local optimisation techniques. We present an overview of several local methods (pattern search, cyclic coordinate descent, quasi-Newton) and global methods (genetic algorithms, differential evolution, evolution strategies, dividing rectangles). All these methods have been implemented to cope with the special features of the underlying optimization problem (e.g., noisy functions, large parameter space). The application of these methods is described in Chapter 16.
Nonlinear Programming Methods for Worst-Case Pilot Input Determination
01.01.2012
15 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Application of Nonlinear Programming Methods for Determination of Worst-Case Pilot Inputs
Springer Verlag | 2012
|Application of Parallel Nonlinear Programming Methods for Worst-Case Parameter Search
Springer Verlag | 2012
|Worst-Case Parameter Search Based Clearance Using Parallel Nonlinear Programming Methods
Springer Verlag | 2012
|