Global Attitude Estimation using Uncertainty Ellipsoids

Authors: Taeyoung Lee, Amit K. Sanyal, Melvin Leok, N. Harris McClamroch

7 pages, 4 figures. Submitted to 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan, July 24-28, 2006

Abstract: Attitude estimation is often a prerequisite for control of the attitude or orientation of mechanical systems. Current attitude estimation algorithms use coordinate representations for the group of rigid body orientations. All coordinate representations of the group of orientations have associated problems. While minimal coordinate representations exhibit kinematic singularities for large rotations, non-minimal coordinates like quaternions require satisfaction of extra constraints. A deterministic attitude estimation problem for a rigid body with bounded measurement errors is considered here. An attitude estimation algorithm that globally minimizes the attitide estimation error, is obtained. Assuming that the initial attitude, the initial angular velocity and measurement noise lie within given ellipsoidal bounds, an uncertainty ellipsoid that bounds the attitude and the angular velocity of the rigid body is obtained. The center of the uncertainty ellipsoid provides point estimates, and the size of the uncertainty ellipsoid measures the accuracy of the estimates. The point estimates, and the uncertainty ellipsoids are propagated using a Lie group variational integrator, and its linearization, respectively. The attitude estimation is optimal in the sense that the attitude estimation error and the size of the uncertainty ellipsoid is minimized.

Submitted to arXiv on 07 Dec. 2005

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.