Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

Composite Disturbance Filtering: A Novel State Estimation Scheme for Systems With Multi-Source, Heterogeneous, and Isomeric Disturbances

State estimation has long been a fundamental problem in signal processing and control areas. The main challenge is to design filters with ability to reject or attenuate various disturbances. With the arrival of big data era, the disturbances of complicated systems are physically multi-source, mathematically heterogenous, affecting the system dynamics via isomeric (additive, multiplicative and recessive) channels, and deeply coupled with each other. In traditional filtering schemes, the multi-source heterogenous disturbances are usually simplified as a lumped one so that the "single" disturbance can be either rejected or attenuated. Since the pioneering work in 2012, a novel state estimation methodology called {\it composite disturbance filtering} (CDF) has been proposed, which deals with the multi-source, heterogenous, and isomeric disturbances based on their specific characteristics. With the CDF, enhanced anti-disturbance capability can be achieved via refined quantification, effective separation, and simultaneous rejection and attenuation of the disturbances. In this paper, an overview of the CDF scheme is provided, which includes the basic principle, general design procedure, application scenarios (e.g. alignment, localization and navigation), and future research directions. In summary, it is expected that the CDF offers an effective tool for state estimation, especially in the presence of multi-source heterogeneous disturbances

Distributed Kalman Filters over Wireless Sensor Networks: Data Fusion, Consensus, and Time-Varying Topologies

Kalman filtering is a widely used recursive algorithm for optimal state estimation of linear stochastic dynamic systems. The recent advances of wireless sensor networks (WSNs) provide the technology to monitor and control physical processes with a high degree of temporal and spatial granularity. Several important problems concerning Kalman filtering over WSNs are addressed in this dissertation. First we study data fusion Kalman filtering for discrete-time linear time-invariant (LTI) systems over WSNs, assuming the existence of a data fusion center that receives observations from distributed sensor nodes and estimates the state of the target system in the presence of data packet drops. We focus on the single sensor node case and show that the critical data arrival rate of the Bernoulli channel can be computed by solving a simple linear matrix inequality problem. Then a more general scenario is considered where multiple sensor nodes are employed. We derive the stationary Kalman filter that minimizes the average error variance under a TCP-like protocol. The stability margin is adopted to tackle the stability issue. Second we study distributed Kalman filtering for LTI systems over WSNs, where each sensor node is required to locally estimate the state in a collaborative manner with its neighbors in the presence of data packet drops. The stationary distributed Kalman filter (DKF) that minimizes the local average error variance is derived. Building on the stationary DKF, we propose Kalman consensus filter for the consensus of different local estimates. The upper bound for the consensus coefficient is computed to ensure the mean square stability of the error dynamics. Finally we focus on time-varying topology. The solution to state consensus control for discrete-time homogeneous multi-agent systems over deterministic time-varying feedback topology is provided, generalizing the existing results. Then we study distributed state estimation over WSNs with time-varying communication topology. Under the uniform observability, each sensor node can closely track the dynamic state by using only its own observation, plus information exchanged with its neighbors, and carrying out local computation

Towards Informed Exploration for Deep Reinforcement Learning

In this thesis, we discuss various techniques for improving exploration for deep reinforcement learning. We begin with a brief review of reinforcement learning (RL) and the fundamental v.s. exploitation trade-off. Then we review how deep RL has improved upon classical and summarize six categories of the latest exploration methods for deep RL, in the order increasing usage of prior information. We then explore representative works in three categories discuss their strengths and weaknesses. The first category, represented by Soft Q-learning, uses regularization to encourage exploration. The second category, represented by count-based via hashing, maps states to hash codes for counting and assigns higher exploration to less-encountered states. The third category utilizes hierarchy and is represented by modular architecture for RL agents to play StarCraft II. Finally, we conclude that exploration by prior knowledge is a promising research direction and suggest topics of potentially impact

Some New Results in Distributed Tracking and Optimization

The current age of Big Data is built on the foundation of distributed systems, and efficient distributed algorithms to run on these systems.With the rapid increase in the volume of the data being fed into these systems, storing and processing all this data at a central location becomes infeasible. Such a central \textit{server} requires a gigantic amount of computational and storage resources. Even when it is possible to have central servers, it is not always desirable, due to privacy concerns. Also, sending huge amounts of data to such servers incur often infeasible bandwidth requirements. In this dissertation, we consider two kinds of distributed architectures: 1) star-shaped topology, where multiple worker nodes are connected to, and communicate with a server, but the workers do not communicate with each other; and 2) mesh topology or network of interconnected workers, where each worker can communicate with a small number of neighboring workers. In the first half of this dissertation (Chapters 2 and 3), we consider distributed systems with mesh topology.We study two different problems in this context. First, we study the problem of simultaneous localization and multi-target tracking. Multiple mobile agents localize themselves cooperatively, while also tracking multiple, unknown number of mobile targets, in the presence of measurement-origin uncertainty. In situations with limited GPS signal availability, agents (like self-driving cars in urban canyons, or autonomous vehicles in hazardous environments) need to rely on inter-agent measurements for localization. The agents perform the additional task of tracking multiple targets (pedestrians and road-signs for self-driving cars). We propose a decentralized algorithm for this problem. To be effective in real-time applications, we propose efficient Gaussian and Gaussian-mixture based filters, rather than the computationally expensive particle-based methods in the existing literature. Our novel factor-graph based approach gives better performance, in terms of both agent localization errors, and target-location and cardinality errors. Next, we study an online convex optimization problem, where a network of agents cooperate to minimize a global time-varying objective function. Only the local functions are revealed to individual agents. The agents also need to satisfy their individual constraints. We propose a primal-dual update based decentralized algorithm for this problem. Under standard assumptions, we prove that the proposed algorithm achieves sublinear regret and constraint violation across the network. In other words, over a long enough time horizon, the decisions taken by the agents are, on average, as good as if all the information was revealed ahead of time. In addition, the individual constraint violations of the agents, averaged over time, are zero. In the next part of the dissertation (Chapters 4), we study distributed systems with a star-shaped topology. The problem we study is distributed nonconvex optimization. With the recent success of deep learning, coupled with the use of distributed systems to solve large-scale problems, this problem has gained prominence over the past decade. The recently proposed paradigm of Federated Learning (which has already been deployed by Google/Apple in Android/iOS phones) has further catalyzed research in this direction. The problem we consider is minimizing the average of local smooth, nonconvex functions. Each node has access only to its own loss function, but can communicate with the server, which aggregates updates from all the nodes, before distributing them to all the nodes. With the advent of more and more complex neural network architectures, these updates can be high dimensional. To save resources, the problem needs to be solved via communication-efficient approaches. We propose a novel algorithm, which combines the idea of variance-reduction, with the paradigm of carrying out multiple local updates at each node before averaging. We prove the convergence of the approach to a first-order stationary point. Our algorithm is optimal in terms of computation, and state-of-the-art in terms of the communication requirements. Lastly in Chapter 5, we consider the situation when the nodes do not have access to function gradients, and need to minimize the loss function using only function values. This problem lies in the domain of zeroth-order optimization. For simplicity of analysis, we study this problem only in the single-node case. This problem finds application in simulation-based optimization, and adversarial example generation for attacking deep neural networks. We propose a novel function value based gradient estimator, which has better variance, and better query-efficiency compared to existing estimators. The proposed estimator covers the most commonly used existing estimators as special cases. We conduct a comprehensive convergence analysis under different conditions. We also demonstrate its effectiveness through a real-world application to generating adversarial examples from a black-box deep neural network

A Review of Consensus-based Multi-agent UAV Implementations

In this paper, a survey on distributed control applications for multi Unmanned Aerial Vehicles (UAVs) systems is proposed.The focus is on consensus-based control, and both rotary-wing and fixed-wing UAVs are considered. On one side, the latest experimental configurations for the implementation of formation flight are analysed and compared for multirotor UAVs. On the other hand, the control frameworks taking into account the mobility of the fixed-wing UAVs performing target tracking are considered. This approach can be helpful to assess and compare the solutions for practical applications of consensus in UAV swarms

Widely Linear State Space Filtering of Improper Complex Signals

Complex signals are the backbone of many modern applications, such as power systems, communication systems, biomedical sciences and military technologies. However, standard complex valued signal processing approaches are suited to only a subset of complex signals known as proper, and are inadequate of the generality of complex signals, as they do not fully exploit the available information. This is mainly due to the inherent blindness of the algorithms to the complete second order statistics of the signals, or due to under-modelling of the underlying system. The aim of this thesis is to provide enhanced complex valued, state space based, signal processing solutions for the generality of complex signals and systems. This is achieved based on the recent advances in the so called augmented complex statistics and widely linear modelling, which have brought to light the limitations of conventional statistical complex signal processing approaches. Exploiting these developments, we propose a class of widely linear adaptive state space estimation techniques, which provide a unified framework and enhanced performance for the generality of complex signals, compared with conventional approaches. These include the linear and nonlinear Kalman and particle filters, whereby it is shown that catering for the complete second order information and system models leads to significant performance gains. The proposed techniques are also extended to the case of cooperative distributed estimation, where nodes in a network collaborate locally to estimate signals, under a framework that caters for general complex signals, as well as the cross-correlations between observation noises, unlike earlier solutions. The analysis of the algorithms are supported by numerous case studies, including frequency estimation in three phase power systems, DIFAR sonobuoy underwater target tracking, and real-world wind modeling and prediction.Open Acces