摘要
针对单炮多发应用场景,研究在时间、空间协同等多约束条件下的滑翔制导炮弹快速协同弹道规划问题。为平衡序列凸优化(Sequential Convex Programming,SCP)算法在快速性与最优性之间的冲突,提出一种改进的SCP算法;考虑到多约束条件下可行域较小、初值敏感性较高的特点,设计两种迅速且有效的迭代初值生成方案;为充分发挥弹群整体控制能力,采取集中式的协同规划策略,同步求解所有方程组,以达成全局规划目标。仿真实验结果表明,新算法能够较好地解决多约束条件下的协同规划问题,与现有文献中的常见算法进行对比,具备良好的收敛性能和较高的计算效率。
The rapid cooperative trajectory planning problem of glide-guided projectiles under multiple constraint conditions,such as time-spatial coordination,in single-gun multi-shot application scenarios is investigated An improved SCP strategy is proposed to balance the conflict between rapidity and optimality in sequential convex programming(SCP)method.Considering the small feasible region and high sensitivity to initial values under multiple constraints,two fast and effective iterative initial value generation schemes are designed.Aiming to fully exploit the overall control capability of projectile group,a centralized cooperative planning strategy is employed to solve all equation sets simultaneously.Simulated results demonstrate that the proposed method can effectively address the cooperative planning problem under multiple constraints,exhibiting good convergence performance and high computational efficiency.
作者
尹秋霖
陈琦
王中原
王庆海
YIN Qiulin;CHEN Qi;WANG Zhongyuan;WANG Qinghai(School of Energy and Power Engineering,Nanjing University of Science and Technology,Nanjing 210094,Jiangsu,China)
出处
《兵工学报》
EI
CAS
CSCD
北大核心
2024年第3期798-809,共12页
Acta Armamentarii
基金
国家自然科学基金项目(52202475)
江苏省自然科学基金项目(BK20200498)。
关键词
滑翔制导炮弹
协同弹道规划
单炮多发
多约束
快速规划
glide-guided projectiles
cooperative trajectory planning
single-gun multi-shot
multiple constraints
rapid planning
