Although it is difficult to assess the achievable performance of nonlinear tracking applications, it nevertheless remains extremely important to do so. This paper illustrates how the mean and covariance of the estimated online state can be used to recursively calculate an approximate posterior Cramer-Rao lower bound (CRLB). Most CRLB implementations require the true state, but this is impractical except for appropriately designed experiments or simulations where the exact value of the state is given as prior knowledge. The performance of the approximate posterior CRLB (PCRLB) used in conjunction with the extended Kalman filter (EKF) and the unscented Kalman filter (UKF) for online state estimation are investigated. To test the validity of the proposed method, it was applied to the problem of tracking a ballistic object on reentry. Simulation results confirm the theory and reveal that the proposed approximate PCRLB is sufficiently accurate and that the PCRLB approximations obtained using different state filters are in general very close to each other.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Online Estimation of the Approximate Posterior Cramer-Rao Lower Bound for Discrete-Time Nonlinear Filtering


    Contributors:
    Ming Lei, (author) / van Wyk, Barend J (author) / Yong Qi, (author)


    Publication date :

    2011-01-01


    Size :

    3068611 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    A Particle Filter Approach to Approximate Posterior Cramer-Rao Lower Bound: The Case of Hidden States

    Tulsyan, Aditya / Biao Huang / Gopaluni, R. Bhushan et al. | IEEE | 2013


    An Approximate Cramer–Rao Lower Bound for Multiple LFMCW Signals

    Hamschin, Brandon M. / Grabbe, Michael T. | IEEE | 2017


    Cramer–Rao Lower Bound

    Zarchan, Paul / Musoff, Howard | AIAA | 2015