Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 388

The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.

A variance-constrained approach to recursive state estimation for time-varying complex networks with missing measurements

Open access
Hu, Jun, Wang, Zidong, Liu, Steven, Gao, Huijun·2016·Automatica

Abstract

In this paper, the recursive state estimation problem is investigated for an array of discrete time-varying coupled stochastic complex networks with missing measurements. A set of random variables satisfying certain probabilistic distributions is introduced to characterize the phenomenon of the missing measurements, where each sensor can have individual missing probability. The Taylor series expansion is employed to deal with the nonlinearities and the high-order terms of the linearization errors are estimated. The purpose of the addressed state estimation problem is to design a time-varying state estimator such that, in the presence of the missing measurements and the random disturbances, an upper bound of the estimation error covariance can be guaranteed and the explicit expression of the estimator parameters is given. By using the Riccati-like difference equations approach, the estimator parameter is characterized by the solutions to two Riccati-like difference equations. It is shown that the obtained upper bound is minimized by the designed estimator parameters and the proposed state estimation algorithm is of a recursive form suitable for online computation. Finally, an illustrative example is provided to demonstrate the feasibility and effectiveness of the developed state estimation scheme.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.automatica.2015.11.008

Cites

17 of 17 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 388

Metadata

Authors
Hu, J., Wang, Z., Liu, S., & Gao, H.
Venue
Automatica
Publisher
Elsevier BV
Published
2016-02
Volume
64
Pages
155-162
ISSN
0005-1098 (ISSN-L)
OpenAlex
W2192655208
Cited by
388
References
17
FWCI
55.37
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.