Control allocation for a class of morphing aircraft with integer constraints based on Lévy flight
Control allocation for a class of morphing aircraft with integer constraints based on Lévy flight作者机构:Beijing Aerospace Automatic Control InstituteBeijing 100854China National Key Laboratory of Science and Technology on Aerospace Intelligence ControlBeijing 100854China
出 版 物:《Journal of Systems Engineering and Electronics》 (系统工程与电子技术(英文版))
年 卷 期:2020年第31卷第4期
页 面:826-840页
核心收录:
学科分类:08[工学] 081105[工学-导航、制导与控制] 0811[工学-控制科学与工程]
基 金:supported by the National Natural Science Foundation of China(61803357)
主 题:flight control control allocation optimization Lévy flight tracking control
摘 要:Aiming at tracking control of a class of innovative control effector(ICE) aircraft with distributed arrays of actuators, this paper proposes a control allocation scheme based on the Lévy *** from the conventional aircraft control allocation problem,the particular characteristic of actuators makes the actuator control command totally subject to integer constraints. In order to tackle this problem, first, the control allocation problem is described as an integer programming problem with two desired objectives. Then considering the requirement of real-time, a metaheuristic algorithm based on the Lévy flight is introduced to tackling this problem. In order to improve the searching efficiency, several targeted and heuristic strategies including variable step length and inherited population initialization according to feedback and so on are designed. Moreover, to prevent the incertitude of the metaheuristic algorithm and ensure the flight stability, a guaranteed control strategy is designed. Finally, a time-varying simulation model is introduced to verifying the effectiveness of the proposed scheme. The contrastive simulation results indicate that the proposed scheme achieves superior tracking performance with appropriate actuator dynamics and computational time, and the improvements for efficiency are active and the parameter settings are reasonable.