Switching algorithm to avoid attitude representation singularity
In this paper, the singularity associated with a minimal attitude parameterization using Euler angles is avoided by a switching algorithm. This algorithm is based on describing the attitude as a function of time with two sets of Euler angle sequences that possess nonconjunctive singularities. This p...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/38697/ http://irep.iium.edu.my/38697/ http://irep.iium.edu.my/38697/1/6%252E2009-6149.pdf |
| Summary: | In this paper, the singularity associated with a minimal attitude parameterization using Euler angles is avoided by a switching algorithm. This algorithm is based on describing the attitude as a function of time with two sets of Euler angle sequences that possess nonconjunctive singularities. This property exists when the singularity causing values of the relevant rotation variables associated with any two Euler angle sequences do not materialize simultaneously. For a given Euler angle set, either antisymmetric or symmetric, another Euler angle set exists such that the pair of representations possesses nonconjunctive singularities. Conditions determining when, and when not, a pair of representations possess this property are developed and analyzed. Nonconjunctive symmetric-antisymmertic and antisymmetric-antisymmetric pairs always exist. This property is exploited by a switching algorithm which facilitates motion description with a minimal parameterization not
hindered by singularities. This description may possess computational savings and allow continued use of insightful variables when compared with nonminimal representations such as Euler parameters. The algorithm is numerically demonstrated and validated by several nonlinear six degree of freedom simulation tests. |
|---|