The Nelder-Mead algorithm is used to efficiently search the gain space for locally optimal gains near some pre-determined initial gains. (Above is a visualization of the Nelder-Mead algorithm over the Rosenbrock banana function taken from wikipedia.org)
The Schur complement lemma can be used to transform nonlinear quadratic constraints with optimization parameters m_{i} to equivalent Linear Matrix Inequalities (LMI) which are convex and solvable.
A simplified representation of the product space TSO(3) x SO(3). The rigid body dynamics evolve on the TSO(3) manifold which consist of the attitude and angular velocity (R, ω) (shown on left). The reference trajectory evolves on the SO(3) manifold with independent dynamics going from R_{ref} to the desired attitude R_{d} (shown on right).
The distance error over time from the current attitude to the desired attitude is shown above. The system starting at the maximum distance (π) away from the desired attitude convergences exponentially.
The angular velocity error as a function of time is shown above. Initially the system increased speed to follow the reference trajectory, but eventually slows down when the system reaches the desired attitude.
The control torque in 3-dimensions is shown. The controls are smooth making them ideal for real motors. In other popular hybrid approaches, the control may exhibit sudden jumps or drastic shift in torque requirements when switching between local controllers making them problematic for actuators.
The maximum eigenvalue of the contraction matrix (used to prove exponential stability) along the system's trajectory is always nonpositive, thus the system is exponentially converging.