SearcharxivSearch

arXiv subjects

Cristian Oara

Publications and source records attributed to Cristian Oara.

3 recordsLinked to original sources

Optimal distributed control for platooning via sparse coprime factorizations

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 {\em leader--follower} controllers for which we provide a Youla--like parameterization while the sparsity constraints are imposed on the controller's left coprime factors, outlying a new concept of structural constraints in distributed control. The proposed scheme is amenable to optimal controller design via norm based costs, it guarantees string stability and eliminates the accordion effect from the behavior of the platoon. We also introduce a synchronization mechanism for the exact compensation of the time delays induced by the wireless broadcasting of information.

eess.SY

H-infinity control problem for general discrete-time systems

The paper considers the suboptimal H-infinity control problem for a general discrete-time system (whose transfer function matrix is allowed to be improper or polynomial). The parametrization of output feedback controllers is given in a realization-based setting, involves two generalized algebraic Riccati equations, and features the same elegant simplicity of the standard (proper) case. A relevant real-life numerical example proves the effectiveness of our approach.

math.OC

A Novel Description of Linear Time--Invariant Networks via Structured Coprime Factorizations

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 {\em Dynamical Structure Functions} (DSF), a particular factorization of the system's transfer function matrix that elucidates the interconnection structure in dependencies between manifest variables. We build onto this work by showing an intrinsic connection between a DSF and certain sparse left coprime factorizations. By establishing this link, we provide an interesting systems theoretic interpretation of sparsity patterns of coprime factors. In particular we show how the sparsity of these coprime factors allows for a given LTI system to be implemented as a network of LTI sub-systems. We examine possible applications in distributed control such as the design of a LTI controller that can be implemented over a network with a pre-specified topology.

math.OC