天基预警系统多体制传感器综合调度方法

为提高天基预警系统对多目标的跟踪能力,提出扫描传感器纬度区间扫描模式和凝视传感器目标群跟踪模式,并基于此种模式设计基于聚类的扫描传感器纬度区间扫描调度方法和凝视相机目标群跟踪调度方法。由于诸多传感器的工作模式、探测频率、测量误差、视场模型均不相同,推导不同探测频率、视线误差的多传感器联合观测跟踪的克拉美-罗下界计算公式。综合运用以上方法,建立多体制传感器综合调度优化方法。仿真试验表明,该方法比传统工作模式下的系统对多目标具有更高的跟踪精度。     

截尾序贯验后加权检验截尾点的优化设计

选取截尾点是截尾序贯验后加权检验很关键的一步,目前理论上尚无有效的选取方法。本文用优化技术确定截尾点Ｃ,克服了实践中确定停时Ｎ和截尾点Ｃ遇到的计算困难,避免了一般取Ｃ＝１的盲目性,使截尾点Ｃ的选取有了理论根据。优选的截尾点不仅使双方承担的风险之和最小,而且使双方承担的风险值相对合理,易于接受。     

利用区间着色 Petri 网的 C~3I 系统时延分析

Ｃ３Ｉ系统是一个复杂的分布式离散事件动态系统,适合于用Ｐｅｔｒｉ网来描述其异步,并发行的,而且Ｃ３Ｉ系统是一个时间准则系统,文中提出的区间着色Ｐｅｔｒｉ网非常适合于分析其严格时限,并给出计算时延上（下）界的算法。     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

舰船武器甲板位置点杆臂参数的测定

舰载武器发射或舰载武器惯导系统对准需要舰载惯导系统MINS的信息辅助,不同的安装位置使得它们之间存在较大的杆臂效应,在对杆臂效应补偿中需要三维杆臂尺寸参数,由于加工误差、安装误差及船体变形,使武器战位的实际杆臂参数偏离图纸计算值.通常舰载惯导舱室与甲板武器战位之间不能通视直接测量难度大.为提高杆臂效应补偿精度,提出了基于舰载惯导MINS及差分GPS辅助的测量方案.通过速度信息观测采用马尔科夫递推滤波器估计杆臂参数,仿真结果表明通过10min的测量可达到0.1m估计精度量级.     

基于一元线性回归分析的舵机故障诊断算法

针对舵机的卡死、松浮和输出偏差等故障采用基于模型的方法检测.故障诊断分两步进行,首先采用等价空间法来检测是否发生故障,在检测到故障的基础上引入一元线性回归分析对故障的性质和程度进行估计,并给出了根据舵机输入输出特性选取估计参数的方法.仿真结果表明,所采用故障诊断算法的实时性、准确性较好,具有一定的工程实用价值.     

纯方位角目标运动分析的可观测性研究

纯方位角目标运动分析的可观测性是纯方位角观测系统中的一个基本问题.只有解决了系统的可观测性,才能进行有效的目标定位及跟踪.从随机系统的角度分析了纯方位角观测系统的可观测性,引入状态参量的Fisher信息矩阵作为判断系统可观测性的依据,提出了完全不同于判定确定性系统可观测性的随机观测系统可观测性的判定方法.最后给出了一个静止目标纯方位角观测系统的实例,说明了该方法的有效性.     

集群通信在消防通信调度指挥系统中的应用

无线通信网是消防部队在执行灭火抢险救援任务时,确保完成信息传达、灭火抢险救援指挥、协同作战等任务的关键。为了更好的开发集群通信的功能,介绍了集群通信的概念、组网方式,并探讨了通信区域扩展的方法。     

射频发射模块非线性效应的消除方法

射频模块存在相位特性的非线性效应,群延迟随频率的变化不再是一个常数,并可能造成输出射频信号的波形失真,而影响精密射频信号源的输出精度。基于递归最小二乘算法的自适应滤波器,提出了消除其非线性效应的新方法。并以GPS模拟源为例,利用其自校模块,采用软件无线电和数字信号处理技术,精确估计出射频模块的模型参数。将基带合成信号通过一个数字逆滤波器,以消除相位的非线性和群延迟随频率的变化。利用自编的仿真程序包,在Matlab中进行了相应的模拟计算。仿真结果表明,该方法可有效地消除相位非线性效应对射频信号的影响,输出信号的波形失真在理论上可控制在0.01%以内。     

A non-myopic scheduling method of radar sensors for maneuvering target tracking and radiation control

In decades, the battlefield environment is becoming more and more complex with plenty of electronic equipments. Thus, in order to improve the survivability of radar sensors and satisfy the requirement of maneuvering target tracking with a low probability of intercept, a non-myopic scheduling is proposed to minimize the radiation cost with tracking accuracy constraint. At first, the scheduling problem is formulated as a partially observable Markov decision process (POMDP). Then the tracking accuracy and radiation cost over the future finite time horizon are predicted by the posterior carmér-rao lower bound (PCRLB) and the hidden Markov model filter, respectively. Finally, the proposed scheduling is implemented efficiently by utilizing the branch and bound (B&B) pruning algorithm. Simulation results show that the performance of maneuvering target tracking was improved by the improved interacting multiple model (IMM), and the scheduler time and maximum memory consumption were significant reduced by the present B&B pruning algorithm without losing the optimal solution.