Related papers: Single-Impulse Reachable Set in Arbitrary Dynamics…
One of the most important problems in hybrid systems is the {\em reachability problem}. The reachability problem has been shown to be undecidable even for a subclass of {\em linear} hybrid systems. In view of this, the main focus in the…
We describe a successive convex programming (Sequential Convex Programming (SCP)) based approach for estimate the set of points where a 5-degree of freedom (5-DoF) reusable launch vehicle (RLV) returning to a landing site can transition…
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…
This paper proposes an algorithm capable of driving a system to follow a piecewise linear trajectory without prior knowledge of the system dynamics. Motivated by a critical failure scenario in which a system can experience an abrupt change…
In this work, we propose a new framework for reachable set computation through continuous evolution of a set of parameters and offsets which define a parametope, through the intersection of constraints. This results in a dynamical approach…
In this paper, we present an analytical approach for the synthesis of ellipsoidal probabilistic reachable sets of saturated systems subject to unbounded additive noise. Using convex optimization methods, we compute a contraction factor of…
Inner-approximate reachability analysis involves calculating subsets of reachable sets, known as inner-approximations. This analysis is crucial in the fields of dynamic systems analysis and control theory as it provides a reliable…
We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical…
This paper presents a method for calculating Region of Attraction of a target set (not necessarily an equilibrium) for controlled polynomial dynamical systems, using a hierarchy of semidefinite programming problems (SDPs). Our approach…
The discovery of interstellar interlopers such as 1I/`Oumuamua, 2I/Borisov, and 3I/ATLAS have highlighted the necessity of understanding the dynamical pathways that eject small bodies from planetary systems into hyperbolic trajectories. In…
Sapo is a C++ tool for the formal analysis of polynomial dynamical systems. Its main features are: 1) Reachability computation, i.e., the calculation of the set of states reachable from a set of initial conditions, and 2) Parameter…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…
Accurately modeling and verifying the correct operation of systems interacting in dynamic environments is challenging. By leveraging parametric uncertainty within the model description, one can relax the requirement to describe exactly the…
This paper investigates reachability analysis for max-plus linear systems (MPLS), an important class of dynamical systems that model synchronization and delay phenomena in timed discrete-event systems. We specifically focus on backward…
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b)…
We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal…
In this work, we present a numerical optimal control framework for reachable set computation using \emph{normotopes}, a new set representation as a norm ball with a shaping matrix. In reachable set computations, we expect to continuously…
Spacecraft relative motion planning is concerned with the design and execution of maneuvers relative to a nominal target. These types of maneuvers are frequently utilized in missions such as rendezvous and docking, satellite inspection and…
The Circular Restricted Three-Body Problem (CR3BP) models the motion of a massless body under the gravitational influence of two primaries. We present a method for approximating a given family of periodic orbits by low-degree implicit…
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a matrix $M \in \mathbb{Q}^{d \times d}$, an initial vector…