Time Optimal Synthesis for Left--Invariant Control Systems on SO(3)
Ugo Boscain, Yacine Chitour
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.
Create a lesson
Related papers
A Network Simplex Framework For Discrete Unbalanced Optimal Transport
Gaetano Agazzotti, Antonin Chambolle, Clément W. Royer
Warm-IP: A Path-Following ADMM Warm Start for Interior-Point Quadratic Programming
Babak Aslani, Mojtaba Tefagh, Gourav Jhanwar et al.
Adaptive Variance Reduction without Knowing Oracle Smoothness
Wei Jiang, Yibo Wang, Zechao Li
Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
Gon Buzaglo, Guy Kornowski
Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
Estimation, Sensitivity Analysis, and Optimization of Distortion Risk Measures via Simulation
Hao Cao, Jian-Qiang Hu, Jiaqiao Hu