Abstract The TRIAD algorithm is shown to be derivable as a maximum-likelihood estimator. In particular, using the QUEST measurement model, the TRIAD attitude error covariance matrix can be derived as the inverse of the Fisher information matrix. The treatment here gives a microscopic analysis of the algorithm and its connection to the QUEST algorithm. It also sheds valuable light on the origin of discrete degeneracies in deterministic attitude estimation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The TRIAD algorithm as maximum likelihood estimation


    Contributors:

    Published in:

    Publication date :

    2006-03-01


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    The TRIAD Algorithm as Maximum Likelihood Estimation

    Shuster, Malcolm D. | Online Contents | 2006


    The TRIAD algorithm as maximum likelihood estimation

    Shuster, Malcolm D. | Online Contents | 2006


    Maximum-Likelihood Parameter-Estimation Algorithm

    Eldred, D. B. / Hamidi, M. / Rodriguez, G. | NTRS | 1986



    Weighted Centroid Localization Algorithm Based on Maximum Likelihood Estimation

    Lu, Xianling / Xia, Wenrui | British Library Online Contents | 2016