Event-triggered distributed estimation with decaying communication rate
From MaRDI portal
Publication:5072289
DOI10.1137/21M1405083zbMATH Open1489.93072arXiv2103.06035OpenAlexW3135232647MaRDI QIDQ5072289FDOQ5072289
Authors: Xingkang He, Yu Xing, Junfeng Wu, Karl Henrik Johansson 
Publication date: 27 April 2022
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Abstract: We study distributed estimation of a high-dimensional static parameter vector through a group of sensors whose communication network is modeled by a fixed directed graph. Different from existing time-triggered communication schemes, an event-triggered asynchronous scheme is investigated in order to reduce communication while preserving estimation convergence. A distributed estimation algorithm with a single step size is first proposed based on an event-triggered communication scheme with a time-dependent decaying threshold. With the event-triggered scheme, each sensor sends its estimate to neighbor sensors only when the difference between the current estimate and the last sent-out estimate is larger than the triggering threshold. We prove that the proposed algorithm has mean-square and almost-sure convergence respectively, under an integrated condition of sensor network topology and sensor measurement matrices. The condition is satisfied if the topology is a balanced digraph containing a spanning tree and the system is collectively observable. Moreover, we provide estimates for the convergence rates, which are related to the step size as well as the triggering threshold. Furthermore, as an essential metric of sensor communication intensity in the event-triggered distributed algorithms, the communication rate is proved to decay to zero with a certain speed almost surely as time goes to infinity. We show that given the step size, adjusting the decay speed of the triggering threshold can lead to a tradeoff between the convergence rate of the estimation error and the decay speed of the communication rate. Specifically, increasing the decay speed of the threshold would make the communication rate decay faster, but reduce the convergence rate of the estimation error. Numerical simulations are provided to illustrate the developed results.
Full work available at URL: https://arxiv.org/abs/2103.06035
Recommendations
- Event-triggered distributed state estimation over wireless sensor networks
- Distributed state estimation in sensor networks with event-triggered communication
- Distributed state and fault estimation over sensor networks with probabilistic quantizations: the dynamic event-triggered case
- Distributed Kalman consensus filter with event-triggered communication: formulation and stability analysis
- Distributed estimation for parameter in heterogeneous linear time-varying models with observations at network sensors
Discrete event control/observation systems (93C65) Estimation and detection in stochastic control theory (93E10) Networked control (93B70)
Cites Work
- Title not available (Why is that?)
- Stochastic approximation and its applications
- Graph theoretic methods in multiagent networks
- Stability of Recursive Stochastic Tracking Algorithms
- Kalman Filtering With Intermittent Observations
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability
- Adaptive sampling for linear state estimation
- Event-Based Sensor Data Scheduling: Trade-Off Between Communication Rate and Estimation Quality
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks
- Diffusion recursive least-squares for distributed estimation over adaptive networks
- Distributed estimation for parameter in heterogeneous linear time-varying models with observations at network sensors
- Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
- Estimating time-varying parameters by the Kalman filter based algorithm: stability and convergence
- Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis
- Diffusion LMS Strategies for Distributed Estimation
- Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
- Adaptive Sensing for Estimation of Structured Sparse Signals
- Distributed Parameter Estimation Over Unreliable Networks With Markovian Switching Topologies
- Constrained Adaptive Sensing
- Event-triggered identification of FIR systems with binary-valued output observations
- Distributed linear parameter estimation: asymptotically efficient adaptive strategies
- Asymptotically Optimal Parameter Estimation With Scheduled Measurements
- Optimal Parameter Estimation Under Controlled Communication Over Sensor Networks
- A distributed Kalman filter with event-triggered communication and guaranteed stability
- Distributed Event-Based State Estimation for Networked Systems: An LMI Approach
- Distributed Kalman Filters With State Equality Constraints: Time-Based and Event-Triggered Communications
- Decentralized Online Convex Optimization With Event-Triggered Communications
- Resilient Distributed Field Estimation
- Decentralized Cooperative Online Estimation With Random Observation Matrices, Communication Graphs and Time Delays
Cited In (2)
This page was built for publication: Event-triggered distributed estimation with decaying communication rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072289)
