Guaranteed Reachability on Riemannian Manifolds for Unknown Nonlinear Systems
Determining the reachable set for a given nonlinear system is critically important for autonomous trajectory planning for reach-avoid applications and safety critical scenarios. Providing the reachable set is generally impossible when the dynamics are unknown, so we calculate underapproximations of such sets using local dynamics at a single point and bounds on the rate of change of the dynamics determined from known physical laws. Motivated by scenarios where an adverse event causes an abrupt change in the dynamics, we attempt to determine a provably reachable set of states without knowledge of the dynamics. This paper considers systems which are known to operate on a manifold. Underapproximations are calculated by utilizing the aforementioned knowledge to derive a guaranteed set of velocities on the tangent bundle of a complete Riemannian manifold that can be reached within a finite time horizon. We then interpret said set as a control system; the trajectories of this control system provide us with a guaranteed set of reachable states the unknown system can reach within a given time. The results are general enough to apply on systems that operate on any complete Riemannian manifold. To illustrate the practical implementation of our results, we apply our algorithm to a model of a pendulum operating on a sphere and a three-dimensional rotational system which lives on the abstract set of special orthogonal matrices.
Code (0)
등록된 구현이 없습니다.
Tasks
Trajectory PlanningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Bayesian Quadrature on Riemannian Data Manifolds
Riemannian manifolds provide a principled way to model nonlinear geometric structure inherent in data. A Riemannian metric on said manifolds determines geometry-aware shortest paths and provides the means to define stati…
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…
Riemannian stochastic optimization methods avoid strict saddle points
Many modern machine learning applications - from online principal component analysis to covariance matrix identification and dictionary learning - can be formulated as minimization problems on Riemannian manifolds, and a…
Dictionary LearningPolicy Gradient MethodsRiemannian optimizationStochastic OptimizationRobust Data-Driven Predictive Control of Unknown Nonlinear Systems using Reachability Analysis
This work proposes a robust data-driven predictive control approach for unknown nonlinear systems in the presence of bounded process and measurement noise. Data-driven reachable sets are employed for the controller desig…
Vector-valued Gaussian Processes on Riemannian Manifolds via Gauge Independent Projected Kernels
Gaussian processes are machine learning models capable of learning unknown functions in a way that represents uncertainty, thereby facilitating construction of optimal decision-making systems. Motivated by a desire to de…
BIG-bench Machine LearningDecision MakingGaussian ProcessesVariational Inference