基于A*算法的实时航迹规划方法研究

根据巡航导弹实时航迹规划时效性强、弹载计算设备的运算速度和内存容量有限等特点,将巡航导弹的机动性能约束与规划空间的划分结合起来,构造了一个较小的搜索空间,然后在此缩小了的搜索空间内利用A*算法具有的启发式特点,可在有效时间内搜索到满足要求的可行航迹.最后,通过一个例子对A*算法进行了验证.     

一种飞行器在线实时航迹规划算法

针对飞行器在线航迹规划问题展开研究,提出了一种实时航迹搜索算法。该方法将飞行器的运动与航迹搜索结合在一起,可以有效地调节搜索的时间,满足在线实时应用的要求。通过在限定的时间内扩大寻优范围,该算法可以有效地避免不可行区域,并使生成的航迹更加优化。实验结果表明,算法能有效地处理各种航迹约束,实时地生成满意的三维航迹。     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

一种GNSS卫星轨道高精度实时插值方法

针对GNSS导航信号模拟源中多星座轨道计算实时性问题,从计算效率、精度等角度分析和对比了牛顿多项式和埃尔米特多项式插值算法的性能,通过对牛顿插值的加“窗”改进,使得卫星位置、速度的插值精度显著提高.算例结果表明,该方法能够在等间距时间点上多个卫星位置已知、速度未知的条件下,高精度实时地内插出卫星的位置和速度,其中卫星位置插值精度为mm级,速度插值精度小于1e-5 m/s,计算量为广播星历直接计算的1/7,位置和速度的拟合精度均优于三阶埃尔米特插值结果.     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

维修任务调度的多目标决策模型

通过对维修调度问题进行分析,考虑到战斗力相关的多种目标因素,针对目前研究的目标单一,又未考虑武器的先进程度、配置等缺陷,就修复后的加权作战时间和装备尽可能少的延误数量双重目标加以研究,并给出了调度算法。从而弥补了这些缺陷,使调度更加合理。最后,算例表明模型的求解方法简单,计算时间较短,可有效地实现维修任务调度。     

基于HLA的潜舰对抗模拟训练系统的设计与实现

针对水面舰艇与潜艇对抗模拟训练及其作战环境,提出了基于高层体系结构(HLA)的仿真系统设计方案,设计了由水面舰艇、潜艇、直升机、鱼雷等成员组成的潜舰对抗模拟训练系统,并给出了组成联邦的各成员功能和OMT的设计方法,最后分析了潜舰对抗模拟系统的仿真过程,利用VR-Link工具库给出了部分功能的实现代码。在潜舰对抗模拟训练系统的开发中证明该设计是可行的,并且本项研究对其他领域内基于HLA的仿真系统构建和开发具有参考价值。     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

联合作战规划中资源调度算法研究

以联合作战为例建立任务和作战平台资源模型,通过多维动态列表规划算法(Multidimensional Dynamic List Scheduling,MDLS)进行任务-平台分配,对平台选择提出了两种不同的优先权计算方法,通过对案例求解比较了不同方法的结果.     

关于改善可视化仿真系统实时性的途径

实时性是设计可视化系统所面临的关键技术问题之一,如何协调系统的实时性和模型的真实性是可视化仿真系统实现的瓶颈。结合应用仿真建模工具MultiGen的开发经验,从模型数据的组织结构、绘制优先级的确定,以及复杂场景建模与显示中常用的实例化、LOD、Billboard等方面,探讨了在可视化系统设计中改善实时性可采用的途径,并逐个分析其特点、利弊及处理技巧。