航空学报 > 2015, Vol. 36 Issue (7): 2391-2399   doi: 10.7527/S1000-6893.2014.0352

基于时间约束集的多弹道式飞行器避撞发射时间规划

张思宇, 于剑桥, 李品磊   

  1. 北京理工大学 宇航学院, 北京 100081
  • 收稿日期:2014-08-14 修回日期:2014-12-17 出版日期:2015-07-15 发布日期:2014-12-23
  • 通讯作者: 于剑桥 男, 博士, 教授, 博士生导师。主要研究方向: 飞行器总体设计, 飞行器协同决策与控制。 Tel: 010-68912407 E-mail: jianqiao@bit.edu.cn E-mail:jianqiao@bit.edu.cn
  • 作者简介:张思宇 男, 博士研究生。主要研究方向: 飞行器协同决策与控制, 飞行器总体设计。 Tel: 010-68918614 E-mail: ylww@bit.edu.cn;李品磊 男, 硕士研究生。主要研究方向: 飞行器总体设计, 鲁棒控制。 Tel: 010-68918614 E-mail: woniujidan@163.com
  • 基金资助:

    国家自然科学基金 (61350010)

Multiple ballistic flight vehicles' launch time planning for collision avoidance based on time constraint set

ZHANG Siyu, YU Jianqiao, LI Pinlei   

  1. School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China
  • Received:2014-08-14 Revised:2014-12-17 Online:2015-07-15 Published:2014-12-23
  • Supported by:

    National Natural Science Foundation of China (61350010)

摘要:

提出了通过调整发射时间解决多弹道式飞行器飞行避撞问题的算法框架,在该框架内针对多弹道式飞行器协同打击时是否发生飞行碰撞提出了检验算法,对于飞行器碰撞规避问题建立发射时间约束集模型,约束集由飞行器间发生碰撞的发射时间间隔约束构成。在该时间约束集的基础上建立以多弹道式飞行器同时打击为优化目标、含有不等于号表达式时间约束的优化问题,并通过"Big-M"法将该问题转化为非线性规划问题的标准形式,再利用序列二次规划(SQP)算法进行求解。该框架将发射时间调整问题转化为最优化规划问题,降低了传统遍历性发射时间调整算法的计算复杂度。基于MATLAB平台环境对所提模型及规划算法进行了仿真,验证了所提算法的合理性与有效性,同时具有较高的计算效率。

关键词: 协同攻击, 避撞, 时间约束集, 发射时间优化, 非线性规划

Abstract:

An algorithm framework is presented to solve multiple ballistic flight vehicles' collision avoidance problem by adjusting their launch time. A collision detection algorithm is proposed in the framework for detecting whether there is flight collision or not in multiple ballistic flight vehicles' cooperative attack, and a launch time constraint set model is built in order to solve the collision avoidance problem. The constraint set is constituted by the launch time interval constraints of the flight vehicles in collision. On the foundation of this time constraint set, an optimization problem which regards multiple ballistic flight vehicles' arriving simultaneously as the optimization goals and includes the expression with the sign of inequality constraints is built, and then the "Big-M" method is improved to transform the problem to standard form of nonlinear programming problem which can be solved by sequential quadratic programming (SQP). The method framework transforms the launch time adjusting problem to an optimization planning problem and has reduced the computational complexity compared with the traditional ergodic launch time planning algorithms. With MATLAB platform, simulations have proved the rationality and effectiveness of the proposed method and the method has high computation efficiency.

Key words: cooperative attack, collision avoidance, time constraint set, launch time optimization, nonlinear planning

中图分类号: