Constrained Coning Correction Algorithms

A constrained coning correction form is proposed for designing efficient coning algorithms. This new coning correction form, which includes only one vector cross product, is directly presented first, and then it is constructed by simplifying the traditional uncompressed coning correction form with the given constraint relationship. The constraint relationship is necessary for designing the constrained coning algorithm. On the basis of the traditional uncompressed coning correction form and the given constraint relationship, the constrained coning algorithm can be designed. Two types of algorithm error models and an algorithm throughput model are given for analyzing and evaluating the coning and maneuver performance of coning algorithms. The analytical results and numerical simulation show that the constrained coning algorithm compared with the uncompressed coning algorithm has a coning accuracy equivalent to that of the compressed version, the equivalent maneuver accuracy is higher than that of the compressed version, and the algorithm throughput is lower.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01669620
  • Record Type: Publication
  • Files: TRIS, ASCE
  • Created Date: Mar 31 2018 3:01PM