基于MAX-MIN自适应蚁群优化的无人作战飞机航路规划

为了保证无人作战飞机(UCAV)以最小的被发现概率和最优的航程到达目标点,在敌方防御区域内执行任务前必须进行航路规划。蚁群优化(ACO)算法的并行实现机制适合于复杂作战环境下的UCAV航路规划,但是基本ACO算法有易陷于局部最优解的缺点。在对基本ACO算法采用精灵策略保留每次迭代最优解的基础上,提出了一种适用于航路规划的MAX-MIN自适应ACO算法,并给出了改进后ACO算法的实现流程,最后采用改进前后的ACO算法对某UCAV的任务态势分别做了仿真实验。实验结果表明改进后的ACO算法可更加有效地应用于UCAV航路规划。     

基于Radau伪谱法的无人作战飞机四维轨迹规划

针对无人作战飞机(UCAV)打击时敏目标和多机协同攻击问题,提出一种基于Radau伪谱法(RPM)的无人作战飞机四维攻击轨迹规划方法。在综合考虑UCAV气动力特性、大气环境特性基础上建立了高精度UCAV(3-DOF)质点模型,并设计了约束条件和目标函数;基于动态RCS建立威胁模型,构建了最优控制理论框架的UCAV四维攻击轨迹规划模型;通过RPM将动态RCS威胁下的四维攻击轨迹规划问题转换为非线性优化问题,然后利用SNOPT软件包进行求解。仿真结果表明,该方法能够以较快的速度和较高的精度生成满足多种复杂约束条件的四维攻击轨迹。     

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

研究无人作战飞机(UCAV)在对地攻击阶段的武器投放轨迹规划问题.针对传统方法在处理复杂的飞行器运动学、动力学约束上存在的困难,提出了一种基于Gauss伪谱法(GPM)的求解策略.首先,为了最大程度地逼近实际飞行环境,对UCAV的气动力特性、发动机推力特性、油耗特性及大气环境特性进行了高精度拟合,并充分考虑了飞行器各种...     

Real-time trajectory planning for UCAV air-to-surface attack using inverse dynamics optimization method and receding horizon control

This paper presents a computationally efficient real-time trajectory planning framework for typical unmanned combat aerial vehicle (UCAV) performing autonomous air-to-surface (A/S) attack. It combines the benefits of inverse dynamics optimization method and receding horizon optimal control technique. Firstly, the ground attack trajectory planning problem is mathematically formulated as a receding horizon optimal control problem (RHC-OCP). In particular, an approximate elliptic launch acceptable region (LAR) model is proposed to model the critical weapon delivery constraints. Secondly, a planning algorithm based on inverse dynamics optimization, which has high computational efficiency and good convergence properties, is developed to solve the RHCOCP in real-time. Thirdly, in order to improve robustness and adaptivity in a dynamic and uncer- tain environment, a two-degree-of-freedom (2-DOF) receding horizon control architecture is introduced and a regular real-time update strategy is proposed as well, and the real-time feedback can be achieved and the not-converged situations can be handled. Finally, numerical simulations demon- strate the efficiency of this framework, and the results also show that the presented technique is well suited for real-time implementation in dynamic and uncertain environment.     

基于梯度下降法的翼伞系统最优分段航迹规划

传统最优控制航迹规划一般以逆风精确着陆、控制能量小为优化目标，但传统最优控制的操纵过程一般是一条连续变化的曲线，工程上不易实施；与之相比，传统分段航迹规划操纵简单，工程上容易实施，能实现逆风精确着陆的目标，但控制能耗大。为了兼顾逆风精确着陆、能耗低和控制操作简单等目标，提出了一种基于梯度下降法的翼伞最优分段航迹规划方法。该方法将控制变量参数化，将逆风精确着陆、控制能耗小、能实现避障等多目标优化问题转化为加权单目标优化问题，并通过梯度下降法求解得到分段常值最优归航航迹。所提算法与基于伪谱法的最优控制规划航迹和基于遗传算法的分段规划航迹进行了对比，算法仿真结果表明本文提出的最优分段航迹规划法既可以实现着陆精度高、控制能量小、逆风着陆和避障的优化目标，同时规划的航迹又由分段常值实现控制，工程上容易实施，兼顾了最优控制航迹规划和分段航迹规划的优点。     

Trajectory optimization of multiple quad-rotor UAVs in collaborative assembling task

A hierarchic optimization strategy based on the offline path planning process and online trajectory planning process is presented to solve the trajectory optimization problem of multiple quad-rotor unmanned aerial vehicles in the collaborative assembling task. Firstly, the path planning process is solved by a novel parallel intelligent optimization algorithm, the central force optimization-genetic algorithm (CFO-GA), which combines the central force optimization (CFO) algorithm with the genetic algorithm (GA). Because of the immaturity of the CFO, the convergence analysis of the CFO is completed by the stability theory of the linear time-variant discrete-time sys-tems. The results show that the parallel CFO-GA algorithm converges faster than the parallel CFO and the central force optimization-sequential quadratic programming (CFO-SQP) algorithm. Then, the trajectory planning problem is established based on the path planning results. In order to limit the range of the attitude angle and guarantee the flight stability, the optimized object is changed from the ordinary six-degree-of-freedom rigid-body dynamic model to the dynamic model with an inner-loop attitude controller. The results show that the trajectory planning process can be solved by the mature SQP algorithm easily. Finally, the discussion and analysis of the real-time per-formance of the hierarchic optimization strategy are presented around the group number of the waypoints and the equal interval time.     

基于改进的粒子群优化算法的无人作战飞机航路规划

事先针对敌方防御区内的威胁部署和目标的分布情况,对无人作战飞机的飞行航路进行整体规划设计,可以综合减小被敌方发现和反击的可能性、降低耗油量,从而显著提高UCAV执行对地攻击(或侦察)任务的成功率.在对粒子群优化技术研究的基础上,将一种用于解决TSP的PSO算法加以改进,引入模拟退火的策略思想,借以克服PSO算法易陷局部最优的早熟现象,并在UCAV航路规划中加以运用.仿真实验表明,该算法简易而有效,用其优化出的航路能够满足UCAV飞行任务规划的需要.     

无人艇航行规则及运动学约束下的改进RRT轨迹规划方法

现有的RRT算法没有考虑无人艇的运动特性,难以解决无人艇轨迹规划问题,也没有基于无人艇航行规则来考虑无人艇的动态避碰。针对上述问题,在无人艇航行规则及运动学约束下,提出了改进的双层RRT动态轨迹规划方法。在第一层框架中,改进了探索点及步长选择策略,并结合国际海上避碰规则公约与最短会遇时间建立最优位置窗口来构造四向扩展随机树,从而可以在考虑海事规则的前提下快速搜索出联通路径。在第二层框架中,考虑到无人艇的运动学约束,将上一层的联通路径点作为分段启发点,然后结合速度运动模型来限制无人艇的拐角与转弯半径,并基于速度运动模型得到的弧长计算出每一个节点的代价值,最终在动态障碍物环境中得到一条可行平滑轨迹。仿真与实船实验均验证了该改进算法的有效性,实验表明该改进算法可以有效地解决传统RRT算法离障碍物过近、路径不平滑、不符合无人艇运动学与无人艇航行规则等问题。其中,轨迹转折数目为0,与障碍物最近距离是传统RRT算法的两倍以上,最大转折角度指标远好于传统RRT算法。     

不同作战任务条件下的UCAV航路规划问题建模

UCAV航路规划是充分发挥UCAV作战优势、使任务复杂性与UCAV能力之间保持良好协调性所必须解决的关键问题。在分析UCAV航路规划技术的基本概念和基本要求的基础上,针对不同作战任务条件下的UCAV航路规划问题进行了建模研究,分别建立了单UCAV航路规划、单UCAV多航路规划以及多UCAV协同航路规划等数学模型。     

基于凸优化的再入轨迹三维剖面规划方法

可重复使用飞行器一般采用大升阻比气动外形，再入轨迹三维剖面规划方法可充分发挥这类飞行器固有的机动能力。计算量大是制约三维剖面规划应用的难题，为提高计算效率，提出了一种基于凸优化的再入轨迹三维剖面规划方法。首先，分析运动方程特性，利用定义新的控制变量、约束松弛、连续线性化等技术，将原始非凸的三维剖面规划问题转化为一个凸优化问题。其次，将指令反解步骤嵌入至序列凸化算法中，通过迭代求解凸优化子问题，获得原问题的可行解。数值仿真结果表明所提方法具有较高的求解精度和确定的收敛性质，飞行器的机动能力得到充分发挥；与伪谱法的结果对比表明凸优化方法在轨迹规划问题上具有更高的求解效率。     

复杂环境下翼伞系统的组合式航迹规划

传统翼伞系统的航迹规划主要考虑落点精度及逆风着陆等指标,而当空投区域环境较为复杂,在翼伞系统归航路径上存在障碍时,如何规避这些障碍也成为翼伞系统航迹规划所必须要考虑的因素。针对翼伞空投过程有可能遇到高山或者高大建筑物阻碍的问题,提出了一种复杂环境下翼伞系统的组合式航迹规划策略。该方法将翼伞空投的区域分为障碍区和着陆区,在障碍区中采用快速搜索随机树（RRT）算法进行可行路径搜索,考虑到RRT算法生成的轨迹包含棱角,导致路径不够平滑的问题,结合翼伞系统质点模型的运动特性,对其进行了适用性改进,以使规划的航迹满足实际翼伞空投需求。为了解决RRT算法搜索方向随机,难以满足逆风着陆的问题,当翼伞系统进入着陆区后采用分段归航的方式设计航迹,并借助遗传算法（GA）求解目标参数,实现翼伞系统能量控制及逆风着陆。提出的复杂环境下翼伞系统的组合式航迹规划策略求解速度较快,能够同时满足翼伞系统避障、能量控制及逆风着陆要求,得到的参考航迹较为平滑。     

基于三维空域网格的低空飞行航迹战略规划方法

针对复杂低空环境下航空应急救援飞行安全问题,提出了一种基于三维空域网格的飞行航迹战略规划方法。将空域网格化分成多个飞行航迹节点,同时考虑地形、气象、飞行规则以及航空器性能等多种约束,使用改进的A*算法搜索单个航空器的最优飞行航迹。在单个航空器初始飞行航迹基础上,结合时间窗原理,提出两种方法解决了多机无冲突航迹战略规划问题。最后,通过案例仿真验证了方法的有效性。     

High-fidelity trajectory optimization for aeroassisted vehicles using variable order pseudospectral method

In this study, the problem of time-optimal reconnaissance trajectory design for the aeroassisted vehicle is considered. Different from most works reported previously, we explore the feasibility of applying a high-order aeroassisted vehicle dynamic model to plan the optimal flight trajectory such that the gap between the simulated model and the real system can be narrowed. A highly-constrained optimal control model containing six-degree-of-freedom vehicle dynamics is established. To solve the formulated high-order trajectory planning model, a pipelined optimization strategy is illustrated. This approach is based on the variable order Radau pseudospectral method, indicating that the mesh grid used for discretizing the continuous system experiences several adaption iterations. Utilization of such a strategy can potentially smooth the flight trajectory and improve the algorithm convergence ability. Numerical simulations are reported to demonstrate some key features of the optimized flight trajectory. A number of comparative studies are also provided to verify the effectiveness of the applied method as well as the high-order trajectory planning model.     

Robust trajectory planning for UAV communication systems in the presence of jammers

Unmanned Aerial Vehicle (UAV) has emerged as a promising novel application for the Sixth-Generation (6G) wireless communication by leveraging more favorable Line-of-Sight (LoS) propagation. However, the jamming resistance by exploiting UAV’s mobility is a new challenge in the UAV-ground communication. This paper investigates the trajectory planning problem in an UAV communication system, where the UAV is operated by a Ground Control Unit (GCU) to perform certain tasks in the presence of multiple jammers with imperfect power and location information. To ensure the reliability of the GCU-to-UAV link, we formulate the problem as a non-convex semi-infinite optimization, aiming to maximize the average worst-case Signal-to-Interference-plus-Noise Ratio (SINR) over a given flight duration by designing the robust trajectory of the UAV under stringent energy availability constraints. To handle this problem efficiently, we develop an iterative algorithm for the solution with the aid of S-procedure and Successive Convex Approximation (SCA) method. Numerous results demonstrate the efficacy of our proposed algorithm and offer some useful design insights to practical system.     

基于数字地图预处理的低空突防航迹规划

为保证飞行器能够实现所规划的航迹,研究了将地形及飞行器性能等信息融合构造虚拟地形表面的数字地图预处理方法,包括数据插值具体步骤和地形平滑处理方法。通过设计综合地形跟随、地形回避、威胁回避(TF/TA2)的目标函数,对最小威胁曲面进行转化,提高了实时航迹规划的速度,采用微分进化(DE)优化算法,实现了三维TF/TA2最优实时航迹规划。仿真结果表明,此地图预处理和实时航迹规划算法是有效可行的。     

Reentry trajectory optimization for hypersonic vehicle satisfying complex constraints

The reentry trajectory optimization for hypersonic vehicle（HV）is a current problem of great interest.Some complex constraints,such as waypoints for reconnaissance and no-fly zones for threat avoidance,are inevitably involved in a global strike mission.Of the many direct methods,Gauss pseudospectral method（GPM）has been demonstrated as an effective tool to solve the trajectory optimization problem with typical constraints.However,a series of diffculties arises for complex constraints,such as the uncertainty of passage time for waypoints and the inaccuracy of approximate trajectory near no-fly zones.The research herein proposes a multi-phase technique based on the GPM to generate an optimal reentry trajectory for HV satisfying waypoint and nofly zone constraints.Three kinds of specifc breaks are introduced to divide the full trajectory into multiple phases.The continuity conditions are presented to ensure a smooth connection between each pair of phases.Numerical examples for reentry trajectory optimization in free-space flight and with complex constraints are used to demonstrate the proposed technique.Simulation results show the feasible application of multi-phase technique in reentry trajectory optimization with waypoint and no-fly zone constraints.     

基于Voronoi图和蚁群算法的无人机航迹规划

为提高无人机任务环境模拟的真实性,利用改进后的Voronoi图对任务环境进行建模。同时,为了更快地生成一条满足任务需求的最优飞行航迹,提高航迹规划的实战性和高效性,分析了蚁群航迹规划算法的运行原理,以及算法运行机制对算法性能的影响,提出了算法的改进原则,并在此基础上给出了新的信息素更新方式和新的启发式。利用改进后的蚁群算法,在改进型Voronoi图上进行了无人机航迹规划。计算机仿真结果表明,改进后的蚁群航迹规划算法与传统的蚁群航迹规划算法相比,运行时间更短,收敛速度更快,且得到最优航迹的概率更高,验证了算法改进原则的有效性。     

基于ROS的机械臂轨迹规划研究

针对机械臂轨迹规划中算法复杂、开发难度高的技术难点,提出基于一款开源软件平台(Robot Operating System,ROS)为机械臂搭建控制系统的方法作为解决方案.在此基础上,设计了一种基于五次多项式插值的算法来弥补该开源软件平台中关于轨迹规划功能的不足,并通过仿真实验验证了改进后的控制算法可以提高机械臂控制性能.该方法对于实现工程机械臂轨迹规划问题具有普遍的指导意义.     

基于动力学RRT*的自由漂浮空间机器人轨迹规划

针对自由漂浮空间机器人（FFSR）轨迹规划问题,提出了一种基于动力学RRT^*算法的FFSR轨迹规划方法。首先,建立了FFSR的运动学与动力学模型,将系统模型伪线性重构为状态空间模型,并设计了考虑位姿调整时长和能量消耗的加权目标函数;然后,针对机械手初末位置间的障碍,简化避障方法,提出了机械臂避障与机械手避障两层次避障策略,提高碰撞检测效率;接着,给出了多体系统的动力学RRT^*逼近最优轨迹的方法;最后,为验证算法有效性并不失一般性,选取平面2连杆FFSR模型进行数值仿真并用经典RRT^*算法和高斯伪谱法与之对比。仿真结果表明,该方法能够以较快的速度生成可行的机器人移动轨迹。     

复杂环境下考虑动力学约束的翼伞轨迹规划

翼伞系统具有大惯性、强非线性等特征,而基于传统质点模型所规划的目标轨迹难以满足复杂环境下的系统动力学约束,因此在轨迹规划中采用高自由度动力学模型也就成为了计算翼伞真实运动轨迹的必然趋势。然而,翼伞的动力学模型更加复杂,目前迫切需要解决的问题就是保证规划轨迹平滑、稳定。针对该问题,本文将建立精确的翼伞六自由度动力学模型,将其引入翼伞归航的轨迹规划中,并通过改进高斯伪谱法,设计一种基于分段点规划、离散点初次规划、离散点自重构的三阶轨迹优化策略。仿真结果表明,所提算法可解决传统算法在应用动力学模型后难以得到稳定轨迹的问题,并实现复杂环境下的精确地形规避,确保规划轨迹满足翼伞的非线性动力学约束。