zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Consensus based overlapping decentralized estimation with missing observations and communication faults. (English) Zbl 1166.93374
Summary: A new algorithm for discrete-time overlapping decentralized state estimation of large scale systems is proposed in the form of a multi-agent network based on a combination of local estimators of Kalman filtering type and a dynamic consensus strategy, assuming intermittent observations and communication faults. Under general conditions concerning the agent resources and the network topology, conditions are derived for the convergence to zero of the estimation error mean and for the mean-square estimation error boundedness. A centralized strategy based on minimization of the steady-state mean-square estimation error is proposed for selection of the consensus gains; these gains can also be adjusted by local adaptation schemes. It is also demonstrated that there exists a connection between the network complexity and efficiency of denoising, i.e., of suppression of the measurement noise influence. Several numerical examples serve to illustrate characteristic properties of the proposed algorithm and to demonstrate its applicability to real problems.
93E10Estimation and detection in stochastic control
93A15Large scale systems
93A14Decentralized systems
93E11Filtering in stochastic control
90B15Network models, stochastic (optimization)
93C55Discrete-time control systems