滑翔增程弹滑翔弹道优化设计分析

针对鸭式布局的滑翔增程弹,建立了滑翔增程弹滑翔弹道的模型,采用使滑翔弹道上每一点的升阻比最大的设计思想进行弹道优化设计,导出了俯仰舵偏角与平衡攻角的表达式,并对滑翔飞行弹道特性进行了仿真计算分析.仿真计算表明,滑翔弹道与常规弹道降弧段相比下降趋缓,增程效果显著.     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

一类多对二随机格斗中的最优射击策略

射击策略的选择在随机格斗中是一重要战术问题,当一方武器面临多个武器目标时,如何确定射击目标顺序的研究,显然是具有实际意义的。依据发射间隔服从负指数分布的多对一随机格斗中最优策略应满足的条件,推出求解此类多对一格斗最优策略的方法。进而研究了射击间隔服从此类分布的多对二随机格斗中处于劣势一方的射击策略选择问题,得出寻求最优射击策略的一般方法。     

虚拟舰炮仿真训练系统的研究与设计

由于进行实弹射击的组织实施复杂,花费多,危险性大,易受天气,海况等条件影响,海军舰艇部队进行的实弹射击训练非常有限,远不能达到实战的需要.基于虚拟现实技术,对舰炮射击仿真训练模拟器的软件、硬件进行了总体设计,研究了炮弹弹道坐标的解算问题,使用Vega结合Creator进行视景系统的开发,研究建立了桌面式的虚拟现实系统.基本实现了舰炮射击仿真训练模拟器的桌面原型系统.     

有源、无源联合探测系统综合性能分析

根据无源探测系统与有源雷达组成的联合探测系统,给出了一种有源、无源联合探测系统的探测模型,定性、定量的仿真分析了不同布站方法时,系统的探测精度、探测模糊区分布问题,得出了联合探测系统的最优布站方法;与无源探测系统相比较,联合探测系统提高了系统探测精度,改善了探测模糊区.仿真结果可为工程实践中雷达组网的优化部署提供理论依据.     

风场中平流层飞艇轨迹跟踪的滑模控制方法

为实现平流层飞艇驻空阶段可控飞行,研究环境风场中横侧向轨迹跟踪的滑模控制方法。建立平流层飞艇驻空阶段动力学模型,将动力学方程解耦为纵向运动方程和横侧向运动方程,采用小扰动方法对动力学方程进行线性化;利用滑模控制对外部干扰强鲁棒的特性,设计横侧向轨迹跟踪的滑模控制器;以直线与圆组成的复合轨迹跟踪控制为例,对提出的轨迹控制方法进行仿真验证。仿真结果表明,所提基于滑模的轨迹跟踪控制方法鲁棒性好,在一定范围的风场扰动条件下,可以实现对指令轨迹的有效跟踪控制,响应特性好。     

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     

三关节机器人的神经网络补偿自适应控制器设计

三关节机器人广泛用于工业生产、轮式或履带式排爆机器人,为了补偿由于机器人结构参数、作业环境干扰等不确定性因素造成的机器人动力学模型的不确定性,将机器人动力学模型分解为名义模型和误差模型两部分,其误差模型采用RBF神经网络进行补偿,得到其估计信息,神经网络的输出权值根据Lyapunov稳定性理论采用自适应算法进行调整。所设计的神经网络补偿自适应控制器解决了不确定性机器人动力学系统控制器设计的不确定性问题,同时,通过定义Lyapunov函数,证明了控制器能渐近、稳定地跟踪期望轨迹。机器人的3个关节在控制器的作用下,约在5 s时达到期望轨迹,神经网络约在5 s时逼近机器人动力学模型的误差模型,实验结果表明了机器人关节对期望轨迹具有良好的轨迹跟踪性能。