STK飞行任务仿真及其在空地链路分析中的应用

飞行仿真是飞行航路设计,飞行任务规划以及飞行训练等项目中非常重要的一项任务。介绍了在STK(Satellite Tool Kit)的三维显示环境下,利用STK提供的专业化模块STK/AMM(Aircraft Mission Modeler)进行航空器飞行任务仿真的方法,详细阐述了利用该模块进行飞行任务规划和飞行路径设计的过程。同时结合STK的数据分析功能完成航空器在飞行过程中与地面台站的通信链路的可用性分析。给出的仿真方法较以往的仿真方法简单,设计过程更加灵活,可以快速地实现飞行任务仿真设计和空地通信链路的可用性分析。     

超空泡航行体深度跟踪串级控制策略

针对空泡与航行体之间非线性滑行力导致的超空泡航行体稳定性问题,提出了基于圆判据理论和Nelder-Mead算法的超空泡航行体深度跟踪串级控制方法。介绍了超空泡航行体数学模型以及圆判据定理基础知识。结合模型特性推导了超空泡航行体串级误差状态方程,利用圆判据定理研究了内环绝对稳定性。通过Nelder-Mead算法对内环反馈参数进一步优化。仿真分析结果表明：所提控制方法便于反馈参数整定,可以充分利用超空泡航行体的控制量实现深度跟踪。     

基于多群体改进萤火虫算法的装配序列规划

为了解决机械产品装配序列优化问题,提出了一种基于多群体改进萤火虫优化算法的装配序列规划方法。建立了装配序列规划的数学模型,针对萤火虫算法收敛效率低的不足,借鉴混合蛙跳算法族群划分思想对萤火虫算法进行了改进,引用局部搜索与全局信息交换机制提升了算法性能;根据装配序列规划问题离散型的特点,定义了新的离散编码方式和粒子更新策略。通过实例仿真结果表明,改进后的萤火虫优化算法简单有效、稳定性好、求解精度高,能够稳定快速地给出装配序列最优方案。     

基于改进ACO算法的多UAV协同航路规划

针对无人机(Unmanned Aerial Vehicle,UAV)在执行任务过程中遇到的诸如敌方防空火力、地形障碍及恶略天气等各类威胁源,采用威胁源概率分布的方法进行威胁的量化处理,构建任务空间的威胁概率密度分布图,有效消除了威胁源的差异性。根据UAV在任务飞行过程中的性能约束与时、空协同约束,同时考虑任务过程中UAV的损毁概率最小、任务航程最短,构建了相应的综合任务航路代价最优化目标函数。结合传统蚁群优化算法(Ant Colony Optimization,ACO)在解决此类问题中的不足,给出了相应的改进策略,提出采用协同多种群ACO进化策略来实现多UAV在满足时、空协同约束下的协同航路规划。通过相应的仿真计算表明,改进后的ACO协同多种群进化策略算法更适用于多UAV协同任务航路规划问题,具有一定的实用性。从而为多UAV协同任务航路规划问题的求解提供了科学的决策依据。     

反导作战多传感器任务规划技术

多传感器任务规划技术是反导作战中的重要研究内容之一,即解决如何发挥多维传感器资源的互补优势,构建"传感器-目标-任务"序列,以实现整体执行效果最优。基于JDL信息融合模型深入剖析了反导作战多传感器任务规划体系结构及其信息交互。在此基础上,结合反导作战特点,从应用和理论研究两个方面分别对多传感器任务规划技术进行了叙述。     

基于量子双向RRT算法的多平台反舰导弹协同航路规划

针对反舰导弹航路规划面临的动态威胁环境和多平台协同打击问题,提出了一种基于量子双向RRT算法的反舰导弹协同航路规划方法。采用动态坐标设置动态威胁,实时地避开动态威胁;通过取预规划终点方法,实现对目标的时间和空间协同打击;结合量子进化思想,将RRT算法中的扩展方向量子化表示,提出了一种量子双向RRT算法,并应用于航路规划。仿真结果表明,该方法可有效规避动态威胁和解决多平台反舰导弹航路规划的协同问题,并显著地改善了RRT算法的全局收敛性,得到了航程更短的航路。     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

An exact network flow formulation for cell‐based evacuation in urban areas

In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances.     

On matched active redundancy allocation for coherent systems with statistically dependent component lifetimes

This study addresses the allocation of matched active redundancy components to coherent systems with base components having statistically dependent lifetimes. We consider base component lifetimes and redundancy component lifetimes which are both stochastic arrangement monotone with respect to a pair of components given the lifetimes of the other components. In this context, allocating a more reliable redundancy component to the weaker base component is shown to incur a stochastically larger system lifetime. Numerical examples are presented as an illustration of the theoretical results.     

云平台上基于关键路径截取的有向无环图应用调度算法

针对云平台上有向无环图科学应用执行容易产生虚拟机资源过剩、资源使用率低及费用虚高的问题,给出一种基于关键路径截取的有向无环图应用调度算法。该算法采取关键路径截取技术,循环找出最晚完成的未分配任务,从该任务出发,在所有未分配任务构成的图中找出最大连通子图,并计算该子图的关键路径,然后将关键路径上的任务集调度到性能匹配的虚拟机上执行;同时通过任务回填技术充分利用虚拟机的空闲时间槽,提高资源使用率。实验结果表明,在云计算平台上,该算法不仅能够在截止时间内完成有向无环图科学应用,而且可以提高资源使用率,有效减少完成该应用所需整体费用。