Recently several new results for Cramer-Rao lower bounds (CRLBs) in dynamical systems have been developed. Several different approaches and approximations have been presented. For the general case of target tracking with a detection probability smaller than one and possibly in the presence of false measurements, two main approaches have been presented. The first approach is the information reduction factor (IRF) approach. The second approach is the enumeration (ENUM) approach, also referred to as the conditioning approach. It has been found that the ENUM approach leads to a strictly larger covariance matrix than the IRF approach, however, still providing a lower bound on the attainable error covariance. Thus, the ENUM approach provides a strictly tighter bound on the attainable performance. It has been conjectured that these bounds converge to one another in the limit or equivalently after an initial transition stage. We demonstrate, using some recent results from the modified Riccati equation (MRE) and by means of counter examples, that this conjecture does not hold true in general. We also demonstrate that the conjecture does hold true in the special case of deterministic target motion, or equivalently in the absence of process noise. Furthermore, we show that the detection probability has an influence on the limiting behaviors of the bounds. Moreover, we show that the MRE approximation provides a very good and computationally efficient approximation of the ENUM bound. The various results are illustrated by means of representative examples.
|Number of pages||7|
|Journal||IEEE transactions on aerospace and electronic systems|
|Publication status||Published - Apr 2009|