Geometric Reachability for Attitude Control Systems via Contraction Theory
In this paper, we present a geometric framework for the reachability analysis of attitude control systems. We model the attitude dynamics on the product manifold $\mathrm{SO}(3) \times \mathbb{R}^3$ and introduce a novel parametrized family of Riemannian metrics on this space. Using contraction theory on manifolds, we establish reliable upper bounds on the Riemannian distance between nearby trajectories of the attitude control systems. By combining these trajectory bounds with numerical simulations, we provide a simulation-based algorithm to over-approximate the reachable sets of attitude systems. We show that the search for optimal metrics for distance bounds can be efficiently performed using semidefinite programming. Additionally, we introduce a practical and effective representation of these over-approximations on manifolds, enabling their integration with existing Euclidean tools and software. Numerical experiments validate the effectiveness of the proposed approach.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
$λ$-Reachability: Geometric-Horizon Safety Bellman Equations for Humanoid Safety
We introduce $λ$-Reachability, a scalable approach to Hamilton--Jacobi safety analysis for high-dimensional robotic systems. Unlike prior discounted formulations that rely on fixed one-step Bellman updates, $λ$-Reachabil…
Collision AvoidanceContraction-Guided Adaptive Partitioning for Reachability Analysis of Neural Network Controlled Systems
In this paper, we present a contraction-guided adaptive partitioning algorithm for improving interval-valued robust reachable set estimates in a nonlinear feedback loop with a neural network controller and disturbances. …
Efficient Reachable Sets on Lie Groups Using Lie Algebra Monotonicity and Tangent Intervals
In this paper, we efficiently compute overapproximating reachable sets for control systems evolving on Lie groups, building off results from monotone systems theory and geometric integration theory. We consider intervals…
On relaxing the N-Reachability Implicit Requirement in NMPC Design
This paper proposes a proof of stability for Model Predictive Control formulations involving a prediction horizon that might be too short to meet the reachability condition generally invoked as a sufficient condition for…
Model Predictive ControlPredictionNeural Robust Control on Lie Groups Using Contraction Methods (Extended Version)
In this paper, we propose a learning framework for synthesizing a robust controller for dynamical systems evolving on a Lie group. A robust control contraction metric (RCCM) and a neural feedback controller are jointly t…