相关论文: Minimal realizations of linear systems: The "short…

The purpose of this paper is to study the realization theory of quantum linear systems. It is shown that for a general quantum linear system its controllability and observability are equivalent and they can be checked by means of a simple…

We here characterize the minimality of realization of arbitrary linear time-invariant dynamical systems through (i) intersection of the spectra of the realization matrix and of the corresponding state submatrix and (ii) moving the poles by…

The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging…

We deal with finite dimensional linear and nonlinear control systems. If the system is linear and autonomous and satisfies the classical normality assumption, we improve the well known result on the strict convexity of the reachable set…

The paper presents realization theory of discrete-time linear switched systems. A discrete-time linear switched system is a hybrid system, such that the continuous sub-system associated with each discrete state is linear. In this paper we…

In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…

We introduce a minimization formulation for the determination of a finite-dimensional, time-dependent, orthonormal basis that captures directions of the phase space associated with transient instabilities. While these instabilities have…

Finding a positive state-space realization with the minimum dimension for a given transfer function is an open problem in control theory. In this paper, we focus on positive realizations in Markov form and propose a linear programming…

Through the Pontryagin maximum principle, we solve a minimal-time problem for a linear control system on a cylinder, considered as a homogeneous space of the solvable Lie group of dimension two. The main result explicitly shows the…

In this paper, we provide a novel characterization of the reachable set of discrete-time switched linear control systems and a Kalman-type criterion for controllability, assuming that the switching parameter can be used as a control…

This paper develops a systematic approach to realising linear detectors with an optimised sensitivity, allowing for the detection of extremely weak signals. First, general constraints are derived on a specific class of input-output transfer…

We deal with algorithmic techniques for minimal cost input-connectivity while maintaining controllability of linear systems. The input matrix is assumed to be constrained in the sense that the set of states that each input (if present) can…

We present a novel class of minimax optimal control problems with positive dynamics, linear objective function and homogeneous constraints. The proposed problem class can be analyzed with dynamic programming and an explicit solution to the…

In this paper, we address a collection of state space reachability problems, for linear time-invariant systems, using a minimal number of actuators. In particular, we design a zero-one diagonal input matrix B, with a minimal number of…

The paper presents partial-realization theory and realization algorithms for linear switched systems. Linear switched systems are a particular subclass of hybrid systems. We formulate a notion of a partial realization and we present…

An important open problem in the synthesis of passive controllers is to obtain a passive network that realizes an arbitrary given impedance function and contains the least possible number of elements. This problem has its origins in…

The first part of this paper is devoted to introducing an approach to compute the approximate minimum time function of control problems which is based on reachable set approximation and uses arithmetic operations for convex compact sets. In…

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…

This paper addresses two fundamental problems in the context of jump linear systems (JLS). The first problem is concerned with characterizing the minimal state space dimension solely from input-output pairs and without any knowledge of the…

This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…