zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Integrated probabilistic data association-finite resolution. (English) Zbl 0839.93069
This paper discusses the problem of data association and track existence for sensors with finite resolution. An integrated algorithm called IPDA-FR (Integrated Probabilistic Data Association-Finite Resolution) is presented: It provides data association formulae and recursive formulae for probability of track existence. Its derivation follows the IPDA algorithm [the authors and S. Stankovic, IEEE Trans. Autom. Control 39, 1237-1241 (1994; Zbl 0811.93057)] extending it to fit the finite resolution sensor model. They discuss two cases: the static clutter where a complete clutter map is available and the case where no a priori false alarm statistics are assumed. A simulation study illustrates the difference between IPDA-FR and IPDA algorithms in terms of true and false track discrimination and state estimation error.
MSC:
93E10Estimation and detection in stochastic control
93E25Computational methods in stochastic control