基于半定规划的无源跟踪最佳传感器选择

在多站测向定位系统中,观测站与目标的几何位置影响目标定位跟踪精度。以目标估计的克-劳美罗下界(CRLB)行列式最大值为优化指标,在考虑传感器自身的探测能力等实际约束的前提下,建立了无源协同跟踪下最佳传感器选择优化模型。提出了一种基于半定规划(SDP)算法将上述组合优化问题转换为凸优化问题,进行优化求解。仿真结果验证了算法的有效性,与松弛算法和随机选择算法相比,基于SDP的传感器选择可以进一步提高无源协同跟踪的精度。     

无源/有源联合探测系统站点部署与探测性能分析

针对由4站无源定位系统与有源T/R雷达站构成的联合探测系统,提出了无源/有源综合探测系统的探测模型,分析了4种布站方案的目标联合探测精度、探测模糊区分布问题,比较了无源/有源综合探测系统与无源探测系统的性能.仿真结果表明,联合探测系统的最优部署方案是4站无源定位系统采用星形布站结构,T/R有源雷达后置于无源主站10～40 km处,此时系统目标探测精度最高,探测模糊区最小.     

基于距离差法目标定位的多站雷达优化布局

多站雷达的布局直接影响距离差法目标定位的精度。首先给出多站雷达系统距离差定位的误差协方差矩阵的表达式和计算方法,然后以误差椭球体积最小为布站优化的目标,讨论了多站平面布局对空间目标定位时的优化布站方法,并在平面优化布局的基础上,推出无约束情况下的最优布局。仿真结果与理论分析一致,该结论可以推广到无源定位系统。     

无源雷达菱形布站的定位精度分析

为了得到无源雷达菱形布站的最佳布站方案,分析了时差定位算法的基本原理,推导了定位精度的数学模型,考虑了影响定位精度的各种因素。通过计算机仿真实验对比了在不同主站位置、不同站间距离以及不同主站高度的情况下菱形布站的GDOP(geometric d ilution of precision)等值线分布,最终得出了定位精度与布站之间的联系,为无源雷达最优菱形布站提供了理论依据。     

双站无源定位最佳配置分析

为了提高双站无源定位精度,在全局坐标系下分析了双站纯方位定位系统的最佳配置形式。首先研究了最小GDOP(Geometric Dilution of Precision)意义下的方位角约束关系及最优夹角,得到双站的最佳配置形式是目标与两传感器间呈一确定夹角的等腰三角形;在此基础上,讨论了夹角对GDOP的影响进而提出有效定位区域的概念,指出只有当目标位于该区域内时双站才能获得较好的定位精度。仿真结果验证了上述关于最佳配置形式及有效定位区域的分析,指出该结论可以应用到基于传感器管理的多站无源定位算法中。     

一种多站无源联合定位系统的航迹起始方法

为了解决雷达系统面临的4大威胁,多站无源联合定位系统被广泛采用。航迹起始是多站无源联合定位系统对目标进行跟踪的首要问题。分析了多站无源联合定位系统的航迹起始问题的特点,在有源定位系统航迹起始的逻辑法基础上,利用辐射源参数构造多维相关波门进行关联判定,并采用基于最小二乘法的直线拟合方法对航迹作平滑处理,提出了一种针对多站无源联合定位系统的航迹起始方法。仿真实验结果表明了该算法的有效性。     

基于随机期望值模型的时差定位最优布站算法

为研究在特定的定位和布站区域内,时差定位站点的最优布局问题,以定位区域内任意目标的定位误差期望值最小为布站原则,提出了基于随机期望值模型的时差定位最优布站算法,并利用随机模拟、神经网络与遗传算法相结合的混合智能算法来求解最优布站策略。仿真结果表明,该算法的寻优布站结果接近于系统的最优布站。     

一种有源无源联合定位系统的航迹起始方法

为了解决雷达面临的四大威胁和无源定位系统定位精度偏低及被动工作的问题,多站有源无源联合定位系统正在成为研究热点。航迹起始是该系统对目标进行跟踪的首要问题。在航迹起始过程中,系统需要将有源观测点迹和无源观测点迹进行融合,其本质是异类源数据融合问题。分析了有源无源联合定位系统的航迹起始问题的特点,提出了一种针对有源无源联合定位系统的航迹起始方法。仿真实验结果表明了该算法的有效性。     

多站无源雷达系统作战效能研究与应用

建立了多站时差定位无源雷达系统的作战效能评估模型,并以y型布站为例,结合系统实际运行中可能出现的任一辅站发生故障的异常情况,对系统的作战效能进行了仿真分析,得出了评估结果.给出的作战效能评估模型及评估方法,可以有效地对不同布站形式的无源雷达系统探测能力进行分析评估,为实战应用提供理论依据.     

基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

Replacement models under additive damage

A production system which generates income is subject to random failure. Upon failure, the system is replaced by a new identical one and the replacement cycles are repeated indefinitely. In our breakdown model, shocks occur to the system in a Poisson stream. Each shock causes a random amount of damage, and these damages accumulate additively. The failure time depends on the accumulated damage in the system. The income from the system and the cost associated with a planned replacement depend on the accumulated damage in the system. An additional cost is incurred at each failure in service. We allow a controller to replace the system at any stopping time T before failure time. We will consider the problem of specifying a replacement rule that is optimal under the following criteria: maximum total long-run average net income per unit time, and maximum total long-run expected discounted net income. Our primary goal is to introduce conditions under which an optimal policy is a control limit policy and to investigate how the optimal policy can be obtained. Examples will be presented to illustrate computational procedures.     

A generalized Johnson's rule for stochastic assembly systems

Johnson's rule gives the optimal order to schedule a set of jobs through a two-machine flow shop with deterministic processing times. We extend Johnson's rule to fork-join systems with random processing times. Most of the system may be an arbitrary network. We give conditions under which Johnson's rule is optimal in the stochastic sense, in the increasing convex sense, and in expected value. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 211–220, 1997     

基于全站仪最佳布站的调炮精度检测方法

针对目前缺少火炮调炮精度检测方法的现状,提出了一种基于全站仪最佳布站的调炮精度检测方法,建立了全站仪测量系统的数学模型,推导了调炮精度检测方法的解算公式,根据火炮调炮范围确定了调炮精度检测中的测量区域,得出全站仪测量系统对于整个测量区域的测量不确定度,结合某型火炮设计了画图法优化过程,得到全站仪测量系统的最佳测量布站位置。精度仿真试验表明,该方法可对调炮精度进行检测,使最佳布站测量系统的精度高于随机布站的精度。     

考虑修理工可变休假的n中取k系统可靠性模型

针对装备保障中维修调度对装备训练及可靠性的影响,将支队级修理所保障多艘舰船维修工作的情况抽象为单一维修台保障多个系统的维修力量调度分配,引入修理工可变休假策略对其进行描述,以装备结构中常见的n中取k系统为研究对象,针对以往研究利用指数分布等典型分布导致模型约束条件过于严格的问题,利用连续Phase-type分布描述了系统相关随机变量,构建系统可靠性解析模型,通过算例验证了模型适用性,模拟分析了修理工有无休假、修理工休假速率等相关因子对系统运行指标产生的各种影响。算例结果表明,该可靠性模型可以有效复现维修力量调度对n中取k系统可靠性的影响,可为修理工休假次数的合理安排、系统部件数量的优化配置提供理论基础和实践参考。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Preventive maintenance and replacement under additive damage

A system deteriorates due to shocks received at random times, each shock causing a random amount of damage which accumulates over time and may result in a system failure. Replacement of a failed system is mandatory, while an operable one may also be replaced. In addition, the shock process causing system deterioration may be controlled by continuous preventive maintenance expenditures. The joint problem of optimal maintenance and replacement is analyzed and it is shown that, under reasonable conditions, optimal maintenance rate is decreasing in the cumulative damage level and that beyond a certain critical level the system should be replaced. Meaningful bounds are established on the optimal policies and an illustrative example is provided.     

Optimal and suboptimal procedures in group sequential sampling

This paper investigates the problem of choosing between two simple hypothesis, H₀ and H₁, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule. It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures.     

Suboptimal decision rule for attacking targets of opportunity

A player having only a definite number of weapons is hunting targets. His total hunting time is also limited. Targets of opportunity with various values arrive at random, and as soon as a target arrives the player observes the target value and decides whether or not to shoot it down. The issue is what the decision rule is which guarantees him a maximum expected gain during the hunting time. Poisson arrival of the targets, uniform distribution of the target value, and the shoot-look-shoot scheme qre assumed. A decision rule is derived which is not optimal but has a very simple form and gives almost as good value as the optimal decision rule does.     

电子对抗对空侦察雷达阵地配置优化研究

针对电子对抗对空侦察雷达阵地优化配置问题,通过分析雷达站的侦察范围与定位条件,提出双机定位和三机定位的最优配置模式,分别建立双机定位和三机定位的最优站距、定位纵深、配置间隔、阵地高度等相关参数的计算模型。通过对电子对抗对空侦察雷达阵地优化配置问题进行实例计算,表明模型实用、有效。     

Optimal selection with alternative information

This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information.