多任务网络中的分布式扩散卡尔曼滤波器
A Distributed Diffusion Kalman Filter In Multitask Networks
摘要:
分布式扩散卡尔曼滤波器(DDKF)算法在其所有的幅度最近赢得了极大的关注,并已显示出一个精心设计的方法来解决网络上的分布式优化问题。由节点集体地估计和跟踪单个状态向量一直是焦点。然而,在现实中,有几个面向多任务的问题,其中每个节点的最佳状态向量可能不相同。它的目标是同时知道许多相关的任务,而不是典型的单任务问题。这项工作认为传感器网络的分布式多任务跟踪,其中个别节点与其直接节点进行通信。提出了一种基于扩散的分布式多任务跟踪算法。这是通过实现一个无监督的自适应聚类过程来实现的,该过程有助于节点形成集群并在任务上进行协作。对于分布式目标跟踪,一种自适应聚类方法,它使代理能够通过自适应调整组合权重来识别和选择节点,以便估计公共状态向量。这产生了一个有效的合作水平,以提高状态向量估计精度,特别是在集群的背景经验是未知的情况下。为了证明我们的算法的效率,进行了计算机模拟。比较已进行扩散卡尔曼滤波器多任务方面的自适应,然后结合(ATC)扩散计划,利用静态和自适应组合权重。结果表明,ATC扩散格式算法具有良好的性能与自适应组合相比,静态组合。
英文摘要:
The Distributed Diffusion Kalman Filter (DDKF) algorithm in all its magnitude has earned great attention lately and has shown an elaborate way to address the issue of distributed optimization over networks. Estimation and tracking of a single state vector collectively by nodes have been the point of focus. In reality, however, there are several multi-task-oriented issues where the optimal state vector for each node may not be the same. Its objective is to know many related tasks simultaneously, rather than the typical single-task problems. This work considers sensor networks for distributed multi-task tracking in which individual nodes communicate with its immediate nodes. A diffusion-based distributed multi-task tracking algorithm is developed. This is done by implementing an unsupervised adaptive clustering process, which aids nodes in forming clusters and collaborating on tasks. For distributed target tracking, an adaptive clustering approach, which gives agents the ability to identify and select through adaptive adjustments of combination weights nodes who to collaborate with and who not to in order to estimate the common state vector. This gave rise to an effective level of cooperation for improving state vector estimation accuracy, especially in cases where a cluster's background experience is unknown. To demonstrate the efficiency of our algorithm, computer simulations were conducted. Comparison has been carried out for the Diffusion Kalman Filter multitask with respect to the Adapt then combine (ATC) diffusion schemes utilizing both static and adaptive combination weights. Results showed that the ATC diffusion schemes algorithm has great performance with the adaptive combiners as compared to static combiners.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。