2015/03/09 by Sérgio Pequito, Pequito, Sergio, Soummya Kar +3
Computer Science · Engineering · #Advanced Control Systems Optimization #Distributed Control Multi-Agent Systems #FOS: Mathematics #Optimization and Control (math.OC) #Petri Nets in System Modeling #Stability and Control of Uncertain Systems
paper · pdf · doi:10.48550/arxiv.1503.02764
openalex publication_date 2015/03/09 · openalex created_date 2022/08/16 · openalex updated_date 2026/07/28
In this paper, we study the minimal cost constrained input-output (I/O) and\ncontrol configuration co-design problem. Given a linear time-invariant plant,\nwhere a collection of possible inputs and outputs is known a priori, we aim to\ndetermine the collection of inputs, outputs and communication among them\nincurring in the minimum cost, such that desired control performance, measured\nin terms of arbitrary pole-placement capability of the closed-loop system, is\nensured. We show that this problem is NP-hard in general (in the size of the\nstate space). However, the subclass of problems, in which the dynamic matrix is\nirreducible, is shown to be polynomially solvable and the corresponding\nalgorithm is presented. In addition, under the same assumption, the same\nalgorithm can be used to solve the minimal cost constrained I/O selection\nproblem, and the minimal cost control configuration selection problem,\nindividually. In order to illustrate the main results of this paper, some\nsimulations are also provided.\n