This paper examines the possibility of deriving fixed-point smoothing algorithms through exploitation of the known solutions of a higher dimensional filtering problem. It is shown that a simple state augmentation serves to imbed the given n-dimensional smoothing problem into a 2n-dimensional filtering problem. It is further shown that computation of the smoothed estimate and the corresponding error covariance does not require implementation of the 2n-dimensional filtering equations. Some new results involving systems with or without multiple time delays and having colored observation noise have been derived in order to illustrate the versatility of the proposed technique. It is also demonstrated that the present approach leads to an easier derivation of the continuous-time fixed-point smoothing algorithm reported in the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Approach to Fixed-Point Smoothing Problems


    Contributors:


    Publication date :

    1972-09-01


    Size :

    1692725 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    On the sensitivity of a fixed-point smoothing algorithm

    Sinha, A. / Mahalanabis, A. | Tema Archive | 1973


    On the Sensitivity of a Fixed-Point Smoothing Algorithm

    Sinha, A.K. / Mahalanabis, A.K. | IEEE | 1973


    Fixed interval smoothing - Revisited

    MCREYNOLDS, STEPHEN RALPH | AIAA | 1990


    Fixed-Point Smoothing Approach for Dual-Mode Guidance Filtering with Delayed Measurement (AIAA 2014-0606)

    Kim, S. / Park, B. / Choi, H. et al. | British Library Conference Proceedings | 2014