Nonlinear Programming Methods for Worst-Case Pilot Input Determination
Nonlinear Programming Methods for Worst-Case Pilot Input Determination
复制标题
最坏情况飞行员输入确定的非线性规划方法
DOI：
10.1007/978-3-642-22627-4_11
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
F. Berefelt
中科院分区：
文献类型：
--
作者：
D. Skoogh;F. Berefelt
本章描述适合搜索最坏情况飞行员操作的优化算法。最坏情况的行为是通过优化捕获重要飞行参数（例如迎角）的最大偏离的适当标准来确定的。必须通过应用全局和局部优化技术，在由飞行员输入、风扰动、空气动力学系数的不确定性和初始飞行条件组成的参数空间上执行搜索。我们概述了几种局部方法（模式搜索、循环坐标下降、拟牛顿）和全局方法（遗传算法、差分进化、进化策略、划分矩形）。所有这些方法的实现都是为了应对底层优化问题的特殊特征（例如，噪声函数、大参数空间）。第 16 章介绍了这些方法的应用。
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.