Related papers: Sufficient Conditions for Detectability of Approxi…
This paper is concerned with linear parameter-dependent systems and considers the notion uniform ensemble reachability. The focus of this work is on constructive methods to compute suitable parameter-independent open-loop inputs for such…
This work is dedicated to the stability analysis of time-delay systems with a single constant delay using the Lyapunov-Krasovskii theorem. This approach has been widely used in the literature and numerous sufficient conditions of stability…
A joint characterization of reachability (controllability) and observability (constructibility) for linear SISO nonuniformly sampled discrete systems is presented. The work generalizes to the nonuniform sampling the criterion known for the…
This work presents a notion of strong detectability for linear time varying systems affected by unknown inputs. It is shown that this notion is equivalent to detectability of an auxiliary system without unknown inputs. This allows a…
This paper presents a discrete-time nonlinear system identification method while satisfying the stability and safety properties of the system with high probability. An Extreme Learning Machine (ELM) is used with a Gaussian assumption on the…
We propose matrix commutator based stability characterization for discrete-time switched linear systems under restricted switching. Given an admissible minimum dwell time, we identify sufficient conditions on subsystems such that a switched…
The aim of this paper is to construct and analyze explicit exponential Runge-Kutta methods for the temporal discretization of linear and semilinear integro-differential equations. By expanding the errors of the numerical method in terms of…
Discrete-time models of non-uniformly sampled nonlinear systems under zero-order hold relate the next state sample to the current state sample, (constant) input value, and sampling interval. The exact discrete-time model, that is, the…
A general input-output modelling technique for aperiodic-sampling linear systems has been developed. The procedure describes the dynamics of the system and includes the sequence of sampling periods among the variables to be handled. Some…
In this paper, a modification of the conventional approximations to the quasi-maximum likelihood method is introduced for the parameter estimation of diffusion processes from discrete observations. This is based on a convergent…
This work presents a control-oriented identification scheme for efficient control design and stability analysis of nonlinear systems. Neural networks are used to identify a discrete-time nonlinear state-space model to approximate…
This paper deals with the problem of finite-time learning for unknown discrete-time nonlinear systems' dynamics, without the requirement of the persistence of excitation. Two finite-time concurrent learning methods are presented to…
In this paper, we characterize the accessibility of discrete-time linear control systems on Lie groups. Using an exceptional notion of derivative, we construct a subalgebra $\mathfrak{h}$ based on the infinitesimal automorphism of the…
The paper studies the relation between a nonlinear time-varying flat discrete-time system and the corresponding linear time-varying systems which are obtained by a linearization along trajectories. It is motivated by the continuous-time…
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
In this article, we complement recent results on the convergence of the state estimate obtained by applying the discrete-time Kalman filter on a time-sampled continuous-time system. As the temporal discretization is refined, the estimate…
We consider the problem of estimating the state and unknown input for a large class of nonlinear systems subject to unknown exogenous inputs. The exogenous inputs themselves are modeled as being generated by a nonlinear system subject to…
This paper establishes problem-specific sample complexity lower bounds for linear system identification problems. The sample complexity is defined in the PAC framework: it corresponds to the time it takes to identify the system parameters…
In [1], it is established that a convergent observer with an infinite gain margin can be designed for a given nonlinear system when a Riemannian metric showing that the system is differentially detectable (i.e., the Lie derivative of the…
Motivated by studies on fully discrete numerical schemes for linear hyperbolic conservation laws, we present a framework on analyzing the strong stability of explicit Runge-Kutta (RK) time discretizations for semi-negative autonomous linear…