An improved adaptive differential evolution algorithm for single unmanned aerial vehicle multitasking

Single unmanned aerial vehicle (UAV) multitasking plays an important role in multiple UAVs cooperative control, which is as well as the most complicated and hardest part. This paper establishes a three-dimensional topographical map, and an improved adaptive differential evolution (IADE) algorithm is proposed for single UAV multitasking. As an optimized problem, the efficiency of using standard differential evolution to obtain the global optimal solution is very low to avoid this problem. Therefore, the algorithm adopts the mutation factor and crossover factor into dynamic adaptive functions, which makes the crossover factor and variation factor can be adjusted with the number of population iteration and individual fitness value, letting the algorithm exploration and development more reasonable. The experimental results implicate that the IADE algorithm has better performance, higher convergence and efficiency to solve the multitasking problem compared with other algorithms.     

汽油与柴油混合用作柴油机应急燃料的探讨

应急燃料对于提高战时油料保障能力具有重要意义。文章以在-10#军用柴油中掺入90#车用汽油(简称为汽柴混合油)为例,从柴油机燃料应具有的品质性能着手,分析了汽柴混合油作为柴油机应急燃料的可行性。把车用汽油和军用柴油按照不同的比例掺兑,将试验结果与军用柴油的性能要求和美军应急使用指标对某些理化性能的要求相比照, 指出了汽柴混合油作为柴油机燃料的可行性,并提出了建议。     

RELIABLE ENERGY SUPPLY AND NONPROLIFERATION

The phenomenon of global warming has led to a revival of the prospects for increased nuclear energy production worldwide, yet such increased production carries with it the increased risk of proliferation. To mitigate this risk, various multinational arrangements have been proposed to provide reliable supply of nuclear fuel while at the same time discouraging the construction of national plants for nuclear enrichment and reprocessing. This article provides a brief history of some of these proposals and concludes that the likelihood of success for such schemes as effective tools for nonproliferation is not high at this time. A proposal from the World Council on Renewable Energy to expand the understanding of supplier obligations under Article IV of the Treaty on the Non-Proliferation of Nuclear Weapons (NPT) to include the development of non-nuclear energy technologies for NPT parties in good standing is potentially a much better nonproliferation tool. Such an approach tracks the ideas contained in Title V of the Nuclear Non-Proliferation Act of 1978, which has recently received revived congressional interest.     

基于微分几何与李群的无人机编队会合方法

在领航-跟随编队模式下,设计了一种基于追缉策略的无人机编队会合方法。首先,基于微分几何曲线论和弗雷涅-塞雷标架建立了无人机非解耦三维运动模型,其中将曲率和挠率作为控制量;结合该模型给出了无人机三维编队会合问题的数学描述,它将导弹制导问题中的终端落角约束映射为编队会合问题中僚机的航迹倾角约束,同时引入额外的航迹方位角约束;然后使用特殊正交群的元素来度量长僚机方向偏差,并通过局部坐标映射将其映射为对应李代数空间中的旋量;接着,基于该旋量设计了编队会合几何导引律,并给出相应的曲率和挠率控制指令;最后,分别在长机稳定平飞和转弯机动条件下进行了多机编队会合数字仿真实验,仿真结果显示僚机能够有效地跟踪长机航向并收敛至指定位形,说明了方法的有效性。     

基于飞蛾信息素寻偶机制的无人机集群协同搜索

为了提高无人机集群协同搜索移动目标的效率,提出一种基于飞蛾信息素寻偶机制的无人机集群协同搜索方法。根据飞蛾基于信息素选择飞行方向的寻偶行为,建立信息素图风向模型和飞蛾信息素寻偶模型。考虑无人机机间避撞约束,提出从飞蛾信息素寻偶机制到无人机集群分布式协同搜索的映射,并给出具体实现流程。仿真实验结果表明了所提方法在解决单个移动目标的协同搜索问题时的有效性和稳定性;外场飞行试验表明了所提方法在实际应用中的可行性。     

多旋翼无人机模型预测抗扰避障制导

多旋翼无人机的自主避障是完成复杂任务的基础,避障的效果直接影响无人机执行任务的效能。针对存在外部扰动的无人机避障问题,提出了一种基于模型预测的抗扰避障制导律设计方法。通过设计干扰观测器对系统动态中的外部干扰进行了估计,并基于李雅普诺夫函数方法设计辅助制导律用于建立稳定性约束条件。结合前两者与模型预测控制,在模型预测控制优化求解中考虑无人机与障碍物的关系,根据所设计的制导律求解水平线速度与偏航角速度指令实现无人机的避障。对所提出的避障制导律进行数值〖BHDWG8,WK10YQ,DK1*2,WK1*2D〗〖XCLQX.TIF;%129%129〗听语音 聊科研与作者互动 仿真和实物飞行验证,结果表明了所提方法的有效性。     

无人作战飞机通信延时仿真

通信作为无人作战飞机任务控制站与无人作战飞机之间的纽带,在无人作战飞机系统中起着至关重要的作用。简要阐述了引起无人作战飞机通信延时的具体因素,分析了无人作战飞机使用的几种通信方式,提出并运用网络仿真工具NS2(networksimulation-2)针对视线通信方式和不同中继方式下的通信延时进行了仿真,最后对仿真作了分析和解释。     

一甲基肼的高压蒸发研究

对一甲基肼的高压蒸发进行了研究,计算了一甲基肼液滴温度和半径的变化历程,并对各种不同环境压力下的结果进行了比较。计算了蒸发常数、传热数和传质数,所得结果同已有的实验数据相比较是吻合的,且考虑了不同的Le数对蒸发界限压力的影响,说明了此蒸发模型和计算方法的合理性。所得结论对于分析液体火箭发动机的燃烧过程是重要的。这一方法还可以用来计算其他燃料的蒸发。     

小型侦察无人机任务能力及拒止距离分析

随着无人机技术的快速发展,无人机已在民用、军事领域得到广泛应用.尤其是具有"低慢小"特征的小型无人机,使用方便灵活,成本相对低廉,可用于执行侦察监视、自杀袭击等任务,对日常防空安全、重要目标防护构成严重威胁.分析研究了小型无人机主要威胁样式,重点分析了小型侦察无人机载荷任务能力,提出对该类目标拒止距离需求,可为相关拦截...     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011