1989
DOI: 10.1080/00207728908910266
|View full text |Cite
|
Sign up to set email alerts
|

Manoeuvring target tracking algorithm for a radar system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1992
1992
2015
2015

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…All of these approaches increase the effective filter bandwidth so as to respond more rapidly to the measurement data during a manoeuvre; but they are risky in the presence of clutter since they increase the size of the validation gate. Some of the more recent approaches to manoeuvring target tracking include: adaptive Kalman filters [61,39], filters using correlated and semi-Markov process noise [120,119,60] usually implemented using multiple model (partitioning) filters and filter banks [131,58,95,114,125,141]; filters based on Poisson and renewal process models of acceleration [86,128]; input estimation [35,36] and input and onset-time estimation [33,38,116]; variable dimension filters [13]; track splitting filters with a finite memory constraint [147]; the generalised pseudo-Bayesian (GPB) algorithm [68,1]; and the interacting multiple model (IMM) algorithm [31,28,96]. A second-order extension of the IMM algorithm was developed in [26].…”
Section: Introductionmentioning
confidence: 99%
“…All of these approaches increase the effective filter bandwidth so as to respond more rapidly to the measurement data during a manoeuvre; but they are risky in the presence of clutter since they increase the size of the validation gate. Some of the more recent approaches to manoeuvring target tracking include: adaptive Kalman filters [61,39], filters using correlated and semi-Markov process noise [120,119,60] usually implemented using multiple model (partitioning) filters and filter banks [131,58,95,114,125,141]; filters based on Poisson and renewal process models of acceleration [86,128]; input estimation [35,36] and input and onset-time estimation [33,38,116]; variable dimension filters [13]; track splitting filters with a finite memory constraint [147]; the generalised pseudo-Bayesian (GPB) algorithm [68,1]; and the interacting multiple model (IMM) algorithm [31,28,96]. A second-order extension of the IMM algorithm was developed in [26].…”
Section: Introductionmentioning
confidence: 99%