Serban Sabau

SY
3papers
17citations
Novelty45%
AI Score21

3 Papers

SYJun 17, 2018
Decoupled Dynamics Distributed Control for Strings of Nonlinear Autonomous Agents

Serban Sabau, Irinel-Constantin Morarescu, Lucian Busoniu et al.

We introduce a distributed control architecture for a class of heterogeneous, nonlinear dynamical agents moving in the "string" formation, while guaranteeing trajectory tracking, collision avoidance and the preservation of the formation's topology. Each autonomous agent uses information and relative measurements only with respect to its predecessor in the string. The performance of the scheme is independent of the number of agents in the network and also on the agent's relative position in the network. The scalability is a consequence of the "decoupling" of a certain bounded approximation of the closed--loop equations, which allows the regulation and controller design (at each agent) to be done individually, in a completely decentralized manner. A practical method for compensating communication induced delays is also presented. Numerical examples illustrate the effectiveness and the main features of the proposed approach.

SYSep 5, 2012
Stabilizability and Norm-Optimal Control Design subject to Sparsity Constraints

Serban Sabau, Nuno C. Martins

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 parametrization of all admissible stabilizing controllers provided that an initial admissible stable stabilizing controller is provided. This paper addresses the previously unsolved problem of determining necessary and sufficient conditions for the existence of an admissible stabilizing controller. The main idea is to cast the existence of such a controller as the feasibility of an exact model-matching problem with stability restrictions, which can be tackled using existing methods. Furthermore, we show that, when it exists, the solution of the model-matching problem can be used to compute an admissible stabilizing controller. This method also leads to a convex parametrization that may be viewed as an extension of Youla's classical approach so as to incorporate sparsity constraints. Applications of this parametrization on the design of norm-optimal controllers via convex methods are also explored. An illustrative example is provided, and a special case is discussed for which the exact model matching problem has a unique and easily computable solution.

SYOct 29, 2015
Optimal distributed control for platooning via sparse coprime factorizations

Serban Sabau, Cristian Oara, Sean Warnick et al.

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.