Searcharxiv⌕ Search

arXiv subjects

Meeko Oishi

Publications and source records attributed to Meeko Oishi.

20 records · Page 2Linked to original sources

Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time Linear Systems

We present a scalable set-valued safety-preserving controller for constrained continuous-time linear time-invariant (LTI) systems subject to additive, unknown but bounded disturbance or uncertainty. The approach relies upon a conservative approximation of the discriminating kernel using robust maximal reachable sets---an extension of our earlier work on computation of the viability kernel for high-dimensional systems. Based on ellipsoidal techniques for reachability, a piecewise ellipsoidal algorithm with polynomial complexity is described that under-approximates the discriminating kernel under LTI dynamics. This precomputed piecewise ellipsoidal set is then used online to synthesize a permissive state-feedback safety-preserving controller. The controller is modeled as a hybrid automaton and can be formulated such that under certain conditions the resulting control signal is continuous across its transitions. We show the performance of the controller on a twelve-dimensional flight envelope protection problem for a quadrotor with actuation saturation and unknown wind disturbances.

eess.SY↗

A Modified Riccati Transformation for Decentralized Computation of the Viability Kernel Under LTI Dynamics

Computing the viability kernel is key in providing guarantees of safety and proving existence of safety-preserving controllers for constrained dynamical systems. Current numerical techniques that approximate this construct suffer from a complexity that is exponential in the dimension of the state. We study conditions under which a linear time-invariant (LTI) system can be suitably decomposed into lower-dimensional subsystems so as to admit a conservative computation of the viability kernel in a decentralized fashion in subspaces. We then present an isomorphism that imposes these desired conditions, particularly on two-time-scale systems. Decentralized computations are performed in the transformed coordinates, yielding a conservative approximation of the viability kernel in the original state space. Significant reduction of complexity can be achieved, allowing the previously inapplicable tools to be employed for treatment of higher-dimensional systems. We show the results on two examples including a 6D system.

eess.SY↗