Related Experiment Video
Updated: May 24, 2025

11:44
Real-Time DC-dynamic Biasing Method for Switching Time Improvement in Severely Underdamped Fringing-field Electrostatic MEMS Actuators
Published on: August 15, 2014
10.3K
Analysis of the Compressed Distributed Kalman Filter Over Markovian Switching Topology
IEEE Transactions on Cybernetics
|March 3, 2025
Summary
This study introduces a compressed distributed Kalman filter (CDKF) for estimating sparse states in dynamic systems with random communication changes. The CDKF effectively reduces data dimensionality for improved estimation accuracy and stability analysis.
Area of Science:
- Control Systems Engineering
- Signal Processing
- Information Theory
Background:
- Distributed estimation of high-dimensional sparse states in stochastic dynamic systems is challenging due to complex communication topologies.
- Randomly switching communication links governed by Markovian chains introduce non-stationarity and non-independence in system matrices.
Purpose of the Study:
- To develop a novel compressed distributed Kalman filter (CDKF) for accurate state estimation in stochastic dynamic systems with time-varying communication topologies.
- To analyze the stability and performance of the proposed CDKF under weaker conditions than existing methods.
Main Methods:
- Utilizing compressed sensing (CS) theory for data compression at each sensor.
- Employing a diffusion strategy and covariance intersection fusion in a compressed low-dimensional space.
- Applying reconstruction techniques to recover the original high-dimensional sparse state vector.
- Leveraging stochastic stability theory, Markov chain theory, and CS theory for stability analysis.
Main Results:
- The proposed CDKF effectively estimates high-dimensional sparse state vectors.
- Stability analysis established an upper bound for estimation error under a compressed cooperative excitation condition.
- This condition is significantly weaker than traditional uncompressed collective observability conditions.
Conclusions:
- The CDKF offers a robust and efficient solution for distributed estimation in dynamic systems with complex communication environments.
- The theoretical framework provides a rigorous stability analysis, paving the way for practical applications.
Related Concept Videos
Transfer Function to State Space
185
State-space representation is a powerful tool for simulating physical systems on digital computers, necessitating the conversion of the transfer function into state-space form. Consider an nth-order linear differential equation with constant coefficients, like those encountered in an RLC circuit. The state variables are selected as the output and its n−1 derivatives. Differentiating these variables and substituting them back into the original equation produces the state equations.
In an...
In an...
185
State Space Representation
160
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Consider an RLC circuit, a...
160
BIBO stability of continuous and discrete -time systems
321
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
321
Linear time-invariant Systems
202
A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
202
Block Diagram Reduction
149
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
149
State Space to Transfer Function
165
The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
165

