Time Optimal Synthesis for Left--Invariant Control Systems on SO(3)

Abstract

Consider the control system given by x=x(f+ug), where x∈ SO(3), |u|≤ 1 and f,g∈ so(3) define two perpendicular left-invariant vector fields normalized so that \|f\|=() and \|g\|=(), ∈ ]0,π/4[. In this paper, we provide an upper bound and a lower bound for N(α), the maximum number of switchings for time-optimal trajectories. More precisely, we show that NS()≤ N()≤ NS()+4, where NS() is a suitable integer function of which for 0 is of order π/(4α). The result is obtained by studying the time optimal synthesis of a projected control problem on R P2, where the projection is defined by an appropriate Hopf fibration. Finally, we study the projected control problem on the unit sphere S2. It exhibits interesting features which will be partly rigorously derived and partially described by numerical simulations.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…