Sparsity-promoting optimal control of cyber–physical systems over shared communication networks

Recent years have seen several new directions in the design of sparse control of cyber–physical systems (CPSs) driven by the objective of reducing communication costs. One common assumption made in these designs is that the communication happens over a dedicated network. For many practical applicati...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Automatica (Oxford) Ročník 122; s. 109217
Hlavní autori: Negi, Nandini, Chakrabortty, Aranya
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.12.2020
Predmet:
Bandwidth allocation
Delay analysis
Linear optimal control
Structural optimization
Time-delay systems
Time-delay systems
Delay analysis
Bandwidth allocation
Linear optimal control
Structural optimization
ISSN:0005-1098, 1873-2836
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Recent years have seen several new directions in the design of sparse control of cyber–physical systems (CPSs) driven by the objective of reducing communication costs. One common assumption made in these designs is that the communication happens over a dedicated network. For many practical applications, however, communication must occur over shared networks, leading to two critical design challenges, namely — time-delays in the feedback and fair sharing of bandwidth among users. In this paper, we present a set of sparse H2 control designs under these two design constraints. An essential aspect of our design is that the delay itself can be a function of sparsity, which leads to an interesting pattern of trade-offs in the H2 performance. We present three distinct algorithms. The first algorithm preconditions the assignable bandwidth to the network and produces an initial guess for a stabilizing controller. This is followed by our second algorithm, which sparsifies this controller while simultaneously adapting the feedback delay and optimizing the H2 performance using alternating directions method of multipliers (ADMM). The third algorithm extends this approach to a multiple user scenario where an optimal number of communication links, whose total sum is fixed, is distributed fairly among users by minimizing the variance of their H2 performances. The problem is cast as a difference-of-convex (DC) program with mixed-integer linear program (MILP) constraints. We provide theorems to prove the convergence of these algorithms, followed by validation through numerical simulations.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2020.109217