Related papers: Constructive reachability for linear control probl…
This paper studies reachability and null-controllability for difference inclusions involving convex processes. Such difference inclusions arise, for instance, in the study of linear discrete-time systems whose inputs and/or states are…
This paper studies the informativity problem for reachability and null-controllability of constrained systems. To be precise, we will focus on an unknown linear systems with convex conic constraints from which we measure data consisting of…
We introduce the concept of a control contraction metric, extending contraction analysis to constructive nonlinear control design. We derive sufficient conditions for exponential stabilizability of all trajectories of a nonlinear control…
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
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…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
We consider the problem of stochastic optimal control in the presence of an unknown disturbance. We characterize the disturbance via empirical characteristic functions, and employ a chance constrained approach. By exploiting properties of…
In this paper, we consider integral linear constraints and the dissipation inequality with linear supply rates for certain sets of trajectories confined pointwise in time to a convex cone which belongs to a finite-dimensional normed vector…
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…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
We consider the problem of synthesizing optimal linear feedback policies subject to arbitrary convex constraints on the feedback matrix. This is known to be a hard problem in the usual formulations ($\Htwo,\Hinf,\LQR$) and previous works…
We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…
We consider the internal control of linear parabolic equations through on-off shape controls, i.e., controls of the form $M(t)\chi_{\omega(t)}$ with $M(t) \geq 0$ and $\omega(t)$ with a prescribed maximal measure. We establish small-time…
We consider the problem of finite-horizon optimal control design under uncertainty for imperfectly observed discrete-time systems with convex costs and constraints. It is known that this problem can be cast as an infinite-dimensional convex…
An optimal control problem on finite-dimensional positive cones is stated. Under a critical assumption on the cone, the corresponding Bellman equation is satisfied by a linear function, which can be computed by convex optimization. A…
We consider optimal control problems involving two constraint sets: one comprised of linear ordinary differential equations with the initial and terminal states specified and the other defined by the control variables constrained by simple…
This paper studies system theoretic properties of the class of difference inclusions of convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly and strongly invariant cones, and a decomposition of…
We take a divide and conquer approach to design controllers for reachability problems given large-scale linear systems with polyhedral constraints on states, controls, and disturbances. Such systems are made of small subsystems with coupled…