针对低速目标的飞行器中段航迹快速规划
Flight vehicle midcourse trajectory fast planning for low-speed target
熊子淳 1刘永善1
作者信息
- 1. 北京理工大学宇航学院,北京 100081
- 折叠
摘要
针对长航程飞行器打击低速舰船目标的问题,提出一种基于滚动序列凸优化算法的中段航迹快速规划算法.使用滚动规划框架将航迹更新问题转化为初始与终端位置更新后的单次航迹规划子问题,构造多约束凸优化问题并使用序列凸优化算法求解.提出滚动规划周期收缩策略,减少航迹更新次数.设计了一种改进参考航迹生成算法并使用了信赖域自适应收缩策略,在保证规划效果的同时有效提高计算速度.仿真结果表明,该算法规划效果优良,可满足在线规划的要求,且与一般的滚动序列凸优化航迹规划算法相比速度更快.
Abstract
A midcourse flight trajectory planning algorithm based on receding sequential convex programming algorithm is proposed for a long-range flight vehicle to strike low-speed ship target.Using a receding planning framework,the trajectory update problem is transformed into a trajectory planning subproblem after initial and terminal position updates.Then,a multi-constraint convex optimization problem is constructed and solved using sequential convex programming algorithm.A receding planning cycle contraction strategy is designed to reduce the number of trajectory updates.An improved reference trajectory generation algorithm is designed and a trust region adaptive shrinkage strategy is used to effectively improve the computational speed while ensuring the planning effect.Simulation results show that the algorithm has fine planning results and can meet the online planning requirements.The computational speed is faster compared with usual receding sequential convex programming trajectory planning algorithms.
关键词
飞行器/航迹规划/凸优化/滚动规划框架/移动目标Key words
flight vehicle/trajectory planning/convex optimization/receding planning framework/moving target引用本文复制引用
出版年
2024
NETL
NSTL
万方数据