Next Article in Journal
Rank-Poisson Transformation for Use with Count Data in Poisson Regression
Next Article in Special Issue
Correction: Brezov, D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath 2026, 6, 80
Previous Article in Journal
Diffusion–Based Degradation Reliability Model with Imperfect Maintenance for Industrial Conveyor Belt Systems
 
 
Correction published on 25 June 2026, see AppliedMath 2026, 6(7), 102.
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimizing Motion Sequences with Projective Dual Quaternions

Department of Mathematics, University of Architecture, Civil Engineering and Geodesy, 1 Hristo Smirnenski Blvd., 1164 Sofia, Bulgaria
AppliedMath 2026, 6(5), 80; https://doi.org/10.3390/appliedmath6050080
Submission received: 2 March 2026 / Revised: 30 April 2026 / Accepted: 11 May 2026 / Published: 15 May 2026 / Corrected: 25 June 2026
(This article belongs to the Special Issue Applied Mathematical Modelling in Mechanical Design and Analysis)

Abstract

This paper builds upon a previous study suggesting an optimization procedure for rotation sequences by introducing a fourth factor in Euler-type decompositions, thus allowing for an additional degree of freedom used both as a variational parameter and a means to avoid the gimbal lock singularity. Here, an analogous result is derived for generic rigid motions, which is of potential interest in 3D robot manipulators, aircraft, and spacecraft using gimbals to navigate in space. The idea is based on Kotelnikov’s principle of transference, which extends the properties of pure rotations to arbitrary Galilean transformations, interpreted as screw motions. To do that in practice, it is convenient to use dual quaternions or their projective version, referred to as dual Rodrigues’ vectors. With this approach, the explicit solutions are easy to extend and therefore optimization is rather straightforward: we show, both analytically and with numerical examples, that factorizing motion into sequences of four consecutive screws is, in general, significantly more energy-efficient compared to using three.

1. Introduction

Attitude control of robots, aircraft, and spacecraft involves rotations of fixed gimbals, for which Euler-type decompositions are applied to bring the system to its desired state [1,2,3,4]. However, due to the famous gimbal lock singularity [5], as well as for sheer convenience, other representations are often preferred, such as Hamilton’s unit quaternions or their projective version, referred to as Rodrigues’ vectors [4,5,6,7,8]. Similarly, for a general rigid motion including translation, it is convenient to use their dual extension parameterizing the Galilean group SE ( 3 ) via Kotelnikov’s principle of transference known from the theory of screws [8,9,10,11,12]. The optimization problem is essential in both cases, and while for pure rotations it has been studied for a long time using both analytical and geometric tools [13,14,15,16,17], general rigid motion seems a bit more challenging and has been addressed mainly with machine learning algorithms [18,19], and receives less attention overall. Here we consider both within a unified geometric approach, deriving closed-form solutions based on generalized Euler decompositions previously introduced in [4], and, as in [5], the additional free parameter is used for minimizing the sum of angles (length of the spherical path) in a rotation sequence. While in [5], this free parameter arises from the gimbal lock singularity; here, it is introduced simply as the fourth factor in the sequence, allowing for a significant reduction in total energy consumption. Similar optimization strategies have been explored for two-axis sequences of arbitrary length [15,16], but this work focuses on an explicit three-axis, four-factor approach, which provides more freedom. A closed-form expression for the cost function is derived for this framework, which certainly contains the two-axis setting as a particular case. With this, we can also relax the classical Davenport condition γ 12 + γ 23 π , where γ i j 0 , π 2 denotes the angle between the rotation axes, to a broader geometric constraint γ 12 + γ 23 + γ 31 π , allowing for the design of attitude control mechanisms with non-orthogonal gimbals [20] that might turn useful in robotics and aircraft engineering. This paper is focused on a specific aspect of geometric control, namely optimization of motion sequences, and it does not consider dynamical aspects with regard to stabilization, like [21,22], or tracking, like [12,18] for example, despite the common framework of quaternions and Rodrigues’ vectors. This paper is most closely related with [16,23], generalizing these studies in two aspects: by considering arbitrary rigid motions instead of rotations, and by allowing for more than two invariant axes.
The text is organized as follows: after a brief preliminary section, the construction for pure rotations is discussed in detail, as derived in [23]. Then, the extension to generic rigid motions is carried out in Section 4, where some issues like the order of finite generations and classical results in spherical geometry, prolonged to the dual sphere, are also discussed. Numerical examples illustrated with plots and diagrams are also provided where necessary.

2. Generalized Euler Decompositions with Projective Quaternions

The Rodrigues’ vector (see [6,8]) is best understood as a projective quaternion c = ζ ζ 0 , where one may normalize the homogeneous coordinates (∗ here denotes the Hodge dual)
ζ = ( ζ 0 , ζ * ) = ζ 0 + ζ 1 i + ζ 2 j + ζ 3 k H × , ζ 2 = ζ 0 2 + ζ 2 = 1
so ζ parameterizes the spin group SU ( 2 ) S 3 . This yields a faithful representation of SO ( 3 ) RP 3 devoid of singularities. Note that one may also invoke Euler’s trigonometric substitution and express c = τ n , where τ = tan ϕ 2 RP 1 is usually referred to as the scalar parameter ( ϕ being the angle of rotation) and n S 2 is the unit normal to the rotation plane.
In this way, we express the rotation matrix entries only in terms of rational functions:
R ( c ) = 1 + c × 1 c × = 1 c 2 + 2 c c t + 2 c × 1 + c 2
via the well-known Cayley map. Here c c t stands for the tensor (dyadic) product and c × denotes the adjoint, i.e., a ×   b = a × b . Another advantage is the simple composition law:
c 2 , c 1 = c 2 + c 1 + c 2 × c 1 1 c 2 · c 1 R ( c 2 ) R ( c 1 ) = R ( c 2 , c 1 )
where a · b stands for the dot product; it is just the projective version of quaternion multiplication. It appears to be far more efficient compared to the usual matrix formalism.
The above description allows us to easily derive (see [4] for details) explicit solutions to the generalized Euler decomposition problem R ( c ) = R ( c 3 ) R ( c 2 ) R ( c 1 ) with initially given rotation axes a i S 2 , such that c i = τ i a i , where τ i = tan ϕ i 2 . More precisely, we have
τ i ± = σ i ω i Δ ω i 2 Δ = σ i ω i ± Δ , σ i = ε i j k ( g j k r j k ) , j > k
where ε i j k denotes the Levi–Civita symbol. Furthermore, we make use of the notation
g i j = a i · a j , r i j = c ^ i · R ( c ) a j
as well as
ω 1 = a 1 × a 2 · R t ( c ) a 3 , ω 2 = a 1 × a 2 · a 3 , ω 3 = R ( c ) a 1 · a 2 × a 3
and the necessary and sufficient condition for the existence of real solutions:
Δ = 1 g 12 r 31 g 21 1 g 23 r 31 g 32 1 0 .
Whenever any of the conditions r j i = g j i ( i j ) holds, one may decompose into a pair of rotations about the i-th and the j-th axis as R ( c ) = R ( τ j a j ) R ( τ i a i ) , e.g., for i = 1 , j = 2 :
τ 1 = r 22 1 a 1 × a 2 · R t ( c ) a 2 , τ 2 = r 11 1 R ( c ) a 1 · a 1 × a 2 ·
These expressions apply also to the singular gimbal lock setting
a 3 = ± R a 1 r 31 = ± 1
in which the first equality in (5) yields the scalar parameter of ϕ 1 ± ϕ 3 (see also [4,5]).

3. The Shift Parameter Construction

This section explains the results obtained in [23] quite thoroughly, since the derivation in the dual quaternion setting follows the same pattern. Let us consider decompositions into four consecutive rotations about three given axes—for the one which occurs twice, we have an additional ‘shift’ angle α , that can be varied for the sake of optimization. Denoting the rotation by an angle φ about a i with R 1 ( φ ) , we can write, for example,
R = R 3 ( ψ ) R 1 ( α ) R 2 ( ϑ ) R 1 ( φ ) = R 3 ( ψ ) R 2 ( ϑ ) R 1 ( φ + α )
where R 2 stands for a rotation about the axis a 2 = R 1 ( α ) a 2 (see for example [5]). The next step is to use the additional fourth parameter α to guarantee the necessary and sufficient condition (4) for the corresponding decomposition, which in this setting takes the form
Δ = 1 g 12 r 31 g 12 1 g 23 r 31 g 23 1 0
where using Formula (1), one may easily express the α -dependent component as
g 23 ( α ) = a 2 · a 3 = g 12 g 13 + g 1 [ 1 g 2 ] 3 cos α + ω 2 sin α , a [ i b j ] = a i b j a j b i .
On the other hand, (8) may be written in the equivalent form
g 12 r 31 ( 1 g 12 2 ) ( 1 r 31 2 ) g 23 g 12 r 31 + ( 1 g 12 2 ) ( 1 r 31 2 ) .
Using basic trigonometry, one may simplify the expression for g 23 as
g 23 ( α ) = A cos ( α α 0 ) + g 12 g 13
with
A = ( g 1 [ 1 g 2 ] 3 ) 2 + ω 2 2 , α 0 = arctan ω 2 g 1 [ 1 g 2 ] 3 ·
This allows for writing the above inequalities in the simpler form
cos ( γ 12 + γ ˜ 31 ) g 12 g 13 A cos ( α α 0 ) cos ( γ 12 γ ˜ 31 ) g 12 g 13
where we denote, assuming for the relative angles γ i j 0 , π 2 , while γ ˜ i j [ 0 , π ]
γ i j = arccos g i j = ( a i , a j ) , γ ˜ i j = arccos r i j = ( c ^ i , R a j ) .
Since we have the restriction | cos ( α α 0 ) | 1 , real solutions are guaranteed if and only if
cos ( γ 12 γ ˜ 31 ) g 12 g 13 A , cos ( γ 12 + γ ˜ 31 ) g 12 g 13 A .
On the other hand, one has
ω 2 2 = det { g i j } A = ( 1 g 12 2 ) ( 1 g 13 2 ) = sin γ 12 sin γ 13
so the above conditions may be written also as
cos ( γ 12 γ ˜ 31 ) cos ( γ 12 + γ 31 ) , cos ( γ 12 + γ ˜ 31 ) cos ( γ 12 γ 31 )
which finally yields
| γ 12 γ 13 | γ 12 γ ˜ 31 2 γ 12 + γ 13 .
The interval determined in this way is typically larger compared to
| γ 12 γ 23 | γ ˜ 31 γ 12 + γ 23
which guarantees decomposition into three consecutive rotations about the a i ’s (see [4]). Moreover, since the extremal values of γ ˜ 31 correspond to n { a 1 , a 3 } , one obviously has
γ 31 | ϕ | γ ˜ 31 γ 31 + | ϕ |
and the sufficient condition for the compound rotation’s angle is | ϕ | 2 γ 12 (see also [20]). Note that as long as (11) holds, with some more trigonometry one can write (9) in the form
sin Δ α χ 2 sin Δ α + χ 2 0 , sin Δ α χ + 2 sin Δ α + χ + 2 0   Δ α = α α 0 , χ ± = arccos cos ( γ 12 ± γ ˜ 31 ) g 12 g 13 sin γ 12 sin γ 13 ·
In the Davenport setting a 2 a 1 , 3 we have χ + χ + = π and the Bryan case in particular, where g i j = δ i j (Kronecker’s delta), A = ω 2 = 1 and α 0 = π 2 , yields cos χ ± = 1 r 31 2 and α γ ˜ 31 + k π , γ ˜ 31 + k π with k Z . More generally, the solution to (9) has the form
α α 0 + χ , α 0 + χ + mod π .
The endpoints of the interval (15), for example, yield Δ = 0 and hence, rational expressions for the τ k ’s. More generally, denoting (for other values of the indices g i j = g i j and r i j = r i j )
g 23 = a 2 · a 3 , r 21 = a 2 · R a 1 , r 32 = a 3 · R a 2
as well as
ω 1 = a 1 × a 2 · R t a 3 , ω 2 = a 1 × a 2 · a 3 , ω 3 = R a 1 · a 2 × a 3
one obtains the explicit solutions (3) in the form
τ i ± = σ i ω i ± Δ , σ i = ε i j k ( g j k r j k ) , j > k
which provides the remaining rotation angles in the decomposition
φ ± = 2 arctan τ 1 ± α , ϑ ± = 2 arctan τ 2 ± , ψ ± = 2 arctan τ 3 ± .
Following a similar approach, one may also consider the decomposition
R = R 2 ( α ) R 3 ( ψ ) R 2 ( ϑ ) R 1 ( φ ) = R 3 ( ψ ) R 2 ( ϑ + α ) R 1 ( φ )
with a 3 = R 2 ( α ) a 3 and the corresponding discriminant condition
Δ = 1 g 12 r 31 g 12 1 g 23 r 31 g 23 1 0
where the α -dependent component r 31 may be written explicitly in the form
r 31 ( α ) = a 3 · R a 1 = g 2 [ 2 r 3 ] 1 cos α + ω 3 sin α + g 23 r 21
with ω 3 = R a 1 · a 2 × a 3 , and further simplified as
r 31 ( α ) = A ˜ cos ( α α 0 ) + g 23 r 21
A ˜ = ( g 2 [ 2 r 3 ] 1 ) 2 + ω 3 2 , α 0 = arctan ω 3 g 2 [ 2 r 3 ] 1 ·
This yields the inequalities (note that in the Davenport setting a 2 a 1 , 3 they are trivial):
cos ( γ 12 + γ 23 ) g 23 r 21 A ˜ cos ( α α 0 ) cos ( γ 12 γ 23 ) g 23 r 21
which allows real solutions for α as long as
cos ( γ 12 + γ 23 ) g 23 r 21 A ˜ , cos ( γ 12 γ 23 ) g 23 r 21 A ˜ .
Furthermore, taking into account that (here we use the Gram determinant for ω 3 2 )
ω 3 2 = 1 g 23 r 21 g 23 1 r 31 r 21 r 31 1 A ˜ = ( 1 g 23 2 ) ( 1 r 21 2 )
one ends up with
cos ( γ 23 γ ˜ 21 ) cos ( γ 12 + γ 23 ) , cos ( γ 23 + γ ˜ 21 ) cos ( γ 12 γ 23 )
which yields for γ ˜ 21 the interval
| γ 23 γ 12 | γ 23 γ ˜ 21 2 γ 23 + γ 12
and with Formula (13), we easily obtain a sufficient condition for ϕ in the form | ϕ | 2 γ 23 .
In the symmetric case γ 12 = γ 23 = γ , one has γ ˜ 21 3 γ , while for r 21 = ± 1 , (15) yields either no solution or no restriction for α , the condition for the latter being γ 12 2 γ 23 and γ 12 π 2 γ 23 , respectively. If (20) holds and A ˜ 0 , then α is arbitrary within (15), where
χ ± = arccos cos ( γ 12 ± γ 23 ) g 23 r 31 sin γ 23 sin γ ˜ 21
and calculate (for all other values of i and j we have g i j = g i j , respectively r i j = r i j )
g 31 = a 3 · a 1 , r 32 = a 3 · R a 2 , r 31 = a 3 · R a 1
ω 1 = a 1 × a 2 · R t a 3 , ω 2 = a 1 × a 2 · a 3 , ω 3 = R a 1 · a 2 × a 3
in order to obtain the solutions based on (3) in the form
τ i ± = σ i ω i ± Δ , σ i = ε i j k ( g j k r j k ) , j > k
which finally provides the remaining three rotation angles
φ ± = 2 arctan τ 1 ± , ϑ ± = 2 arctan τ 2 ± α , ψ ± = 2 arctan τ 3 ± .
Note also that (17) is, in some sense, dual to (7), since the former is equivalent to
R t = R 1 ( φ ) R 3 ( ψ ) R 2 ( ϑ α )
where R 3 is a rotation about a 3 = R 2 ( ϑ ) a 3 so the shift angle in this case is ϑ (see [23]):
ϑ ϑ 0 + χ , ϑ 0 + χ + mod π
χ ± = arccos cos ( γ 23 ± γ ˜ 21 ) g 12 g 23 sin γ 12 sin γ 23 , ϑ 0 = arctan ω 2 g 1 [ 2 g 3 ] 2 ·
It is straightforward to see that the above expression takes real values as long as
cos ( γ 23 + γ ˜ 21 ) g 12 g 23 A ˜ cos ( ϑ ϑ 0 ) cos ( γ 23 γ ˜ 21 ) g 12 g 23
A ˜ = ( g 1 [ 2 g 3 ] 2 ) 2 + ω 2 2 = sin γ 12 sin γ 23
which yields (20), and if A ˜ 0 , one may choose arbitrary ϑ in the interval (23) and calculate
g 21 = g 23 , g 31 = g 12 , g 32 = a 3 · a 1 , r 31 = r 21 , r 32 = a 3 · R a 1 , r 21 = a 2 · R a 3
ω 1 = a 2 × a 3 · R a 1 , ω 2 = a 1 × a 2 · a 3 , ω 3 = R t a 2 · a 3 × a 1 .
Finally, Δ is given by (4) with g i j and r 31 instead of g i j and r 31 , respectively, and one has
τ i ± = σ i ω i ± Δ , σ i = ε i j k ( g j k r j k ) , j > k
from Formula (3), which yields the remaining three rotation angles
φ ± = 2 arctan τ 3 ± , ψ ± = 2 arctan τ 2 ± , α ± = ϑ 2 arctan τ 1 ± .
Next, let us consider decompositions of the type
R = R ( c ) = R 1 ( α ) R 3 ( ψ ) R 2 ( ϑ ) R 1 ( φ )
in which we conjugate the compound rotation rather than a particular factor, namely
R ˜ = R R 1 t ( α ) c = R 3 ( ψ ) R 2 ( ϑ ) R 1 ( φ + α ) .
Like in the previous cases, we express the α -dependent parameter
r 31 ( α ) = R 1 ( α ) a 3 · R a 1 = g 1 [ 1 r 3 ] 1 cos α + ω ˜ 2 sin α + g 13 r 11
using the notation ω ˜ 2 = a 1 × a 3 · R a 1 , in the form
r 31 ( α ) = A ˜ cos ( α α 0 ) + g 13 r 11
A ˜ = ( g 1 [ 1 r 3 ] 1 ) 2 + ω ˜ 2 2 , α 0 = arctan ω ˜ 2 g 1 [ 1 r 3 ] 1 ·
Then, the necessary and sufficient condition
Δ = 1 g 12 r 31 g 12 1 g 23 r 31 g 23 1 0
may be expressed in terms of the shift angle α as
cos ( γ 12 + γ 23 ) g 13 r 11 A ˜ cos ( α α 0 ) cos ( γ 12 γ 23 ) g 13 r 11
which becomes trivial in the Bryan setting g i j = δ i j . On the other hand, one has
ω ˜ 2 2 = 1 g 13 r 11 g 13 1 r 31 r 11 r 31 1 A ˜ = ( 1 g 13 2 ) ( 1 r 11 2 )
so real solutions for α exist as long as
cos ( γ 13 γ ˜ 11 ) cos ( γ 12 + γ 23 ) , cos ( γ 13 + γ ˜ 11 ) cos ( γ 12 γ 23 )
that yields for γ ˜ 11 the interval
| γ 23 γ 12 | γ 13 γ ˜ 11 γ 12 + γ 23 + γ 13 .
This time the lower bound is trivial since γ ˜ 11 is non-negative, while the expression on the left is non-positive due to the triangle inequality. Thus, the sufficient condition for the angle
| ϕ | γ 12 + γ 23 + γ 13 .
In the generic case, we choose a value of α in the non-empty interval defined by (15), where
χ ± = arccos cos ( γ 12 ± γ 23 ) g 13 r 11 sin γ 13 sin γ ˜ 11
assuming A ˜ 0 ( A ˜ = 0 does not impose a restriction on α ) and use it to obtain the shifted rotation R ˜ = R R 1 t ( α ) c = R 1 t ( α ) R ( c ) R 1 ( α ) which is to replace R ( c ) in (3). The entries
r i j = a i · R ( c ) a j
are then straightforward to calculate with a i = R 1 ( α ) a i , as well as
ω 1 = a 1 × a 2 · R t ( c ) a 3 , ω 2 = ω 2 , ω 3 = R ( c ) a 1 · a 2 × a 3 .
Thus we may express the following:
τ i ± = σ i ω i ± Δ , σ i = ε i j k ( g j k r j k ) , j > k
where Δ is given by Formula (26), finally arriving at
ψ ± = 2 arctan τ 3 ± , ϑ ± = 2 arctan τ 2 ± , φ ± = 2 arctan τ 1 ± α .

3.1. A Brief Note on Gimbal Lock Control

Gimbal lock (6) is a zero-measure set singularity, so avoiding it is easy, as long as the corresponding interval for the shift parameter is non-degenerate, i.e., contains more than one point. However, enforcing it is less trivial: consider, for example, (17), where the condition for the shifted axis a 3 = R 2 ( α ) a 3 = ± R a 1 demands (see [6] for the derivation):
a 2 Span { a 3 ± R a 1 , a 3 × R a 1 } ( 1 ± r 31 ) ( r 21 g 23 ) = 0 .
The non-trivial solutions r 21 = ± g 23 impose the conditions γ 12 = γ 23 and, respectively, γ 12 + γ 23 = π (as shown in [23]), allowing for factorizations into pairs, since R = R 2 R 1 r 21 = g 21 , where R 2 stands for a rotation about the unit vector a 2 = R 1 ( φ ) a 2 , so φ plays the role of a shift angle. Resolving the factorization like before, we end up with a gimbal lock condition in the form ( 1 ± r 32 ) ( r 31 g 12 ) = 0 with non-trivial solutions r 31 = ± g 21 demanding γ 12 = γ 13 or γ 12 + γ 13 = π , respectively. However, in both cases we also have r 31 = g 31 , which guarantees the factorization R = R 3 R 1 . Finally, the gimbal lock condition in (25) may be written as ( 1 ± r 31 ) ( r 11 g 31 ) = 0 and obviously has a non-trivial solution in the form r 11 = ± g 31 . Since r 31 = ± 1 in this case is equivalent to cos ( α α 0 ) = ± 1 , it demands γ 12 = γ 23 or γ 12 + γ 23 = π , respectively. In [23] we conclude that avoiding gimbal lock this way is always possible as long as there are two distinct angles γ i j , whose sum is non less than π 2 , while inflicting it may be done only in one of the two cases (we skip the derivation): (i.) r i j = g i j = ± g j k = 0 that yields a decomposition into two factors, and (ii.) r i i = ± g i j with g i k = ± g j k (where the values of i , j and k are assumed to be different).

3.2. Optimization

Here, we show how the additional parameter α is used to minimize the cost function:
E γ = | φ | + | ϑ | + | ψ | + | α |
with a few examples. Consider (7) and let { a i } be the standard basis, i.e., g i j = δ i j and r i j are simply the matrix entries of R . Since the α -rotation of a 2 takes place in the Y O Z plane, it can be written as a 2 = cos α a 2 + sin α a 3 , which results in the following expressions:
g 32 = sin α , r 21 = r 21 cos α + r 31 sin α , r 32 = r 32 cos α + r 33 sin α
ω 1 = r 33 cos α r 32 sin α , ω 2 = cos α , ω 3 = r 11 cos α
and Δ = cos 2 α r 31 2 | α | arcsin 1 r 31 2 . Substituting in Formula (16) then yields
τ 1 = r 32 + ( r 33 1 ) tan α r 33 r 32 tan α ± 1 r 31 2 sec 2 α = tan α + φ 2 τ 2 = r 31 sec α 1 ± 1 r 31 2 sec 2 α = tan ϑ 2 , τ 3 = r 21 + r 31 tan α r 11 ± 1 r 31 2 sec 2 α = tan ψ 2
and the cost function is finally expressed in the following form:
E γ ( α ) = | α |   +   | 2 arctan τ 1 α |   +   | 2 arctan τ 2 |   +   | 2 arctan τ 3 | .
The gimbal lock singularity (6) persists for all values of α , but (8) demands α = 0 or α = π so the free parameter is now ψ [ π , π ] and minimize E γ ( ψ ) instead. Figure 1a illustrates (32) for a rotation by an angle ϕ = 120 about the vector n ( 3 , 4 , 5 ) t . Its minimum E γ ( α 0 ) 179.81 is reached at α 0 13.49 , which is about 36.49% more efficient compared to the standard Bryan setting E γ ( 0 ) 245.31 , and thus the optimal angles are as follows:
φ 0.16 , ϑ 75.14 , α 13.49 , ψ 91.02 .
Next, we consider (17) with a 1 = a 3 oriented along the z-coordinate axis and a 2 aligned with O X , which yields a 3 = cos α e ^ z sin α e ^ y and, hence, for the scalar parameters
τ 1 = r 31 r 21 tan α r 32 r 22 tan α ± Δ = tan φ 2 , τ 2 = 1 r 33 + r 23 tan α tan α ± Δ = tan ϑ + α 2 τ 3 = r 13 sec α r 23 + r 33 tan α Δ = tan ψ 2
where Δ = sec 2 α ( r 33 r 23 tan α ) 2 and by abuse of notation, we let r i j denote the matrix entries of R in the standard basis. The shift parameter is now unrestricted α [ π , π ] , since r 33 2 + r 23 2 1 . Consider, for example, a half-turn about n 5 , 4 , 3 t (Figure 1b) with
E γ ( α ) = | α |   +   | 2 arctan τ 1 |   +   | 2 arctan τ 2 α |   +   | 2 arctan τ 3 | .
Here α = 0 is a point of local maximum for E γ ( α ) and the global minimum at α 0 105.37 produces a total difference of E γ ( 0 ) E γ ( α 0 ) 50.65 , i.e., approximately 16.35% decrease in energy consumption or approximately 19.54% increase in efficiency compared to the standard Euler decomposition. The two points of discontinuity α 1 143.13 and α 2 36.87 are related to the condition r 32 = g 32 ( φ = 0 ). The optimal sequence has the following form:
φ 52.24 , ϑ 50.77 , ψ 50.77 , α 105.37 .
Finally, for the X Y Z X decomposition setting in Formula (25) one has
τ 1 = r 32 r 23 tan 2 α + ( r 33 r 22 ) tan α r 33 + r 22 tan 2 α ( r 32 + r 23 ) tan α ± sec α Δ = tan φ + α 2 τ 2 = r 21 tan α r 31 sec α ± Δ = tan ϑ 2 , τ 3 = r 21 + r 31 tan α r 11 sec α ± Δ = tan ψ 2
with Δ = sec 2 α ( r 31 r 21 tan α ) 2 . Since the condition r 11 = 0 holds, the endpoints of the interval for α correspond to the gimbal lock singularity. Consider again the former rotation discussed above in this section (Figure 1c). The minimum at α 0 74.97 yields an increase in efficiency of about 35.82% , and the optimal sequence of rotation angles is as follows:
φ = 2.39 , ϑ 0.18 , ψ 103.3 , α 74.8 .
The cost functions (32) in all the examples above imply spherical or cylindrical symmetry, but in the case of significant anisotropy, this is no longer the case due to different moments of inertia or external forces. This can be modeled by introducing different weights:
E γ = κ 1 ( | φ | + | α | ) + κ 2 | ϑ | + κ 3 | ψ | , κ i [ 0 , 1 ] .
Figure 2 illustrates this idea. Note that two of the graphs only undergo a slight deformation, while in Figure 2b, we see a phase shift of α = 0 (from a maximum to an inflection point).
A large part of this section revises an old result by the author, and having the formulas written explicitly here instead of referring to different pages elsewhere should be helpful for a smooth transition to the case of screw motions, considered in the next section. Most of the results follow from the transfer principle, but there are still some subtleties to point out.

4. Dual Quaternions, Screws, and the Transfer Principle

This section is dedicated to implementing the dual extension and applying the transfer principle, which would generalize the above results concerning pure rotations to arbitrary rigid transformations, interpreted as screw motions in view of the famous Mozzi–Chasles theorem. We begin with the construction of dual numbers R [ ε ] as a central extension to R with a nilpotent element ε (with ε 2 = 0 ) such that for each x ̲ = x + y ε R [ ε ] we refer to x = R e ( x ̲ ) as the real part of x ̲ and y = D u ( x ̲ ) as its dual part. We may also define the dual conjugate as x ̲ * = x y ε in analogy with complex numbers, so that 2 R e ( x ̲ ) = x ̲ + x ̲ * , but retrieving the dual part is less trivial since ε 1 does not exist. Next, we study the extension to mappings. In particular, for a differentiable function f ( x ) , we have a finite Taylor series:
f ( x + y ε ) = f ( x ) + f ( x ) y ε
due to the defining property of ε . This yields, for example, the trigonometric identities
sin ( φ + ε d ) = sin φ + ε d cos φ , cos ( φ + ε d ) = cos φ ε d sin φ .
Once we have the construction for real numbers, it is rather straightforward to define C [ ε ] , H [ ε ] , dual vectors and matrices, etc. In particular, the description of 3D Euclidean motions (rigid displacement) uses unit dual quaternions, which constitute the unit dual 3-sphere:
S 3 [ ε ] = { Q ̲ H [ ε ] , | Q ̲ | 2 = Q ̲ Q ̲ = 1 }
and are, in essence, pairs of unit and pure quaternions (see [10] for more details)
Q ̲ = 1 + ε 2 t q , | q | 2 = 1 , t = t , ε 2 = 0
where q and t represent rotations and translations, respectively. Consider the dual vector
n ̲ = n + ε m S 2 [ ε ] n 2 = 1 , m n
and the dual angle φ ̲ = φ + ε d linked to screw displacement d and moment m defined as
d = t · n , m = 1 2 cot φ 2 n × P n t
with P n denoting the orthogonal projector associated with n . Hence, the grade projections
Q ̲ 0 = q 0 ε 2 d = cos φ ̲ 2 , Q ̲ 2 = q + ε 2 q 0 q × t = n ̲ sin φ ̲ 2
for which we use the correspondence q 2 q , Formula (39), as well as the identities (37). The famous Mozzi–Chasles theorem asserts that each rigid motion can be represented as a screw displacement, i.e., a rotation and translation with a common axis. This so-called ‘screw axis’ is denoted with n ̲ above, and the dual quaternion construction provides its Plücker coordinates, while the dual angle φ ̲ encodes both the rotational and translational components of this motion. We can derive this information from the dual quaternion and conversely, substitute it in Formula (42), or use some other familiar representation, e.g., exp ( φ ̲ n ̲ × ) for the explicit form of rigid motions. This analogy is guaranteed by the famous Kotelnikov’s principle of transference (or simply ‘transfer principle’), allowing us to extend all known results for classical quaternions to their dual version, as long as the real part is non-vanishing (otherwise one needs to be concerned with zero divisors). Of course, pure translations may also be incorporated, but with a little bit of caution, as we shall see below.

4.1. The Classical Decomposition of Screw Displacements

We begin with generalizing the older result of Euler-type decompositions to the entire Galilean group, using dual quaternions and, more precisely, their projective version. Given three points on the dual sphere a ̲ k S 2 [ ε ] interpreted as oriented screw axes, and one in dual projective space c ̲ RP 3 [ ε ] , we want to find the values of the scalar parameters τ ̲ k RP 1 [ ε ] (if they exist), so that the rigid transformation presented by c ̲ is factorized as
c ̲ = c ̲ 3 , c ̲ 2 , c ̲ 1 , c ̲ k = τ ̲ k a ̲ k
where we use the associativity of the composition law (2), now extended to the non-homogeneous setting via Kotelnikov’s principle of transference. By the same argument, we can also use the Formula (1) to derive the solutions (3). Note that condition (4) remains valid only for the real part of the discriminant Δ ̲ = Δ + ψ ε , since from (36), we have
Δ + ψ ε = Δ + ψ ε 2 Δ
where ψ = D u ( Δ ̲ ) can be easily calculated from the components, that is,
a ̲ i = a i + ε b i g ̲ i j = a ̲ i · a ̲ j = a i · a j + ε ( a i · b j + b i · a j ) = g i j + ε h i j R ̲ = R + ε S r ̲ i j = a i · R a j + ε a i · R b j + b i · R a j + a i · S a j = r i j + ε s i j
ultimately leading to
ψ = g 12 g 23 s 31 + ( g 12 h 23 + h 12 g 23 ) r 31 2 ( g 12 h 12 + g 23 h 23 + r 31 s 31 ) .
Similarly, the dual Rodrigues’ vector is given as follows:
c ̲ = c + ε d = tan ϕ 2 1 + ε d sin ϕ n ̲ , d = d n + sin ϕ m 1 + cos ϕ
which yields c ̲ 2 = c 2 ( 1 + 2 p ε ) , where p = d csc ϕ denotes the screw pitch, and, respectively
S ( c ̲ ) = d sin ϕ n n t 1 + ( 1 cos ϕ ) n m t + m n t + d cos ϕ n × + sin ϕ m × .
Note, however, that the pitch p is ill-defined at both ϕ = 0 and ϕ = π , thus it is necessary to clarify the construction for the Rodrigues’ vector itself at these points, unlike in the case of pure rotations, where they represent the trivial element and a half-turn, respectively. At ϕ = 0 and d 0 , one has a pure translation, for which the Rodrigues’ vector takes the following form:
c ̲ i = ε d i 2 n i c ̲ 1 , c ̲ 2 = c ̲ 2 , c ̲ 1 = ε 2 d 1 n 1 + d 2 n 2
while in the case of half-turn screws, although (46) is at infinity, (1) is easily expressed as
R ̲ ( c ̲ ) = 2 n ̲ n ̲ t ε d n × 1 , ϕ = π .
More generally, when extended to the dual setting, the composition law (2) yields
c ̲ 2 , c ̲ 1 = 1 + ε λ c 2 , c 1 + ε λ
with the notation
λ ( c ̲ 1 , c ̲ 2 ) = c 2 · d 1 + d 2 · c 1 1 c 2 · c 1 , λ ( c ̲ 1 , c ̲ 2 ) = d 2 + d 1 + c 2 × d 1 + d 2 × c 1 1 c 2 · c 1
and clearly, whenever c 2 · c 1 = 1 , one ends up with a transformation of the type (49).
If the condition r ̲ 21 = g ̲ 21 holds, we may use an alternative expression to (5) (see [5]):
τ ̲ 1 = a ̲ 1 × a ̲ 2 · c ̲ g ̲ 12 ρ ̲ 1 ρ ̲ 2 , τ ̲ 2 = a ̲ 1 × a ̲ 2 · c ̲ g ̲ 12 ρ ̲ 2 ρ ̲ 1
where ρ ̲ i = a ̲ i · c ̲ , to derive the solution more easily. These are further simplified in the case of orthogonal screw axes g ̲ 12 = 0 , while R e ( ρ ̲ 1 , 2 ) = 0 obviously leads to infinite elements, i.e., transformations of the type (49). Also, in the case ω 2 0 , one has non-trivial closed rotation sequences (see [4]) which may be extended to closed rigid motion sequences with
τ ̲ 1 = ω ̲ Ω ̲ 23 1 , τ ̲ 2 = ω ̲ Ω ̲ 31 1 , τ ̲ 3 = ω ̲ Ω ̲ 12 1
where Ω ̲ i j are the co-factors in the Gram determinant ω ̲ = ω ̲ 2 , e.g., Ω ̲ 23 = g ̲ 12 g ̲ 31 g ̲ 23 etc. This setting may be further generalized by allowing a non-vanishing dual counterpart in the resulting transformation, i.e., factorizing a pure translation into three rigid motions with a non-trivial rotational component. However, neither of these is possible in the degenerate case ω ̲ = 0 , although formally we have a solution for a ̲ 3 = ± a ̲ 1 with τ ̲ 3 = τ ̲ 1 and τ ̲ 2 = 0 .
The gimbal lock singularity also persists in the dual setting, given by the condition
a ̲ 3 = ± R ̲ a ̲ 1
in which case the first expression in (51) yields the dual scalar parameter for ϕ ̲ 1 ± ϕ ̲ 3 , respectively. We now consider a couple of examples before discussing the case of four factors.
Let us begin we a pair of screw axes given by a ̲ 1 = ( 0 , 1 , ε ) t a ̲ 2 = ( 1 , 0 , ε ) t , and a screw motion introduced with its dual Rodrigues’ vector representing a rotation (the displacement is zero since D u ( c ̲ 2 ) = 0 .) by an angle ϕ = π 3 about a screw axis given by its direction vector R e ( c ̲ ) and moment D u ( c ̲ ) . We calculate the matrix entries and find that the condition r ̲ 21 = g ̲ 21 is satisfied, so a decomposition into a pair of screw motions exists with scalar parameters τ 1 , 2 = 1 ± ε easily obtained using Formula (51). Hence, one has c ̲ = c ̲ 2 , c ̲ 1 with c ̲ 1 = ( 0 , 1 + ε , ε ) t and c ̲ 2 = ( 1 ε , 0 , ε ) t as can be easily verified by (2), or in matrix terms, using (1) we can write
R ( c ̲ ) = 2 ε 0 1 1 2 ε 2 ε 2 ε 1 0 = 1 ε ε ε ε 1 ε 1 ε ε ε 1 ε 1 ε 1 ε ε = R ( c ̲ 2 ) R ( c ̲ 1 ) .
Geometrically, c ̲ 1 and c ̲ 2 are interpreted as screw motions with quarter-turn rotational components and displacements d 1 , 2 = ± 1 , as can be seen from (46). Next, we consider a decomposition into three factors R ( c ̲ ) = R ( c ̲ 3 ) R ( c ̲ 2 ) R ( c ̲ 1 ) where a ̲ 3 = a ̲ 1 and R is a rigid transformation of type (49) with a screw line n ̲ = 1 2 ( 1 + ε , 1 ε , 0 ) t . Here, the Davenport condition g ̲ 12 = g ̲ 13 = 0 is satisfied with Δ ̲ = 1 and since ω ̲ i 0 the solutions (3) are symmetric: τ ̲ 1 ± = τ ̲ 3 ± = ± 1 and τ 2 ± = ± ( 1 + 2 ε ) , which yields the matrix factorization
2 ε 1 0 1 2 ε 0 0 0 1 = 0 ε 1 ε 1 ε 1 ε 0 1 ε ε ε 2 ε 1 ε 1 2 ε 0 ε 1 ε 1 ε 1 ε 0
along with its transpose (note that the matrix on the left is symmetric since d = 0 ). Geometrically, the outer factor represents a quarter-turn about a screw axis given by its Plücker coordinates R e ( a ̲ 1 ) and D u ( a ̲ 1 ) , while the one in the middle has a non-trivial displacement d 2 ± = ± 2 beside the quarter-turn rotation ϕ 2 ± = ± π 2 , and its moment vector is m = ( 0 , 0 , 1 ) t .
The transfer principle certainly allows us to do much more with dual matrices and quaternions. For interesting examples and possible applications, we refer the reader to [8,9,10] and focus on generalizing what we previously called ‘the shift parameter’ construction.

4.2. Optimization of Screw Motions

We begin with the observation that Formula (4), which provides the necessary and sufficient condition for factorization in SO ( 3 ) , remains valid also in the case of generic rigid (screw) motions, since only the real part of the determinant actually remains under the square root, as Formula (44) shows. Hence, all inequalities regarding the relative angles, such as (12) or (28), also apply in this broader setting. It may seem counterintuitive since pure translations cannot always be factorized unless the axes form a system of maximal rank, but that case goes beyond the validity of the transfer principle we rely on here, and yet, it is still possible in some cases, accounting for mutually canceling rotational components in the decomposition. This can be considered as a variation of a closed rotation sequence solution which exists in two cases: non-coplanar axes, where Formula (52) applies, and a ̲ 3 = ± a ̲ 1 with direct cancellation τ 3 = τ 1 , τ 2 = 0 , leaving room for a residual slide, e.g.,
e 1 + ε e 2 , e 1 + ε e 2 = ε e 2 + e 3 .
Having pointed this out, let us return to the regular case of screw motions with non-vanishing rotational component ϕ 0 . All equalities derived in the previous section generalize for the corresponding dual entities g ̲ i j , r ̲ i j , etc., while the inequalities apply for their real counterparts. Consider, for example, the decomposition (33) for a screw motion determined by its dual Rodrigues’ vector c ̲ = ( 1 , 1 + ε , 1 ε ) t , which is obviously a rotation by an angle ϕ = π 3 about a screw axis with Plücker coordinates R e ( c ̲ ) and D u ( c ̲ ) . Let τ i ( α ) = τ i + , so that τ 1 ( 0 ) = 1 + ε , τ 2 ( 0 ) = ε 2 and τ 3 ( 0 ) = 1 , i.e., the decomposition involves a quarter-turn, a translation, and a screw motion with i = 1 3 | ϕ i | = π , i = 1 3 | d i | = 3 2 , namely
0 ε 1 1 ε 0 ε 1 ε = 0 1 0 1 0 0 0 0 1 1 0 ε 0 1 0 ε 0 1 1 0 0 0 ε 1 0 1 ε ·
It is interesting to observe that in this case τ 1 = 1 + ε does not depend on α , while τ 2 = ε 2 cos α and τ 3 = 1 ε tan α , so the minimum (with respect to both degrees of freedom) is at α = 0 . Interestingly enough, if we use the basis { a ̲ i } from our previous example, there is a stable factorization into a pair of screw motions c ̲ = ( ε 1 ) a ̲ 3 , ( 1 + ε ) a ̲ 2 that are not affected by α .
Our next example illustrates how both the total rotation and total displacement in a screw decomposition can be independently affected by the additional parameter α , which is kept real (angular) for the sake of representability. For our compound rigid motion, we choose c ̲ = 1 5 ( 3 + 4 ε , 4 3 ε , ε ) t , which is again a quarter-turn about a screw axis with direction vector R e ( c ̲ ) and moment D u ( c ̲ ) . The decomposition takes place with respect to an orthonormal basis formed by a ̲ 1 , a ̲ 2 and a ̲ 3 = a ̲ 1 × a ̲ 2 used in the previous example, so the dual extension of Formula (33) applies here, and it is straightforward to assess the cost functions for the rotation and displacement components in the factorization separately (Figure 3). We should take into account that the minimum with respect to these two counterparts typically does not occur at the same value of α , as can be seen in that example, so we have to prioritize according to the actual energy cost associated with these types of motion. This can also be done with the help of statistical weights adjusted to the situation. Another observation worth mentioning is that while the intervals for α are preserved in the dual extensions, the cost function builds up even more rapidly approaching its boundaries compared to the case of pure rotations. Moreover, the solutions may still have discontinuities within these intervals, in analogy with the classical gimbal lock setting, as well as infinite values corresponding to generalized half-turns (49). Note also that with the above example we impose an artificial restriction on α demanding that it is real, which may prevent us from arriving at the optimal solution but is convenient for a nice graphic representation. In our numerical experiments, the overall displacement increases quickly when α is far from zero; however, as in the case of pure rotations, its minimum does not have to be at the origin.
To conclude, let us summarize the whole process in a nutshell. Given a compound rotation R and a set of invariant axes, one constructs all possible Euler-type decompositions into four factors by permuting the axes and assessing the corresponding condition. For a pair of axes, we only have two such configurations, but for a triplet, we end up with a dozen of them. If all of them satisfy the necessary and sufficient condition, we typically expect a pair of solutions with a free parameter for each configuration, which doubles them to 24, and, finally, assigning the parameter to each of the two repeated axes in the pair (using conjugation wherever necessary) yields the number 48. For each such setting, we have an analytic solution in terms of the ‘shift parameter’ α , for which the corresponding cost function can be minimized, and comparing those minima, we pick the best configuration and α -value to perform our motion sequence. Needless to say, the cost function itself needs to be determined first: on the one hand, the energy cost of rotation and translation differs, while on the other, so do rotations about different axes in asymmetric rigid bodies. Both of these aspects can be modeled using effective weights, as discussed above. Although this approach may seem confusing, it has some clear advantages, e.g., all solutions are analytic, and optimization may, in principle, be performed symbolically; no iterative procedure is needed—only simple matrix calculations. Moreover, many entries in the parallel solutions, such as g i j and r i j , are shared, so there is no need to repeat the same calculations. A block diagram of the proposed method is given for convenience in Figure 4.
Although the idea is quite clear, there are some technicalities to consider in the process. Firstly, for certain values of α within the allowed interval, one may hit a gimbal lock singularity, which is reflected as a discontinuity of the cost function, occurring both in the case of pure rotations and for generic rigid motions. As explained above, this simply transfers freedom from the shift parameter to the one encoded in the gimble lock entanglement (see [5]). Those critical α -values may solve our optimization problem in rare cases; more precisely, their left or right limits may provide the global minimum. Secondly, there are an infinite number of points in our description, and that is the price we pay for avoiding redundant parameters. Those infinite points correspond to half-turns or their dual extension (49) and also may appear as optimal solutions, however unlikely. Since we deal with mostly rational expressions, this may be detected by the vanishing denominator, at least in the regular setting (no gimbal lock). L’Hôpital’s rule then provides the correct numerical value. Another way to avoid infinite points is going back to homogeneous (dual quaternion) coordinates or, to be safe, performing a double-valued lift back to the spin cover c ̲ ζ ̲ ± S 3 [ ε ] given in this case as
ζ ̲ 0 ± = ± ( 1 + c ̲ 2 ) 1 2 , ζ ̲ ± = ( ζ ̲ 0 ) 1 c ̲ *
where the Hodge dual is being used to transform the quaternion bi-vector part to a vector and vice versa. The additional component increases the number of computations and makes some expressions less intuitive, but since engineers work extensively with matrices and quaternions rather than Rodrigues’ vectors, it is important to point out this correspondence, too. Moreover, some applications involve directly SU ( 2 ) factorizations, as discussed below.

5. Discussion

The present study does not consider the general problem of geometric control, but rather, contributes to one very specific aspect of it: namely, optimization of discrete screw motion sequences, generalizing the classic Euler-type rotation sequences in attitude control. Unlike other attempts in this area, it relies on closed-form analytic solutions, so there is no assessment of algorithmic complexity provided in this paper (only simple matrix operations are involved). Its only actual limitation is presented by the interval for the variational parameter α , while the presence of gimbal lock singularities or infinite solutions within this interval presents merely a technical issue. Note also that we do not consider other optimization criteria, such as finding the smoothest or fastest trajectory interpolating a rigid motion, for example, although these problems may also be approached using dual quaternions. Instead, we focus only on energy efficiency with just one additional parameter. This approach does not guarantee to provide the global minimum in all possible settings, but it is purely analytic, quite easy to implement, and still rather efficient: our calculations show that it may reduce the cost of a maneuver by 30–40% without the need to invoke complex numerical or machine learning algorithms used in other optimization methods (see [13,21,24]). Moreover, our solutions work with a relaxed version of the classical Davenport factorization condition for orthogonal axes, thus allowing for a wider variety of gimbal settings (such as tetrahedral), which might be useful for engineering applications.
Since our construction naturally extends to the spin covering group SU ( 2 ) , it may be applied to qubits in quantum computing, computer vision, and virtual reality [15,25]. A similar approach can be used for the proper Lorentz group in the plane SO + ( 2 , 1 ) and its spin covering SL ( 2 , R ) SU ( 1 , 1 ) using the decomposition results obtained in [4]. In that setting, however, one needs to take into account, apart from the gimbal lock, also the isotropic singularity associated with the light cone in R 2 , 1 , which (unlike the former) is not affected by α , being an invariant subspace independent of the τ i ’s. The ‘dualization’ procedure works similarly in the hyperbolic setting, extending pseudo-rotations to general Poincaré motions in Minkowski 2 + 1 space, but even within the homogeneous component, one has different types of transformations: pure rotations, Lorentz boosts, and isotropic displacements, which makes it harder to construct a meaningful cost function only from first principles, as factorizations in general may involve all three, e.g., the famous Iwasawa decomposition. It is an interesting direction in which this study can be generalized, although the 2 + 1 Lorentz group has fewer applications compared to SO ( 3 ) or SO + ( 3 , 1 ) : apart from being used as a toy model for relativity, it plays a role in quantum mechanical scattering, the description of graphenes, and certainly classical hyperbolic geometry. The entire Lorentz group, however, is a bit too wild to tame this way: although the factorizations may be described similarly using complex projective biquaternions, dualization does not have the same meaning; furthermore, the Plücker embedding is not trivial, which means we no longer deal with just plane transformations. However, interpreting the generalized ‘axes’ { a k } as generators of Abelian subgroups, the factorization problem still makes perfect sense in SO + ( 3 , 1 ) SO ( 3 , C ) as well, and as long as one declares a meaningful cost optimization goal, a similar approach can also be applied to the (homogeneous) relativistic setting—from purely algebraic perspective, it is not so different to the one considered here (see [26,27]). However, all these interesting applications and generalizations, as well as the continuous version of the problem, go beyond the scope of the present study and are left for the future.

6. Conclusions

This paper proposes an exact closed-form solution to the optimization problem of finite rigid motion sequences, which arise in the attitude control of robots, drones, and spacecraft. Spatial rotations and translations are interpreted as screw motions and modeled using projective dual quaternions, also known as dual Rodrigues’ vectors. The goal is to minimize the energy output, measured by the total amount of motion in a sequence of four factors, so we have only one free (dual) parameter. The Euclidean and angular displacements contribute to the cost function with weight coefficients, since the difference in energy output between the two types of motion depends on the specific construction of the mechanism and the environment in which it operates. The same applies to rotations about individual gimbals, which may be associated with different moments of inertia or external sources of asymmetry, leading again to the introduction of weights in the cost function. Our solutions are illustrated with numerical examples, both in the pure rotation and screw motion settings. Specific configurations, such as closed sequences (factorizations of the identity map) or gimbal lock singularities, and the role of infinite points are also discussed.

Funding

This study is a part of a multidisciplinary project named ‘Applications of Geometric Algebras in Problems of Geodesy, Photogrammetry and Design’ funded by the Applied Research Center at the University of Architecture, Civil Engineering and Geodesy, Grant No ‘БH-334/2026’.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Sachkov, Y. Introduction to Geometric Control; Springer Nature: Cham, Switzerland, 2022. [Google Scholar]
  2. Piovan, G.; Bullo, F. On Coordinate-Free Rotation Decomposition: Euler Angles about Arbitrary Axes. IEEE Trans. Robot. 2012, 28, 728–733. [Google Scholar]
  3. Rezaei, A.; Talaeizadeh, A.; Alasty, A. Comparing the Performance of Quaternion, Rotation Matrix, and Euler Angles Based Attitude PID Controllers for Quadrotors. In Proceedings of the 2024 12th RSI International Conference on Robotics and Mechatronics (ICRoM), Tehran, Iran, 17–19 December 2024; pp. 492–497. [Google Scholar]
  4. Brezov, D.; Mladenova, C.; Mladenov, I. A Decoupled Solution to the Generalized Euler Decomposition Problem in R 3 and R 2 , 1 . J. Geom. Symmetry Phys. 2014, 33, 47–78. [Google Scholar]
  5. Brezov, D.; Mladenova, C.; Mladenov, I. New Perspective on the Gimbal Lock Problem. AIP Conf. Proc. 2013, 1570, 367–374. [Google Scholar] [CrossRef]
  6. Piña, E. Rotations with Rodrigues’ vector. Eur. J. Phys. 2011, 32, 1171–1178. [Google Scholar] [CrossRef]
  7. Fathian, K.; Jin, J.; Wee, S.G.; Lee, D.H.; Kim, Y.G.; Gans, N.R. Camera relative pose estimation for visual servoing using quaternions. Robot. Auton. Syst. 2018, 107, 45–62. [Google Scholar] [CrossRef]
  8. Wittenburg, J. Kinematics: Theory and Applications; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
  9. Condurache, D.; Cojocari, M.; Ciureanu, I.-A. A Closed Form of Higher-Order Cayley Transforms and Generalized Rodrigues Vectors Parameterization of Rigid Motion. Mathematics 2025, 13, 114. [Google Scholar] [CrossRef]
  10. Farias, J.G.; De Pieri, E.; Martins, D. A Review on the Applications of Dual Quaternions. Machines 2024, 12, 402. [Google Scholar] [CrossRef]
  11. Valverde, A.; Tsiotras, P. Spacecraft Robot Kinematics Using Dual Quaternions. Robotics 2018, 7, 64. [Google Scholar] [CrossRef]
  12. Arrizabalaga, J.; Ryll, M. Pose-Following with Dual Quaternions. In Proceedings of the 2023 62nd IEEE Conference on Decision and Control (CDC), Singapore, 13–15 December 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 5959–5966. [Google Scholar]
  13. Condurache, D.; Cojocari, M. The Extended Wahba’s Problem in Dual and Multi-Dual Algebras. In Proceedings of the 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT), Vallette, Malta, 1–4 July 2024; pp. 2108–2113. [Google Scholar]
  14. Yang, Y. Spacecraft Modeling, Attitude Determination, and Control: Quaternion-Based Approach, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2025. [Google Scholar]
  15. Billig, Y. Time-Optimal Decompositions in SU(2). Quantum Inf. Process. 2013, 12, 955–971. [Google Scholar] [CrossRef]
  16. Billig, Y. Optimal Attitude Control with Two Rotation Axes. SIAM J. Control Optim. 2019, 57, 1111–1131. [Google Scholar] [CrossRef]
  17. Eslamiat, H.; Wang, N.; Hamrah, R.; Sanyal, A.K. Geometric Integral Attitude Control on SO(3). Electronics 2022, 11, 2821. [Google Scholar] [CrossRef]
  18. Zhang, S.; Shi, X.; Chen, X.; He, X. Trajectory Tracking Control Based on Generalized Rodrigues Parameter for Underactuated VTOL UAVs. J. Aerosp. Eng. 2024, 32, 6. [Google Scholar] [CrossRef]
  19. Zheng, Z.; Shang, W.; Ai, J.; Zou, Y.; Liu, Z. Integrated Geometric Optimal Control of Spacecraft Attitude and Orbit Based on SE(3). IEEE Access 2023, 11, 27382–27394. [Google Scholar] [CrossRef]
  20. Brezov, D. The Order of Finite Generation of SO(3) and Optimization of Rotation Sequences. Rocky Mt. J. Math. 2026, 56, 23–32. [Google Scholar] [CrossRef]
  21. Jin, K.; Huang, G.; Lei, R.; Wei, C.; Wang, Y. Multi-constrained predictive optimal control for spacecraft attitude stabilization and tracking with performance guarantees. Aerosp. Sci. Technol. 2024, 155, 109599. [Google Scholar] [CrossRef]
  22. Guerrero-Sánchez, M.E.; Abaunza, H.; Castillo, P.; Lozano, R.; García-Beltrán, C.D. Quadrotor Energy-Based Control Laws: A Unit-Quaternion Approach. J. Intell. Robot. Syst. 2017, 88, 347–377. [Google Scholar] [CrossRef]
  23. Brezov, D. Optimization and Gimbal Lock Control via Shifted Decomposition of Rotations. J. Appl. Comput. Math. 2018, 7, 410. [Google Scholar]
  24. Cai, Y.; Low, K.S.; Wang, Z. Reinforcement Learning-Based Satellite Formation Attitude Control Under Multi-Constraint. Adv. Space Res. 2024, 74, 5819–5836. [Google Scholar] [CrossRef]
  25. D’Alessandro, D. Introduction to Quantum Control and Dynamics, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2021. [Google Scholar]
  26. Brezov, D. Higher-Dimensional Representations of SL(2, R ) and Its Real Forms via Plücker Embedding. Adv. Appl. Clifford Algebras 2017, 27, 2375–2392. [Google Scholar] [CrossRef]
  27. Shariati, A. A Mathematical Approach to Special Relativity; Academic Press: London, UK, 2023. [Google Scholar]
Figure 1. Plot of E γ ( α ) for (a) X Y X Z sequence (7) with ϕ = 120 and n = ( 3 , 4 , 5 ) t , (b) Z X Z X sequence (17) of a half-turn about n = ( 5 , 4 , 3 ) t , and (c) the former rotation in a X Y Z X setting (25).
Figure 1. Plot of E γ ( α ) for (a) X Y X Z sequence (7) with ϕ = 120 and n = ( 3 , 4 , 5 ) t , (b) Z X Z X sequence (17) of a half-turn about n = ( 5 , 4 , 3 ) t , and (c) the former rotation in a X Y Z X setting (25).
Appliedmath 06 00080 g001
Figure 2. The examples illustrated in Figure 1 (following the same order) with a modified (weighted) cost function E γ ( α ) . The weight values for the three axes are set to: κ 1 = 1 , κ 2 = 1 / 2 and κ 3 = 1 / 3 .
Figure 2. The examples illustrated in Figure 1 (following the same order) with a modified (weighted) cost function E γ ( α ) . The weight values for the three axes are set to: κ 1 = 1 , κ 2 = 1 / 2 and κ 3 = 1 / 3 .
Appliedmath 06 00080 g002
Figure 3. (a) The weighted cost function for the factorization (7) of c ̲ = 1 5 ( 3 + 4 ε , 4 3 ε , ε ) t in the basis { a ̲ i } , (b,c) depict the rotation and displacement components separately for the two solutions in (33). Angles are measured in radians on the y-axis, and the weights for both types of motion are equal.
Figure 3. (a) The weighted cost function for the factorization (7) of c ̲ = 1 5 ( 3 + 4 ε , 4 3 ε , ε ) t in the basis { a ̲ i } , (b,c) depict the rotation and displacement components separately for the two solutions in (33). Angles are measured in radians on the y-axis, and the weights for both types of motion are equal.
Appliedmath 06 00080 g003
Figure 4. A block diagram of the proposed optimization method in five simple steps.
Figure 4. A block diagram of the proposed optimization method in five simple steps.
Appliedmath 06 00080 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Brezov, D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath 2026, 6, 80. https://doi.org/10.3390/appliedmath6050080

AMA Style

Brezov D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath. 2026; 6(5):80. https://doi.org/10.3390/appliedmath6050080

Chicago/Turabian Style

Brezov, Danail. 2026. "Optimizing Motion Sequences with Projective Dual Quaternions" AppliedMath 6, no. 5: 80. https://doi.org/10.3390/appliedmath6050080

APA Style

Brezov, D. (2026). Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath, 6(5), 80. https://doi.org/10.3390/appliedmath6050080

Article Metrics

Back to TopTop