Techniques for establishing ergodic and recurrence properties of continuous-valued markov chains

We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models.     

The distribution of recoverable inventory items from a repair center when the number of consumption centers is large

This paper considers real-time decision rules for an inventory system where items are repaired than “used up.” The problem is to decide which user in the system has the greatest need for the newly available inventory items coming out of repair. The main result shows that two published approahes, the Transportation Time Look Ahead policy and METRIC, are optimal when the number of users gets large. A useful byproduct of the proof is a lower bound on the average backorder rate for a repair-inventory system of any size.     

A decomposition algorithm applied to planning the interdiction of stochastic networks

We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

改进型Voronoi图和动态权值A*算法的无人机航迹规划

针对实际作战环境中的不同威胁等级和不同威胁实体的威胁源,提出了改进型的Voronoi图,并建立了基于改进型Voronoi图的航迹规划空间;基于A*算法的估价函数在不同阶段对指标的敏感度不同,在传统的启发式A*搜索算法基础上提出了动态权值A*搜索算法,提高了航迹搜索的效率,实现了航迹搜索过程快速性和准确性的结合。最后通过Matlab仿真计算出由动态权值A*算法得到的最优航迹,并进行了航迹的平滑处理,仿真表明了该方法的可行性。     

基于动力学与运动学的四轮全向移动机器人轨迹跟踪控制

建立了四轮全向移动机器人的运动学模型和动力学模型,并分析了四轮全向移动机器人执行器的机械特性。在此基础上,利用反馈控制设计了四轮全向移动机器人的运动学控制器,利用逆动力学补偿控制设计了四轮全向移动机器人的动力学控制器,实现了基于动力学与运动学的四轮全向移动机器人轨迹跟踪控制系统设计。最后,利用Matlab/Simulink完成了基于动力学与运动学的四轮全向移动机器人轨迹跟踪控制仿真实验,实验结果验证了该轨迹跟踪控制方法的有效性。     

模糊多目标群决策的装备采办问题研究

对模糊多目标群决策的装备采办问题,根据模糊数学理论和多目标决策理论方法,综合现有各种方法的优点,给出了无约束条件下模糊多目标群决策的装备采办问题的一般解法,并通过实例说明了该方法的有效性及通用性。     

载人登月软着陆制动段最优制导方法(英文)

提出一种解决软着陆制动段燃料最优制导以及闭环控制的方案.首先使用庞氏极大值原理将制动段燃料最优问题转化为一个初值问题,并使用遗传算法搜索求解;其次为了解决最优制导的闭环控制问题,将最优弹道作为标称弹道,使用RCS系统对轨道面内两个方向误差量进行解耦,分别使用极限环控制.仿真表明,所规划出的燃料最优弹道比阿波罗方案能节约159.7 kg的燃料,而闭环控制系统可以将初始1 000 m的位置误差和5 m/s的速度误差收敛到接近段入口误差要求以内,在闭环控制过程中,燃料消耗不大于87.75 kg,总体燃料消耗节约至少71.95 kg.     

舰艇红外隐身技术的探讨

舰艇红外隐身技术在现代战争中发挥着越来越重要的作用.定性描述了舰艇的主要红外辐射源,定量分析了舰艇和背景的红外辐射特征,通过分析舰艇对红外隐身的要求,结合舰艇红外隐身的发展现状,研究了舰艇红外隐身技术所采取的措施.     

舰船航渡过程中的松弛时间与航渡策略问题

针对舰船特点和任务要求,提出了舰船航渡中的松弛时间问题。在对问题分析的基础上,给出了松弛时间的定义并对其进行了建模,讨论了航渡失败的判断准则,给出了松弛时间的上下限以及航渡中实际的松弛时间的计算方法,并采用仿真的方法进行了典型航渡过程的松弛时间和成功概率的计算。在大量计算的基础上,初步探讨了航渡成功概率与各类航渡参数之间的关系,并对舰船最优航渡策略问题进行了初步分析,最后对于优化目标、计算初值、结果的表达方式等提出了一个可行的解决方案。     

一类微分方程组极限环的不存在性

在系统奇点唯一的条件下,研究了一类微分方程组不存在极限环的的充分条件,运用和发展了以往的结果。