.png){kind=icon}
.png){kind=icon}
Return
An Interpolatory Algorithm for Distributed Set Membership Estimation in Asynchronous Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3123210.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses distributed estimation problems over asynchronous networks in a set membership framework. The agents in the network asynchronously collect and process measurements, communicate over a possibly time-varying and unbalanced directed graph and may have nonnegligible computation times. Measurements are affected by bounded errors so that they define feasible sets containing the unknown parameters to be estimated. The proposed algorithm requires each agent to compute a weighted average of its estimate and those of its neighbors and to project it onto a local feasible set. By assuming convexity of the measurement sets, the local estimates are shown to converge to a common point belonging to the global feasible set.
Keywords:
Estimation
Peer-to-peer computing
Time measurement
Noise measurement
Particle measurements
Network topology
Knowledge engineering
Distributed estimation
set membership estimation
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W