基于差分GPS技术的舰载雷达动态标校

提出了一种基于差分GPS技术的舰载雷达动态标校方法,给出了根据大地坐标计算目标真值的算法;设计了一种舰载搜索雷达与跟踪雷达之间同步测量和适用于海上活动平台多传感器之间动态标校的数据处理方法。海上实践表明,这种方法具有精度高、实时性强的特点。     

基于效果的联合作战行动规划研究

联合作战行动规划是依据联合作战的使命和资源约束建立完成使命的最佳行动过程,通过对交战环境状态、交战主体的资源能力状态、行动、事件和效果的定义,结合人工智能领域解决"计划"问题的研究、军事领域基于效果的作战思想提出了联合作战行动规划模型及策略优选方法.模型结合了马尔可夫决策过程和贝叶斯网络技术来求解交战主体的最优策略,对联合作战设计具有适应性的行动策略做出的初步尝试.     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

运用ECO开发基于UML的工作流系统

运用UML进行建模并运用MDA方法生成系统代码已成为当前工作流系统设计开发的一大发展趋势。经过多年发展的ECO技术为.Net环境下运用MDA方法开发基于UML的稳定高效的软件系统提供了很好支持,而ECOⅢ则通过支持UML动态建模,使得ECO具备了开发基于UML工作流系统的能力。通过示例介绍了运用ECO进行工作流开发的一般流程,着重展现运用ECO开发工作流系统的可行性和高效性。     

一种防空自动化系统效能的模糊综合评估方法

针对防空自动化系统的组成,给出了防空自动化系统效能的指标体系,并通过分析防空自动化系统静态效能和动态效能的关系,运用模糊综合评估和系统性能评价等级划分的方法,在防空自动化系统静态效能评估的基础上,研究了防空自动化系统的动态效能,提出了一种静态效能与动态效能相结合的防空自动化系统模糊综合评估方法。     

高动态GNSS信号多普勒模拟任意阶DDS合成器设计*

为高精度模拟高动态条件下GNSS信号的多普勒特性,本文提出一种任意阶DDS信号合成器的设计方法。设计了任意阶DDS信号合成器的结构;通过理论分析,推导了各级累加器相位初值的计算公式;给出了字长选择方法;经仿真与验证,该方法能精确模拟GNSS信号的多普勒特性。此外,本文提出的DDS设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016