Proceedings ArticleDOI
Distributed Kalman filtering for sensor networks
Reza Olfati-Saber
- pp 5492-5498
TLDR
A continuous-time distributed Kalman filter that uses local aggregation of the sensor data but attempts to reach a consensus on estimates with other nodes in the network and gives rise to two iterative distributedKalman filtering algorithms with different consensus strategies on estimates.Abstract:
In this paper, we introduce three novel distributed Kalman filtering (DKF) algorithms for sensor networks. The first algorithm is a modification of a previous DKF algorithm presented by the author in CDC-ECC '05. The previous algorithm was only applicable to sensors with identical observation matrices which meant the process had to be observable by every sensor. The modified DKF algorithm uses two identical consensus filters for fusion of the sensor data and covariance information and is applicable to sensor networks with different observation matrices. This enables the sensor network to act as a collective observer for the processes occurring in an environment. Then, we introduce a continuous-time distributed Kalman filter that uses local aggregation of the sensor data but attempts to reach a consensus on estimates with other nodes in the network. This peer-to-peer distributed estimation method gives rise to two iterative distributed Kalman filtering algorithms with different consensus strategies on estimates. Communication complexity and packet-loss issues are discussed. The performance and effectiveness of these distributed Kalman filtering algorithms are compared and demonstrated on a target tracking task.read more
Citations
More filters
Journal ArticleDOI
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
TL;DR: In this article, the authors reviewed some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006 and proposed several promising research directions along with some open problems that are deemed important for further investigations.
Posted Content
An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination
TL;DR: In this paper, the authors reviewed some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006, and proposed several promising research directions along with some open problems that are deemed important for further investigations.
Journal ArticleDOI
Architectures for distributed and hierarchical Model Predictive Control - A review
TL;DR: A classification of a number of decentralized, distributed and hierarchical control architectures for large scale systems is proposed and attention is focused on the design approaches based on Model Predictive Control.
Journal ArticleDOI
Diffusion Strategies for Distributed Kalman Filtering and Smoothing
TL;DR: This work studies the problem of distributed Kalman filtering and smoothing, and proposes diffusion algorithms to solve each one of these problems, and compares the simulation results with the theoretical expressions, and notes that the proposed approach outperforms existing techniques.
Journal ArticleDOI
Distributed model predictive control: A tutorial review and future research directions
TL;DR: The goal is to not only conceptually review the results in this area but also to provide enough algorithmic details so that the advantages and disadvantages of the various approaches can become quite clear.
References
More filters
Journal ArticleDOI
Consensus problems in networks of agents with switching topology and time-delays
TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Journal ArticleDOI
Consensus and Cooperation in Networked Multi-Agent Systems
TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.
Journal ArticleDOI
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Wei Ren,Randal W. Beard +1 more
TL;DR: It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.