序贯处理的多传感器航迹融合算法研究

基于分布式的多传感器航迹融合系统,采用序贯处理的方法并结合矩阵加权的融合算法,在估计误差协方差阵迹最小的准则下,提出了估计误差相关条件下的航迹融合算法,从理论上对算法的航迹融合性能进行了分析,并进行了仿真。仿真结果表明了基于序贯处理的融合算法的可行性和有效性。     

带反馈信息的多传感器航迹融合算法

基于分布式多传感器航迹融合系统,采用序贯处理的方法,研究了相关条件下带反馈信息的多传感器航迹融合问题.以估计误差方差阵迹最小准则导出了相应的融合算法,并进行了仿真分析.仿真结果表明带反馈信息的多传感器航迹融合算法的可行性和有效性,同时也表明带反馈的融合算法比不带反馈的融合算法具有更高的跟踪精度.     

通信受限下网络化多传感器系统序贯卡尔曼滤波加权融合

针对通信受限下网络化多传感器系统难以实时滤波的问题,提出实时序贯滤波融合方法和故障诊断方法.首先基于周期性分组传输通信策略,采用序贯卡尔曼滤波方法,对当前时刻访问融合中心的传感器组进行局部滤波,并导出剩余传感器组的最优局部估计,进而得到线性最小方差意义下的最优融合估计.利用残差加权平方和方法对发生故障的传感器进行定位,仿真结果验证了所提出算法的有效性.     

多传感器标量加权最优信息融合稳态Ka lman 滤波器

提出一种新的标量加权多传感器线性最小方差意义下的最优信息融合准则．该准则考虑了局部估计误差之间的相关性，只需计算加权标量系数，避免了加权矩阵的计算，明显减小了计算量，便于实时应用．运用稳态Kalman滤波理论，基于该融合准则，给出了多传感器最优信息融合稳态Kalman滤波器．在所有局部滤波器达到稳态时，只需一次融合便可获得信息融合稳态滤波器，算法简单．仿真例子验证了其有效性．     

一种基于点迹重构的异步序贯航迹融合算法

针对异步航迹融合问题,提出了一种基于伪点迹异步序贯航迹融合算法,伪点迹由局部估计结果重构形成,从而无需对局部估计间的相关误差进行处理。同时,对重构的异步伪量测数据情况采用序贯处理方式,这种串行合并式数据处理过程,不但避免了对异步数据进行时间校正的麻烦,反而利用了异步数据增加了多传感器系统的总体数据率,提高了多传感器系统对目标的跟踪精度。并用仿真结果证明了该算法的有效性。     

广义系统信息融合稳态与自校正满阶Kalman滤波器

基于线性最小方差标量加权融合算法和射影理论,对带多个传感器和带相关噪声的广义系统,提出了分布式标量加权融合稳态满阶Kalman滤波器.推得了任两个传感器子系统之间的稳态满阶滤波误差互协方差阵,其解可任选初值离线迭代计算.所提出的稳态融合滤波器避免了每时刻计算协方差阵和融合权重,减小了在线计算负担.当系统含有未知模型参数时,基于递推增广最小二乘算法和标量加权融合算法,提出了一种两段融合自校正状态滤波器.其中第1段融合获得未知参数的融合估计;第2段融合获得分布式自校正融合状态滤波器.与局部估计和加权平均融合估计相比,所提出的标量加权融合参数估计和自校正状态估计都具有更高的精度.仿真研究验证了其有效性.     

一种面向互联概率加权的JPDA多传感器数据融合方法

针对单传感器联合概率数据互联(Joint Probabilistic Data Association, JPDA)在复杂环境下难以跟踪多个目标的问题,提出一种基于JPDA量测目标互联概率统计加权并行式和序贯式多传感器数据融合方法。首先,给出单传感器JPDA算法。然后,介绍多传感器JPDA数学模型,基于这一模型,使用互联概率加权,推导并行式和序贯式多传感器数据融合公式,这对多传感器数据融合有一定指导意义。最后,对单传感器JPDA方法在不同杂波密度、不同过程和不同观测噪声下目标跟踪的距离RMSE进行仿真,结果表明,随着这3项指标皆增大,目标距离RMSE增大;同时,对本文的2类多传感器JPDA方法与其他几类跟踪方法在数据集PETS2009下有关行人跟踪性能进行仿真,结果表明,本文并行式和序贯式多传感器JPDA方法相较于其他方法在跟踪准确性、跟踪位置准确性、航迹维持以及航迹遗失上皆为最优,而且序贯式融合略优于并行式多传感器JPDA。     

具有形状信息的多传感器群目标跟踪算法

针对多传感器环境下具有形状信息的扩展/群目标跟踪问题,提出了两种融合算法,即高斯逆韦氏并行PHD滤波算法和高斯逆韦氏序贯PHD滤波算法。新算法分别结合并行滤波和序贯滤波算法思想,能够对扩展/群目标的质心状态进行跟踪,对形状进行有效估计。高斯逆韦氏并行PHD滤波算法将各个传感器产生的量测集合并到一个量测集中,统一对量测集进行划分。在滤波更新阶段,对划分后的量测集进行扩维,从而在形式上将多传感器环境下的跟踪问题转化为单传感器环境下的跟踪问题。高斯逆韦氏序贯PHD滤波算法则先对各个传感器产生的量测集依次进行划分,再依次对每一个划分后的量测集进行滤波,从而达到融合多个传感器量测的目的。仿真结果表明该算法的可行性和有效性。     

带有色观测噪声多传感器多重时滞系统分布式融合滤波器

基于新息分析方法, 对带有色观测噪声的多重时滞系统, 提出了一种带白噪声估值器的非增广的最优滤波器. 它等价于一个带相关白噪声多重时滞系统的一步预报器. 当系统带有多个传感器时, 推导了多重时滞系统的任意两个传感器子系统之间的估计误差互协方差阵. 基于线性最小方差最优加权融合估计算法, 给出了分布式加权融合最优滤波器. 分布式融合估计比基于每个传感器的局部估计具有更高的精度. 比增广的集中式最优滤波器具有更好的可靠性, 且避免了高维计算和大存储空间. 仿真例子验证了其有效性.     

基于异质多传感器的网络分布数据融合的一种算法

针对多异质传感器数据融合能够实现信息互补,改善目标跟踪精度,提出了一种异质多传感器异步量测融合算法,即首先将量测方程线性化,再在砷合中心通过建立伪量测方程,得到同步的量测数据,然后利用噪声相关的伪序贯思想进行融合处理得到全局估计,与现有算法进行仿真比较,结果表明了该算法的有效性。     

多传感器分布式信息融合粒子滤波器

针对非线性非Gaussian系统的状态估计问题,提出一种基于信息融合的多传感器分布式粒子滤波算法。该算法首先利用粒子滤波方法分别计算局部传感器的状态估值,再应用分布式标量加权融合准则对状态估值进行信息融合。仿真结果表明和单传感器情形相比可提高滤波的精度。     

Multi-sensor distributed fusion filtering for networked systems with different delay and loss rates

This paper mainly focuses on the multi-sensor distributed fusion estimation problem for networked systems with time delays and packet losses. Measurements of individual sensors are transmitted to local processors over different communication channels with different random delay and packet loss rates. Several groups of Bernoulli distributed random variables are employed to depict the phenomena of different time delays and packet losses. Based on received measurements of individual sensors, local processors produce local estimates that have been developed in a new recent literature. Then local estimates are transmitted to the fusion center over a perfect connection, where a distributed fusion filter is obtained by using the well-known matrix-weighted fusion estimation algorithm in the linear minimum variance sense. The filtering error cross-covariance matrices between any two local filters are derived. The steady-state property of the proposed distributed fusion filter is analyzed. A simulation example verifies the effectiveness of the algorithm.     

Fusion estimation in clustering sensor networks under stochastic deception attacks

In this paper, a fusion estimation problem in clustering sensor networks under stochastic deception attacks is investigated. The sensors are divided into several clusters, and a local estimator is embedded in each cluster. During the network transmissions, deception attacks are considered to randomly occur and the statuses of the attacks are described by a set of Bernoulli variables. By using the clustering sampled information, a local minimum variance filter is derived and the filter gains are recursively determined. By using the local estimates and the local estimation error covariance matrices, a covariance intersection fusion algorithm is presented for the fusion centre to generate the final estimate. Moreover, the relationship between the trace of the local estimation error covariance matrix and the uniform successful attack rate is analysed. An illustrative example is given to shown the effectiveness of the proposed theoretical results.     

Distributed fusion Kalman filtering under binary sensors

Binary sensors are special sensors that only transmit one‐bit information at each time and have been widely applied to environmental awareness and medical monitoring. This paper is concerned with the distributed fusion Kalman filtering problem for a class of binary sensor systems. A novel uncertainty approach is proposed to better extract valid information from binary sensors at switching instant. By minimizing a local estimation error covariance, the local robust Kalman estimates are firstly obtained. Then, the distributed fusion Kalman filter is designed by resorting to the covariance intersection fusion criterion. Finally, a blood oxygen content model is employed to show the effectiveness of the proposed methods.     

Multi-sensor optimal information fusion Kalman filter

This paper presents a new multi-sensor optimal information fusion criterion weighted by matrices in the linear minimum variance sense, it is equivalent to the maximum likelihood fusion criterion under the assumption of normal distribution. Based on this optimal fusion criterion, a general multi-sensor optimal information fusion decentralized Kalman filter with a two-layer fusion structure is given for discrete time linear stochastic control systems with multiple sensors and correlated noises. The first fusion layer has a netted parallel structure to determine the cross covariance between every pair of faultless sensors at each time step. The second fusion layer is the fusion center that determines the optimal fusion matrix weights and obtains the optimal fusion filter. Comparing it with the centralized filter, the result shows that the computational burden is reduced, and the precision of the fusion filter is lower than that of the centralized filter when all sensors are faultless, but the fusion filter has fault tolerance and robustness properties when some sensors are faulty. Further, the precision of the fusion filter is higher than that of each local filter. Applying it to a radar tracking system with three sensors demonstrates its effectiveness.     

通信受限下网络化多传感器系统的Kalman融合估计

研究了一类通信受限下网络化多传感器系统的 Kalman 融合估计问题, 其中通信受限 是指系统在一个采样周期内只允许有限个传感器与融合中心通信. 首先, 提出了一种周期性分组传输的通信策略, 并将每组传感器所对应的局部估计系统描述成一个离散周期子系统模型. 其次, 每个子系统根据最新测量信息的更新时刻, 选择相应的 Kalman 估计器 (滤波器或预报器), 从而得到各子系统在每一时刻的一个局部最优估计, 再通过矩阵加权线性最小方差最优融合准则得到最优融合估计,并给出了Kalman融合估计器的设计方法. 最后, 通过一个目标跟踪例子验证所提方法的有效性.     

多传感器时滞系统信息融合最优Kalman滤波器

基于线性最小方差最优加权融合估计算法,对多传感器的离散线性状态时滞随机系统,给出了一种非增广分布式加权融合最优Kalman滤波器.推导了状态时滞系统任两个传感器子系统之间的滤波误差互协方差阵的计算公式.它与状态增广加权融合滤波器具有相同的精度.与每个传感器的局部滤波器相比,分布式融合滤波器具有更高的精度.与状态和观测增广最优滤波器相比,具有较小的精度.但避免了增广所带来的高维计算和大的空间存储,可减小计算负担.仿真例子验证了其有效性.     

Distributed fusion estimation for multi-sensor asynchronous sampling systems with correlated noises

This paper is concerned with the distributed fusion estimation problem for a class of multi-sensor asynchronous sampling systems with correlated noises. The state updates uniformly and the sensors sample randomly. Based on the measurement augmentation method, the asynchronous sampling system is transformed to the synchronous sampling one. Local filter is designed by using an innovation analysis approach. Then, the filtering error cross-covariance matrix between any two local filters is derived. Finally, the optimal distributed fusion filter is proposed by using matrix-weighted fusion algorithm in the linear minimum variance sense. Simulation results show the effectiveness of the proposed algorithms.