Optimal Control with Information Pattern Constraints

Despite the abundance of available literature that starts with the seminal paper of Wang and Davison almost forty years ago, when dealing with the problem of decentralized control for linear dynamical systems, one faces a surprising lack of general design methods, implementable via computationally tractable algorithms. This is mainly due to the fact that for decentralized control configurations, the classical control theoretical framework falls short in providing a systematic analysis of the stabilization problem, let alone cope with additional optimality criteria. Recently, a significant leap occurred through the theoretical machinery developed in Rotkowitz and Lall, IEEE-TAC, vol. 51, 2006, pp. 274-286 which unifies and consolidates many previous results, pinpoints certain tractable decentralized control structures, and outlines the most general known class of convex problems in decentralized control. The decentralized setting is modeled via the structured sparsity constraints paradigm, which proves to be a simple and effective way to formalize many decentralized configurations where the controller feature a given sparsity pattern. Rotkowitz and Lall propose a computationally tractable algorithm for the design of H2 optimal, decentralized controllers for linear and time invariant systems, provided that the plant is strongly stabilizable. The method is built on the assumption that the sparsity constraints imposed on the controller satisfy a certain condition (named quadratic invariance) with respect to the plant and that some decentralized, strongly stablizable, stabilizing controller is available beforehand. For this class of decentralized feedback configurations modeled via sparsity constraints, so called quadratically invariant, we provided complete solutions to several open problems. Firstly, the strong stabilizability assumption was removed via the so called coordinate free parametrization of all, sparsity constrained controllers. Next we have addressed the unsolved problem of stabilizability/stabilization via sparse controllers, using a particular form of the celebrated Youla parametrization. Finally, a new result related to the optimal disturbance attenuation problem in the presence of stable plant perturbations is presented. This result is also valid for quadratically invariant, decentralized feedback configurations. Each result provides a computational, numerically tractable algorithm which is meaningful in the synthesis of sparsity constrained optimal controllers

A Chain-Scattering Approach to LMI Multi-objective Control

International audienceThis paper revisits, from a chain-scattering perspective, the LMI solution based on Youla-Kucera parametrisation of the general multi-objective control problem. The conceptual and computational advantages of the chain-scattering formalism are demonstrated by allowing a more direct derivation of some known results as well as by hinting to some new research directions

Around Pelikan's conjecture on very odd sequences

Very odd sequences were introduced in 1973 by J. Pelikan who conjectured that there were none of length >=5. This conjecture was disproved by MacWilliams and Odlyzko in 1977 who proved there are in fact many very odd sequences. We give connections of these sequences with duadic codes, cyclic difference sets, levels (Stufen) of cyclotomic fields, and derive some new asymptotic results on their lengths and on S(n), which denotes the number of very odd sequences of length n.Comment: 21 pages, two tables. Revised version with improved presentation and correction of some typos and minor errors that will appear in Manuscripta Mathematic

Closed-Loop Identification of Stabilized Models Using Dual Input-Output Parameterization

This paper introduces a dual input-output parameterization (dual IOP) for the identification of linear time-invariant systems from closed-loop data. It draws inspiration from the recent input-output parameterization developed to synthesize a stabilizing controller. The controller is parameterized in terms of closed-loop transfer functions, from the external disturbances to the input and output of the system, constrained to lie in a given subspace. Analogously, the dual IOP method parameterizes the unknown plant with analogous closed-loop transfer functions, also referred to as dual parameters. In this case, these closed-loop transfer functions are constrained to lie in an affine subspace guaranteeing that the identified plant is \emph{stabilized} by the known controller. Compared with existing closed-loop identification techniques guaranteeing closed-loop stability, such as the dual Youla parameterization, the dual IOP neither requires a doubly-coprime factorization of the controller nor a nominal plant that is stabilized by the controller. The dual IOP does not depend on the order and the state-space realization of the controller either, as in the dual system-level parameterization. Simulation shows that the dual IOP outperforms the existing benchmark methods