航空学报 > 2011, Vol. 32 Issue (7): 1240-1251   doi: CNKI:11-1929/V.20101228.1334.003

基于Gauss伪谱法的UCAV对地攻击武器投放轨迹规划

张煜, 张万鹏, 陈璟, 沈林成   

  1. 国防科学技术大学 机电工程与自动化学院, 湖南 长沙 410073
  • 收稿日期:2010-11-02 修回日期:2010-12-08 出版日期:2011-07-25 发布日期:2011-07-23
  • 作者简介:张煜(1981- ) 男,博士研究生。主要研究方向:飞行器任务规划与智能控制。 Tel: 0731-84576495 E-mail: redarmy_zy@163.com 陈璟(1972- ) 男,博士,副教授。主要研究方向:人工智能与任务规划。 Tel: 0731-84576495 E-mail: chenjing001@vip.sina.com

Air-to-ground Weapon Delivery Trajectory Planning for UCAVs Using Gauss Pseudospectral Method

ZHANG Yu, ZHANG Wanpeng, CHEN Jing, SHEN Lincheng   

  1. College of Mechatronics Engineering and Automation, National University of Defense Technology, Changsha 410073, China
  • Received:2010-11-02 Revised:2010-12-08 Online:2011-07-25 Published:2011-07-23

摘要: 研究无人作战飞机(UCAV)在对地攻击阶段的武器投放轨迹规划问题。针对传统方法在处理复杂的飞行器运动学、动力学约束上存在的困难,提出了一种基于Gauss伪谱法(GPM)的求解策略。首先,为了最大程度地逼近实际飞行环境,对UCAV的气动力特性、发动机推力特性、油耗特性及大气环境特性进行了高精度拟合,并充分考虑了飞行器各种飞行性能约束和战场环境约束;其次,采用快速求解算法计算制导炸弹的可投放区(LAR)包络,将其作为终端约束来确保攻击的命中概率;然后利用GPM将轨迹规划问题转化为非线性规划问题,在此基础上采用序列二次规划(SQP)算法求得最优解。为了提升计算效率及降低初值设置的难度,设计了多步迭代优化策略。对时间最优和燃料最优轨迹优化问题进行了仿真验证,结果表明该方法能够以较高的精度和速度生成真实可行的最佳武器投放轨迹。

关键词: 轨迹规划, 最优控制, Guass伪谱法, 动力学约束, 序列二次规划, 无人作战飞机, 可投放区

Abstract: This paper studies the issue of generating optimal air-to-ground guided bomb delivery trajectories for unmanned combat aerial vehicles (UCAVs), and proposes a strategy based on the Gauss pseudospectral method (GPM) to deal with difficulties of traditional methods in processing vehicle kinematic and dynamic constraints. First, a high-fidelity 3-DOF nonlinear model of a UCAV is built which takes into consideration its aerodynamic characteristics, thrust and fuel consumption characteristics and atmospheric characteristics. Second, a fast algorithm is developed for searching the envelope of a guided bomb’s launch acceptable region (LAR), which is expressed as a final constraint in order to ensure attack accuracy. Third, GPM transforms the trajectory planning problem into a nonlinear programming problem, which can be solved using a sequential quadratic programming (SQP) algorithm. To improve computation efficiency and reduce the complexity of initial guess, a multistage iterative optimization strategy is presented. Finally, numerical examples for a minimum time-consumption trajectory as well as a minimum fuel-consumption trajectory are used to demonstrate the merits of the proposed algorithm. The results show that the algorithm can generate both feasible and optimal weapon delivery trajectories.

Key words: trajectory planning, optimal control, Gauss pseudospectral method, dynamic constraint, sequential quadratic programming, unmanned combat aerial vehicle, launch acceptable region

中图分类号: