飘浮式空间机器人路径规划的全局最优解析解

本文根据刚体螺旋运动的特点,利用旋转矩阵构造出评价载体姿态变化的目标函数;采用Ｖａｆａ等人的“虚机械臂”模型简化计算;利用动量矩守恒的假设条件及完成抓取固定目标时的几何位形关系,得到微分约束和边界约束。提出机械臂“周期运动”寻优法,从而得到全局优化的近似解析解。     

移动式C3I机动路线选择多准则决策折衷对话算法

提出非劣路径和满意路径的概念,给出准则网络图满意路径问题的数学模型,利用多准则决策理论和方法,通过构造辅助问题,研究辅助问题和非劣路径的关系,设计出多准则网络图的交互式满意路径算法。     

一种新的运输问题对偶算法

本文给出求解运输问题的一种新的方法——运输问题对偶算法(仍是表上作业法)。最后给出的实例说明本文算法在解决某些问题时比[1]中方法简便。     

基于威胁联网环境的一种无人机航迹重规划方法

威胁联网环境中,无人机需要对运动威胁进行规避以安全到达终点。通过建立无人机和威胁的运动模型,并对每一时刻无人机和运动威胁的相对位置进行实时分析;提出了一种基于可飞性分析的航迹重规划方法;最后对该方法进行仿真实验。仿真结果表明,该方法增强了无人机对运动威胁的规避能力。     

多边形障碍环境中避障路径的遗传算法

研究了平面障碍环境中避障的遗传算法,重点介绍了障碍环境的模型构造和用遗传算法求解该模型的方法设计.采用了与已有遗传算法不同的染色体编码方式和不同的遗传算子设计,在初始群体产生时尽量避免了引入无效基因,提高了染色体进化的效率,使得该算法具有很好的寻优能力,实验结果也表明了该算法的有效性.     

势场理论的多无人机协同路径规划方法

在势场理论的基础上对穿越多威胁区的无人机路径进行了协同规划,在规划中将每个威胁区按实际情况分为极危险区域和次危险区域,而这些威胁不仅包括己方情报所得的已知威胁,而且包括在执行攻击任务过程中新发现的突发威胁,然后利用物理学中的扩散方程建立势场,并在已建立的势场中对多无人机进行整体协同路径规划。在建立模型的同时,进行了仿真模拟,仿真结果表明了该方法的正确性和可行性。     

Random disambiguation paths for traversing a mapped hazard field

We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve‐valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero‐risk path, and we introduce a practically computable additive‐constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Failure profiles of coherent systems

In this paper we first introduce and study the notion of failure profiles which is based on the concepts of paths and cuts in system reliability. The relationship of failure profiles to two notions of component importance is highlighted, and an expression for the density function of the lifetime of a coherent system, with independent and not necessarily identical component lifetimes, is derived. We then demonstrate the way that failure profiles can be used to establish likelihood ratio orderings of lifetimes of two systems. Finally we use failure profiles to obtain bounds, in the likelihood ratio sense, on the lifetimes of coherent systems with independent and not necessarily identical component lifetimes. The bounds are relatively easy to compute and use. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于SWOT分析的军队审计容错免责机制完善路径研究

军队审计容错免责机制是在审计权限范围内对符合容错免责情形的事由减轻或免于问责并及时纠正的稳定工作机制,是审计问责态势下应对“为官不为”问题的合理路径。本文基于SWOT法分析认为,当前审计环境下建立军队审计容错免责机制的优势在于独立的经济监督地位、专业的经济监督力量和广泛的经济监督对象,劣势在于单一的认定主体、缺失的法律规范和匮乏的免责素质,机遇在于利好政策的出台、国家审计的实践经验和军队审计的职能定位,威胁在于制度规范笼统、审计风险扩大和资源矛盾加剧。在此基础上,本研究基于W-T（劣势-威胁）的战略选择,提出完善军队审计容错免责机制的现实路径,即：明确机制定位,科学界定边界;完善制度规范,形成法律依据;完备容错清单,转变审计模式;优化容错环境,降低容错风险。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000