基于高斯伪谱法的翼伞系统复杂多约束轨迹规划

翼伞系统在实际环境中飞行时易受到风场以及地形环境等复杂干扰的影响,无法精确归航,控制难度较大。针对该问题,提出了一种针对复杂多约束条件的翼伞系统的最优控制轨迹规划方法,可同时实现翼伞系统在复杂环境下逆风对准、精确着陆以及控制量全局最优的控制目标。首先,建立了风场干扰下的翼伞系统模型;然后,通过引入地形环境曲面,将复杂环境转化为实时路径约束,将轨迹着陆偏差以及逆风雀降转化为终端约束,并考虑控制量消耗最小为目标函数,以此将复杂环境下的翼伞系统的轨迹优化转化为一系列非线性的带有复杂约束的最优控制问题;最后,采用高斯伪谱法将多约束最优控制问题转化为易于求解的非线性规划问题。通过设立3组复杂环境仿真实例和实验验证,表明本文方法使翼伞系统在多种较恶劣的复杂环境中有效应对多类约束条件,规划出控制量全局最优的可行轨迹。与已有的混沌粒子群优化算法相比,本文方法具有较好的最优性和较高的精度。     

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

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

基于不规则障碍物环境下无人机的改进几何路径规划算法

随着无人机应用环境的多样化,在复杂环境中寻找无碰撞路径是非常重要的。传统的路径规划算法可以找到可行的路径,但它们在时间效率和路径长度之间没有很好的平衡,传统的几何算法只能避免特殊形状的障碍物。提出了一种改进的几何路径规划算法,使无人机能够在复杂的环境中避开任意形状的障碍物,找到较短的路径。首先,针对不规则障碍物,建立了凸多边形覆盖模型。然后解决了传统几何算法陷入局部最优解的缺点。提出了从相邻路径段生成无碰撞路径的二次规划思想,并针对该方法提出了一种新的安全阀值策略。最后,为了验证算法的性能,在不同的复杂环境下进行了仿真,并从几个方面对所提出的算法与A*算法进行了对比分析。     

基于蚁群算法的无人机三维路径规划与冲突解脱

针对传统无人机路径规划方法难以满足无人机在复杂山区环境应用这一缺点,提出一种基于蚁群算法并利用插值算法和容斥算法优化的无人机三维路径规划算法。通过无人机飞行约束条件和对蚁群算法的优化在所建立的三维空间中得到最优路径。利用二次、三次样条插值、容斥算法等优化算法对无人机路径优化,规划出一条更加平滑的便于无人机执行的最佳路径,并建立了无人机冲突约束,解决了无人机冲突。     

卫星编队队形重构避碰技术研究

提出了一种新的考虑避碰约束的编队队形重构路径规划方法.首先通过常规编队重构规划方法得出各星的机动策略,以此预测重构过程中各星最小距离,将此最小距离大于安全距离作为约束条件,重新规划出队形重构轨迹.仿真结果表明,该方法计算量小,能够快速地规划出考虑避碰约束时的队形重构卫星机动轨迹,且能有效节省能量消耗.     

众多临近空间飞行器的最优轨迹规划

针对众多临近空间飞行器在复杂飞行环境的最优轨迹规划问题,采用改进的动态规划法和基于共轭梯度法的多点边值组合算法求解了多目标优化问题,得到了全部飞行器的最优飞行轨迹.仿真结果表明,该算法能够在考虑多种环境条件约束和飞行器自身条件约束的情况下,快速规划出众多飞行器的最优飞行轨迹,具有一定的学术价值和工程应用价值.     

基于多指标动态优先级的无人机协同路径规划

针对复杂城市环境下多无人机（UAVS）协同巡检、配送等任务,提出一种基于多指标动态优先级的协同路径规划方法,以节省运行成本和增加任务效率。综合考虑碰撞风险、总路程、等待时间等指标构建动态优先级模型,并在优先级单边避碰机制下,定制组合规避策略以处理局部冲突,更好地权衡协同规划效率和路径质量。针对无人机个体路径规划,在Lazy Theta*算法基础上引入拥堵权值地图,引导无人机避开拥堵区域,降低冲突发生可能性。对比仿真试验表明：提出的个体规划算法可以减少拥堵区域和降低拥堵持续时间,提出的多指标动态优先级协同规划算法相比于飞行时间驱动的动态优先级,能够提高规划效率和结果最优性。     

多威胁障碍下翼伞系统的最优轨迹规划

针对翼伞系统在多威胁障碍环境下的最优轨迹规划问题,提出了一种结合改进RRT~*算法和高斯伪谱法的混合策略方法。根据翼伞运动模型特点,改进了原始RRT~*算法的距离度量和节点扩展方式,采用目标偏向的采样策略加快算法找寻初始轨迹的速度;根据翼伞系统的四自由度运动模型建立以控制量为目标函数的最优控制问题,利用高斯伪谱法将最优控制的轨迹规划问题转换为带约束的非线性规划问题,再将初始轨迹作为该非线性规划问题的初始解以减少迭代次数、加快收敛速度。仿真结果表明,所提方法在多威胁障碍环境下可以规划出满足要求的最优轨迹,且比原高斯伪谱法节约了大量运行时间。     

结合跳点引导的无人机随机搜索避撞决策方法

针对无人机在城市空域环境和密集交通流下的避撞决策问题，提出马尔科夫决策过程（MDP）和蒙特卡洛树搜索（MCTS）算法对该问题进行建模求解。蒙特卡洛树搜索算法在求解过程中为保证实时性而使其搜索深度受限，容易陷入局部最优，导致在含有静态障碍的场景中无法实现避撞的同时保证全局航迹最优。因此结合跳点搜索算法在全局规划上的优势，建立离散路径点引导无人机并改进奖励函数来权衡飞行路线，在进行动态避撞的同时实现对静态障碍的全局避撞。经过多个实验场景仿真，其结果表明改进后的算法均能在不同场景中获得更好的性能表现。特别是在凹形限飞区空域仿真模型中，改进后的算法相对于原始的蒙特卡洛树搜索算法，其冲突概率降低了36%并且飞行时间缩短47.8%。     

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

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

基于改进A*算法的UUV冰下避障航迹规划算法

针对冰下避障航迹规划问题,提出了一种基于改进A*算法的三维冰下避障航迹规划算法.不同于传统的A*航迹规划算法,该算法结合了人工势场航迹规划算法的思想,将水下地形碰撞约束、海冰碰撞约束以及UUV巡航高度约束重新编排.算法分析表明,该避障航迹规划算法能够有效增强UUV冰下避障能力与定深巡航高度控制能力.基于改进的A*冰下避障航迹规划算法,给出了上述约束的设计方法并进行了仿真验证.仿真结果表明,基于上述约束的航迹规划算法具有良好的避障能力、巡航高度控制能力以及航行距离控制能力.     

Adaptive path planning for unmanned aerial vehicles based on bi-level programming and variable planning time interval

This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles (SAMs) are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.     

Three-dimensional path planning for unmanned aerial vehicle based on interfered fluid dynamical system

This paper proposes a method for planning the three-dimensional path for low-flying unmanned aerial vehicle(UAV) in complex terrain based on interfered fluid dynamical system(IFDS) and the theory of obstacle avoidance by the flowing stream. With no requirement of solutions to fluid equations under complex boundary conditions, the proposed method is suitable for situations with complex terrain and different shapes of obstacles. Firstly, by transforming the mountains, radar and anti-aircraft fire in complex terrain into cylindrical, conical, spherical, parallelepiped obstacles and their combinations, the 3D low-flying path planning problem is turned into solving streamlines for obstacle avoidance by fluid flow. Secondly, on the basis of a unified mathematical expression of typical obstacle shapes including sphere, cylinder, cone and parallelepiped, the modulation matrix for interfered fluid dynamical system is constructed and 3D streamlines around a single obstacle are obtained. Solutions to streamlines with multiple obstacles are then derived using weighted average of the velocity field. Thirdly, extra control force method and virtual obstacle method are proposed to deal with the stagnation point and the case of obstacles’ overlapping respectively. Finally, taking path length and flight height as sub-goals, genetic algorithm(GA) is used to obtain optimal 3D path under the maneuverability constraints of the UAV. Simulation results show that the environmental modeling is simple and the path is smooth and suitable for UAV. Theoretical proof is also presented to show that the proposed method has no effect on the characteristics of fluid avoiding obstacles.     

Collision free 4D path planning for multiple UAVs based on spatial refined voting mechanism and PSO approach

In this paper, a four-dimensional coordinated path planning algorithm for multiple UAVs is proposed, in which time variable is taken into account for each UAV as well as collision free and obstacle avoidance. A Spatial Refined Voting Mechanism(SRVM) is designed for standard Particle Swarm Optimization(PSO) to overcome the defects of local optimal and slow convergence.For each generation candidate particle positions are recorded and an adaptive cube is formed with own adaptive side length to indicate occupied regions. Then space voting begins and is sorted based on voting results, whose centers with bigger voting counts are seen as sub-optimal positions. The average of all particles of corresponding dimensions are calculated as the refined solutions. A time coordination method is developed by generating specified candidate paths for every UAV, making them arrive the same destination with the same time consumption. A spatial-temporal collision avoidance technique is introduced to make collision free. Distance to destination is constructed to improve the searching accuracy and velocity of particles. In addition, the objective function is redesigned by considering the obstacle and threat avoidance, Estimated Time of Arrival(ETA), separation maintenance and UAV self-constraints. Experimental results prove the effectiveness and efficiency of the algorithm.     

A newly bio-inspired path planning algorithm for autonomous obstacle avoidance of UAV

In this paper, a bio-inspired path planning algorithm in 3D space is proposed. The algorithm imitates the basic mechanisms of plant growth, including phototropism, negative geotropism and branching. The algorithm proposed in this paper solves the dynamic obstacle avoidance path planning problem of Unmanned Aerial Vehicle (UAV) in the case of unknown environment maps. Compared with other path planning algorithms, the algorithm has the advantages of fast path planning speed and fewer route points, and can achieve the effect of low delay real-time path planning. The feasibility of the algorithm is verified in the Gazebo simulator based on the Robot Operating System (ROS) platform. Finally, an actual UAV autonomous obstacle avoidance path planning experimental platform is built, and a UAV obstacle avoidance path planning flight test is carried out based on this actual environment.     

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

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

基于SAS算法的起飞一发失效应急路径规划方法

为解决起飞一发失效应急程序（EOSID）手动设计的不足,提出一种基于SRTM数据的稀疏A*搜索（SAS）算法的EOSID路径规划方法。首先采用航天飞机雷达地形测绘使命（SRTM）的网格地形数据,结合起飞一发失效相关规章,考虑爬升梯度与保护区限制确定可行搜索空间;然后基于可行搜索空间运用稀疏A*搜索算法搜索应急离场路径,在传统A*算法寻找扩展节点时加入起飞性能约束条件,同时利用地形高程数据进行地形和威胁回避,生成一条三维应急离场航迹;最后利用三次样条曲线对规划的应急离场航迹进行平滑处理。实验结果表明该方法能自动搜索出有效的EOSID三维航迹。     

考虑UAV性能约束的变速度自主避障算法研究

动态不确定环境下,为有效地提升UAV执行任务的安全性和可靠性,在UAV自主避障过程中考虑了自身的性能约束条件.在速度障碍圆弧法的基础上,考虑UAV的法向和纵向加速度约束范围,研究了速度障碍圆弧随速度矢量变化的规律,提出了一种考虑UAV性能约束的变速度自主避障算法.该算法在考虑自身性能约束条件下,为实现UAV对威胁障碍的...