5 papers
Exploiting symmetry for discrete-time reachability computations
John Maidens, Murat Arcak
We present a method of computing backward reachable sets for nonlinear discrete-time control systems possessing continuous symmetries. The starting point is a dynamic game formulat…
Symmetry reduction for dynamic programming
John Maidens, Axel Barrau, Silvere Bonnabel +1
We present a method of exploiting symmetries of discrete-time optimal control problems to reduce the dimensionality of dynamic programming iterations. The results are derived for s…
Simulation-based reachability analysis for nonlinear systems using componentwise contraction properties
Murat Arcak, John Maidens
A shortcoming of existing reachability approaches for nonlinear systems is the poor scalability with the number of continuous state variables. To mitigate this problem we present a…
Semidefinite relaxations in optimal experiment design with application to substrate injection for hyperpolarized MRI
John Maidens, Murat Arcak
We consider the problem of optimal input design for estimating uncertain parameters in a discrete-time linear state space model, subject to simultaneous amplitude and l1/l2-norm co…
A note on optimal experiment design for nonlinear systems using dynamic programming
John Maidens, Murat Arcak
We present a method of solving the T-optimal design problem for nonlinear dynamical systems using dynamic programming. In contrast with previous dynamic programming formulations, w…