Transversally exponentially stable Euclidean space extension technique for discrete time systems
We propose a modification technique for discrete time systems for exponentially fast convergence to compact sets. The extension technique allows us to use tools defined on Euclidean spaces to systems evolving on manifolds by modifying the dynamics of the system such that the manifold is an attractor set. We show the stability properties of this technique using the simulation of the rigid body rotation system on the unit sphere $S^3$. We also show the improvement afforded due to this technique on a Luenberger like observer designed for the rigid body rotation system on $S^3$.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Fast hyperboloid decision tree algorithms
Hyperbolic geometry is gaining traction in machine learning for its effectiveness at capturing hierarchical structures in real-world data. Hyperbolic spaces, where neighborhoods grow exponentially, offer substantial adva…
BenchmarkingRiemannian optimizationDynamically Stable Poincaré Embeddings for Neural Manifolds
In a Riemannian manifold, the Ricci flow is a partial differential equation for evolving the metric to become more regular. We hope that topological structures from such metrics may be used to assist in the tasks of mach…
image-classificationImage ClassificationGlobally exponentially convergent observer for systems evolving on matrix Lie groups
We propose a globally exponentially convergent observer for the dynamical system evolving on matrix Lie groups with bounded velocity with unknown bound. We design the observer in the ambient Euclidean space and show expo…
TranslationExponentially Stable Adaptive Control Under Semi-PE Condition
A novel method of exponentially stable adaptive control to compensate for matched parametric uncertainty under a mild condition of semi-persistent excitation (s-PE) of a regressor with piecewise-constant rank and nullspa…
Mirror Descent Beyond Euclidean Stability: An Exponential Separation in Initialization Sensitivity
Mirror Descent (MD) extends Gradient Descent (GD) beyond Euclidean geometry and has recently reappeared as a lens for KL-regularized policy optimization in reinforcement learning and LLM post-training. This raises a basi…
Reinforcement Learning