Difference between revisions of "QuEST"

From Satellite Wiki
Jump to: navigation, search
Line 1: Line 1:
== Introduction ==
+
We had begun with the problem of overdetermination because we had more equations than the unknown variables. Now, with sensor errors it becomes impossible to solve for these variables such that it satisfies all the equations (remember, these equations are superfluous). So Wahba’s problem gives us a way to, if not circumvent, at least rationally deal with this problem. It defines a weighted error function (i.e errors from each of the sensors are given weightage based on reliability) which is to be minimised.  
Obtaining quaternion information from q-method involves solving the eigenvalue problem for a 4X4 Matrix. This can be done on MATLAB or other computer tools. But the solution is numerically intensive. On-board computing is a serious concern for any satellite designer and hence a better algorithm to solve this problem using less computing is required. <br \>
 
The QuEST algorithm provides a less efficient but a ‘faster’ way to solve the eigenvalue problem.
 
  
== The Algorithm ==
+
[[File:Equation74.png|frame|center]]
Recall from [[Q Method and Wahba's Problem]] that the optimal attitude minimizes the loss function,
+
The error function J can be simplified to a summation involving w_k (the weights, which are constants set by us) and the gain function g as defined below
[[File:Equation40.JPG|frame|center]]
+
[[File:Equation75.png|frame|center]]
And maximizes the gain function,
+
It is easy to see that minimising J is equivalent to maximising g. <br \>
[[File:Equation41.png|frame|center]]
+
This expression when written in terms of quaternions becomes very compact. And qmethod showed that maximising g involved solving an eigenvalue problem. This can be done on MATLAB or other computer tools. But the solution is numerically intensive.<ref>http://www.dept.aoe.vt.edu/~cdhall/courses/aoe4140/attde.pdf</ref> Satellite makers need a better algorithm than [[Q Method and Wahba's Problem| Q-method]] to determine the attitude with minimal compromise in the accuracy. The QuEST algorithm provides a less efficient but a ‘faster’ way to solve the eigenvalue problem.<br \>
Thus,
+
QuEST starts with the assumption that sensor errors are minimal so that J can be minimised to a very low value. Rewriting J in terms of g,
 
[[File:Equation42.png|frame|center]]
 
[[File:Equation42.png|frame|center]]
 
[[File:Equation43.png]] where [[File:Equation44.png]] is the maximum eigenvalue of the K matrix defined in [[Q Method and Wahba's Problem]].
 
[[File:Equation43.png]] where [[File:Equation44.png]] is the maximum eigenvalue of the K matrix defined in [[Q Method and Wahba's Problem]].

Revision as of 00:14, 8 February 2018

We had begun with the problem of overdetermination because we had more equations than the unknown variables. Now, with sensor errors it becomes impossible to solve for these variables such that it satisfies all the equations (remember, these equations are superfluous). So Wahba’s problem gives us a way to, if not circumvent, at least rationally deal with this problem. It defines a weighted error function (i.e errors from each of the sensors are given weightage based on reliability) which is to be minimised.

Equation74.png

The error function J can be simplified to a summation involving w_k (the weights, which are constants set by us) and the gain function g as defined below

Equation75.png

It is easy to see that minimising J is equivalent to maximising g.
This expression when written in terms of quaternions becomes very compact. And qmethod showed that maximising g involved solving an eigenvalue problem. This can be done on MATLAB or other computer tools. But the solution is numerically intensive.[1] Satellite makers need a better algorithm than Q-method to determine the attitude with minimal compromise in the accuracy. The QuEST algorithm provides a less efficient but a ‘faster’ way to solve the eigenvalue problem.
QuEST starts with the assumption that sensor errors are minimal so that J can be minimised to a very low value. Rewriting J in terms of g,

Equation42.png

Equation43.png where Equation44.png is the maximum eigenvalue of the K matrix defined in Q Method and Wahba's Problem. With this Equation44.png can be written as

Equation45.png

If we approximate J to be very small (this approximation is valid as we want to minimize J and now if after completing this method, we calculate J, it would be very small),

Equation46.png

Defining and writing the equation in terms of Rodrigue’s parameter p simplifies the equation

Equation47.png

where a is the vector along axis of rotation and Φ is the angle of rotation. Eigenvalue equation, which was to be solved is now written as

Equation48.png

Which can be solved by gauss elimination.
Once the p has been obtained, the quaternion can be found out by noting

Equation49.png

Hence the estimated quaternion is obtained without solving eigenvalue equation.


If you are done reading this page, you can go back to Attitude Determination and Control Subsystem