俄罗斯军方选择新的无人驾驶系统

<正> 俄罗斯为了加快弥补其在部署和使用现代化无人驾驶系统方面的不足,采取了两种办法,一是直接从以色列引进先进无人驾驶系统;二是加快从国内研制的机型中进行筛选的步伐。在两年前的冲突中,格鲁吉亚军队将以色列制造的无人驾驶系统用于战术侦察,而俄国军队却不得不冒险动用有人驾驶飞机执行相同的任务,造成了不应有的重大损失,俄罗斯国防部为此多次受到严厉批评。此后,俄罗斯军方一直在寻求先进的无人驾驶系统,以弥补这方面能力的不足。     

发展中的反辐射无人机

无人机的发展是当前世界武器发展的重要方向之一，反辐射无人机作为一种重要的反辐射武器以其独特的优点得到了世界各国的关注，综述了未来空战中反辐射无人机的概况和特点，分析探讨了反辐射无人机的关键技术和应用前景。     

飞机初步设计中的响应面方法

通过对最优试验设计理论中响应面方法(Response Surface Methodology)的研究,提出一种可用于飞机总体设计阶段方案优选和参数分析的新方法。以某型无人驾驶飞机为例,描述了该方法的具体实施过程。实例表明,该方法具有满意的精度和较高的经济性。     

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.