无人机自主防撞关键技术与应用分析

无人机与有人机在多机种和不同合作程度下共享空域飞行是未来的发展趋势,防撞问题成为制约无人机飞出隔离空域的关键挑战。结合现有飞机防撞体系,从无人机防撞特殊性出发分析无人机自主防撞需求,提出无人机自主防撞系统的框架,归纳分析两大主要关键技术——感知探测技术和防撞算法,以及二者的不同应用范围和主要问题,在此基础上提出无人机自主防撞管理体系架构,总结探讨无人机自主防撞关键技术的发展趋势。     

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.     

基于改进人工势场法的无人机避让航迹规划

随着无人机技术的不断发展，以及无人机应用领域的不断扩展，无人机与有人机在低空空域的融合运行是我国通用航空事业发展的必然趋势，而感知与规避技术是无人机与有人机间避免碰撞的重要保障。在对感知与规避技术进行详细阐述的基础上，对其关键技术问题之一的避让航迹规划进行了研究。首先，针对传统人工势场法的局部震荡问题提出了解决方案；其次，结合感知与规避实际背景，对威胁区模型进行了优化，并对无人机自身性能约束进行了建模；最后，对改进算法进行了仿真验证，阐明了其对无人机动力能源消耗、避让时间和任务执行效率等方面的影响。     

基于改进人工势场算法的无人机群避障算法研究

针对无人机运动避障人工势场算法本身存在的极小值问题和局部最小值问题，采用改进的人工势场算法，提出了一种新的路径规划方法。不同于目前的人工势场法，该模型从双机相互作用开始，在障碍物斥力的基础上，增加了无人机之间的斥力，同时定义集群的前置形心作为另一个引力源。算法分析表明，该方法能够有效避免无人机陷入局部最小值，并增强了无人机机群的控制和避障能力。基于该无人机控制模型，给出了路径规划设计并进行了仿真实验。实验结果表明，基于该模型的无人机机群控制具有更好的避障性能和追踪目标的能力。     

无人机自动着陆中的机器视觉辅助技术

设计了一套辅助无人机自动着陆的机器视觉系统。该系统由机载硬件设备和用户开发软件共同组成,用以完成数字图像处理任务和无人机运动参数估计任务。系统传感器包括一个单目摄像机和机载惯性陀螺;数字图像处理使用的主要算法有图像的轮廓提取、角点检测和模版匹配。基于角点处各个方向上灰度差变化较大的特征,依据最小核值相似(SUSAN)算法和角点几何结构分析,提出一种改进的角点特征提取算法;根据任务开发的位置参数估计算法依据摄像机透视投影理论,运用摄像机成像标定方法导出了一种高精度的位置测量模型。通过计算机仿真表明,所提出的计算机视觉位置参数估计算法可以达到无人机着陆过程的精度要求。     

A hybrid genetic approach for airborne sensor vehicle routing in real-time reconnaissance missions

Past initiatives to address surveillance and reconnaissance mission planning mainly focused on low-level control aspects such as real-time path planning and collision avoidance algorithms in limited environment. However, few efforts have been spent on high-level real-time task allocation. It is believed that automated decision capabilities supporting real-time resource allocation for sensor control and interactions might significantly reduce user workload, focusing attention on alternate tasks and objectives while assigning hard computational tasks to artificial agents. In this paper, we propose a new hybrid genetic algorithm to solve the dynamic vehicle routing problem with time windows, in which a group of airborne sensors are engaged in a reconnaissance mission evolving in a dynamic uncertain environment involving known and unknown targets/threats. In that context, visiting a target may consist in carrying out a collection of subtasks such as search, detect, recognize and confirm suspected targets, discover and confirm new ones. The approach consists in concurrently evolving two populations of solutions to minimize total travel time and temporal constraint violation using genetic operators combining variations of key concepts inspired from routing techniques and search strategies. A least commitment principle in servicing scheduled customers is also exploited to potentially improve solution quality.     

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.     

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

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

基于遗传模拟退火算法的无人机航迹规划

航迹规划技术是无人机任务规划系统中重要的核心技术之一,无人机飞行空间广阔,需要一种快速搜索最佳路径的方法.首先在飞行区域中建立数字地图模型和防空威胁区模型,在满足无人机飞行约束条件的情况下,为无人机航迹规划提供一种遗传模拟退火算法,充分利用模拟退化算法的概率突跳特性和遗传算法强大的快速搜索能力.仿真结果表明,使用该算法无人机能够自动避开模拟数字地图的威胁区,搜索出一条安全有效航迹,并保证航线的完整性和最优性.     

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

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

低空无人机路径规划算法综述

随着无人机技术的发展,无人机在低空的应用场景越来越多,复杂的低空环境对无人机路径规划算法提出了新的要求。本文总结了近年来常用的无人机路径规划算法,包括图搜索算法,线性规划算法,智能优化算法（遗传算法、粒子群算法、蚁群算法）,强化学习算法;对这些算法的原理、适用场景及其优缺点进行了归纳分析;并基于无人机发展现状对无人机路径规划算法进行了展望。     

无人机航迹规划技术研究及发展趋势

通过对无人机航迹规划的研究,构建了无人机航迹规划的结构框架;分析了无人机系统约束及威胁场约束,探讨了无人机航迹几何建模方法及规划算法的国内外研究概况;并着重分析了规划算法。最后,阐述了无人机航迹规划面临的关键问题及发展趋势。     

基于预测控制的无人机编队内部避碰

针对无人机编队内部避碰问题,首先采用基于预测控制的方法,解决了在即将发生碰撞情况下无人机的航向调整问题;然后,建立了航路回归模型,解决了无人机避碰后,迅速回归预定航路的问题。仿真结果表明,文章给出的避碰方法能够有效解决无人机编队内部碰撞问题。     

无人机航迹规划算法

无人机是现代战场实施侦察、打击的有力武器,它的发展备受关注。无人机航迹规划源于机器人运动规划,它是无人机应用研究的核心内容,对提高无人机系统在复杂战场的作战能力起着关键作用。无人机战场环境日益复杂,在强拒止、强电磁环境下,航迹规划对自主性和智能化有更高的要求,传统单一约束的算法已不能满足现今的战场需求。文章系统梳理了 5类无人机航迹规划算法中的几种常用算法及其改进算法,归纳了这些算法的原理、优缺点及适用条件,指出现阶段存在的问题与无人机航迹规划算法面临的挑战。综述表明,航迹规划算法必然向着智能化发展,自主识别和智能决策是改进、优化算法的关键。     

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.     

小型无人机的导航与制导仿真系统研究

研究了基于飞行器动力学模型的小型无人机的惯性组合导航与制导系统仿真技术,组合导航系统嵌入了飞行器的轨迹和姿态控制回路,建立了基于MATLAB/AEROSIM的组合导航计算机仿真系统,仿真系统包括惯性组合导航仿真模块、传感器仿真支持模块、飞行器6自由度动力学模型模块、飞行器轨迹生成、轨迹控制与姿态控制模块、导航仿真评估模块。基于该仿真系统,目前已开展惯性/卫星深组合、惯性/大气数据融合等理论算法和技术研究。     

考虑运动学约束的不规则目标遗传避碰规划算法

 针对复杂环境下不规则目标的路径规划问题,提出了一种带有运动学约束的遗传避碰规划算法。以舰载机在航母甲板上的路径规划问题作为研究对象,并且该算法可推广至其他具有此类约束的路径规划问题中,它较好地解决了目标形状复杂、障碍环境复杂、目标运动时带有回转半径约束等特殊问题。在传统遗传路径规划算法的基础上,针对性地设计了三维位置和姿态混合编码、三段法路径解码、轨迹包围盒的碰撞检测及距离计算等方法,并在遗传操作中引入惩罚项和修补策略来辅助算法寻优。最后,为得出复杂环境下的最优路径,基于VC++平台对算法进行了仿真验证。结果表明,在复杂障碍环境下,本文提出的算法可求得最优避碰路径,并满足预先设定的目标回转半径约束,能够有效地解决此类目标的避碰路径规划问题。     

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

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

基于深度强化学习的多无人机协同进攻作战智能规划

无人机依靠作战效费比高、灵活自主等优势逐步替代了有生力量作战,多无人机协同作战任务规划成为热点研究问题。针对传统任务规划采用的智能优化算法存在的依赖静态、低维的简单场景、机上计算较慢等不足,提出一种基于深度强化学习（DRL）的端到端的多无人机协同进攻智能规划方法。将压制敌防空作战（SEAD）任务规划过程建模为马尔科夫决策过程,建立基于近端策略优化（PPO）算法的SEAD 智能规划模型,通过两组实验验证智能规划模型的有效性和鲁棒性。结果表明：基于DRL 的智能规划方法可以实现快速、精细规划,适应未知、连续高维的环境态势,智能规划模型具有战术协同规划能力。     

基于罚函数序列凸规划的多无人机轨迹规划

多无人机（UAVs）轨迹规划是具有非线性运动约束和非凸路径约束的最优控制问题。引入序列凸规划思想,将非凸最优控制问题近似为一系列凸优化子问题,并利用成熟的凸优化算法进行求解,以更好地权衡最优性和时效性。首先,建立了多无人机协同轨迹规划的非凸最优控制模型。然后,利用离散化和凸近似方法将其转换为凸优化问题,包括对无人机运动模型的线性化,以及对威胁规避约束和无人机碰撞约束的凸化。同时,提出了一种离散点间的威胁规避方法,保证无人机在离散轨迹点间的飞行安全。在凸优化模型的基础上,给出了基于罚函数序列凸规划求解多无人机轨迹规划的具体框架。最后,通过数值仿真验证了方法的有效性,结果表明该方法在多机轨迹规划结果的最优性和时效性都要优于伪谱法,而且优势随编队数量的增加而增大。