5 citations · 15 across the 17 of their papers we have counts for
4 papers · 1 filter
Efficient Norm-Based Reachable Sets via Iterative Dynamic Programming
Akash Harapanahalli, Samuel Coogan
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.…
Automatic and Scalable Safety Verification using Interval Reachability with Subspace Sampling
Brendan Gould, Akash Harapanahalli, Samuel Coogan
Interval refinement is a technique for reducing the conservatism of traditional interval based reachability methods by lifting the system to a higher dimension using new auxiliary…
linrax: A JAX Compatible, Simplex Method Linear Program Solver
Brendan Gould, Akash Harapanahalli, Samuel Coogan
We present linrax, the first simplex based linear program (LP) solver compatible with the JAX ecosystem. In many control algorithms, LPs are often automatically generated and frequ…
Parametric Reachable Sets Via Controlled Dynamical Embeddings
Akash Harapanahalli, Samuel Coogan
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 inters…