HOME

TheInfoList



OR:

In
applied mathematics Applied mathematics is the application of mathematical methods by different fields such as physics, engineering, medicine, biology, finance, business, computer science, and industry. Thus, applied mathematics is a combination of mathematical s ...
, Wahba's problem, first posed by
Grace Wahba Grace Goldsmith Wahba (born August 3, 1934) is an American statistician and now-retired I. J. Schoenberg-Hilldale Professor of Statistics at the University of Wisconsin–Madison. She is a pioneer in methods for smoothing noisy data. Best known f ...
in 1965, seeks to find a
rotation matrix In linear algebra, a rotation matrix is a transformation matrix that is used to perform a rotation in Euclidean space. For example, using the convention below, the matrix :R = \begin \cos \theta & -\sin \theta \\ \sin \theta & \cos \theta \end ...
(
special orthogonal matrix Special or specials may refer to: Policing * Specials, Ulster Special Constabulary, the Northern Ireland police force * Specials, Special Constable, an auxiliary, volunteer, or temporary; police worker or police officer Literature * ''Specia ...
) between two coordinate systems from a set of (weighted) vector observations. Solutions to Wahba's problem are often used in
satellite A satellite or artificial satellite is an object intentionally placed into orbit in outer space. Except for passive satellites, most satellites have an electricity generation system for equipment on board, such as solar panels or radioisotope ...
attitude determination utilising sensors such as
magnetometer A magnetometer is a device that measures magnetic field or magnetic dipole moment. Different types of magnetometers measure the direction, strength, or relative change of a magnetic field at a particular location. A compass is one such device, o ...
s and multi-antenna
GPS receivers A satellite navigation device (satnav device) is a user equipment that uses one or more of several global navigation satellite systems (GNSS) to calculate the device's geographical position and provide navigational advice. Depending on the s ...
. The cost function that Wahba's problem seeks to minimise is as follows: : J(\mathbf) = \frac \sum_^ a_k\, \mathbf_k - \mathbf \mathbf_k \, ^2 for N\geq2 where \mathbf_k is the ''k''-th 3-vector measurement in the reference frame, \mathbf_k is the corresponding ''k''-th 3-vector measurement in the body frame and \mathbf is a 3 by 3 rotation matrix between the coordinate frames. a_k is an optional set of weights for each observation. A number of solutions to the problem have appeared in literature, notably Davenport's q-method,
QUEST A quest is a journey toward a specific mission or a goal. The word serves as a plot device in mythology and fiction: a difficult journey towards a goal, often symbolic or allegorical. Tales of quests figure prominently in the folklore of ever ...
and methods based on the
singular value decomposition In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any \ m \times n\ matrix. It is related ...
(SVD). Several methods for solving Wahba's problem are discussed by Markley and Mortari. This is an alternative formulation of the
Orthogonal Procrustes problem The orthogonal Procrustes problem is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A and B and asked to find an orthogonal matrix \Omega which most closely maps A to B. Specifically, :R = \arg\m ...
(consider all the vectors multiplied by the square-roots of the corresponding weights as columns of two matrices with ''N'' columns to obtain the alternative formulation). An elegant derivation of the solution on one and a half page can be found in.


Solution via SVD

One solution can be found using a singular value decomposition (SVD). 1. Obtain a matrix \mathbf as follows: :\mathbf = \sum_^ a_i \mathbf_i ^T 2. Find the
singular value decomposition In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any \ m \times n\ matrix. It is related ...
of \mathbf :\mathbf = \mathbf \mathbf \mathbf^T 3. The rotation matrix is simply: :\mathbf = \mathbf \mathbf \mathbf^T where \mathbf = \operatorname(\begin 1 & 1 & \det(\mathbf) \det(\mathbf)\end)


Notes

{{reflist


References

* Wahba, G. Problem 65–1
A Least Squares Estimate of Satellite Attitude
SIAM Review, 1965, 7(3), 409 * Shuster, M. D. and Oh, S. D
Three-Axis Attitude Determination from Vector Observations
Journal of Guidance and Control, 1981, 4(1):70–77 * Markley, F. L
Attitude Determination using Vector Observations and the Singular Value Decomposition
Journal of the Astronautical Sciences, 1988, 38:245–258 * Markley, F. L. and Mortari, D
Quaternion Attitude Estimation Using Vector Observations
Journal of the Astronautical Sciences, 2000, 48(2):359–380 * Markley, F. L. and Crassidis, J. L
Fundamentals of Spacecraft Attitude Determination and Control
Springer 2014 * Libbus, B. and Simons, G. and Yao, Y
Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem
The American Mathematical Monthly, 2017, 124(2):149–160 *Lourakis, M. and Terzakis, G
Efficient Absolute Orientation Revisited
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2018, pp. 5813-5818.


See also

*
Triad method The Triad method is one of the earliest and simplest solutions to the spacecraft attitude determination problem. Given the knowledge of two vectors in the reference and body coordinates of a satellite, the Triad algorithm obtains the direction co ...
*
Kabsch algorithm The Kabsch algorithm, named after Wolfgang Kabsch, is a method for calculating the optimal rotation matrix that minimizes the RMSD ( root mean squared deviation) between two paired sets of points. It is useful in graphics, cheminformatics to compar ...
*
Orthogonal Procrustes problem The orthogonal Procrustes problem is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A and B and asked to find an orthogonal matrix \Omega which most closely maps A to B. Specifically, :R = \arg\m ...
Applied mathematics