Serban Sabau

Learn More
In this paper we deal with the problem of stabilizing linear, time–invariant plants using feedback control configurations that are subject to sparsity constraints. Recent results show that given a strongly stabilizable plant, the class of all stabilizing controllers that satisfy certain given sparsity constraints admits a convex representation via Zames’s(More)
Consider that a linear time-invariant (LTI) plant is given and that we wish to design a stabilizing controller for it. Admissible controllers are LTI and must comply with a pre-selected sparsity pattern. The sparsity pattern is assumed to be quadratically invariant (QI) with respect to the plant, which, from prior results, guarantees that there is a convex(More)
In this paper we deal with the problem of decentralized stabilization for linear and time-invariant plants in feedback control configurations that are subject to sparsity constraints. Recent theoretical advances in decentralized control have proved that the class of stabilizing controllers, satisfying a given sparsity constraint admits a convex(More)
We introduce a novel distributed control architecture for heterogeneous platoons of linear time–invariant autonomous vehicles. Our approach is based on a generalization of the concept of leader–follower controllers for which we provide a Youla–like parameterization, while the sparsity constraints are imposed on the controller’s left coprime factors,(More)
In this paper we study state–space realizations of Linear and Time–Invariant (LTI) systems. Motivated by biochemical reaction networks, Gonçalves and Warnick have recently introduced the notion of a Dynamical Structure Functions (DSF), a particular factorization of the system’s transfer function matrix that elucidates the interconnection structure in(More)
This paper addresses the design of controllers, subject to sparsity constraints, for linear and timeinvariant plants. Prior results have shown that a class of stabilizing controllers, satisfying a given sparsity constraint, admits a convex representation of the Youla–type, provided that the sparsity constraints imposed on the controller are quadratically(More)