Optimal co-designs of communication and control in bandwidth-constrained cyber-physical systems

作     者：Negi, Nandini Chakrabortty, Aranya 

作者机构：North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA 

出 版 物：《AUTOMATICA》 (自动学)

年 卷 期：2022年第142卷

核心收录：

学科分类：0711[理学-系统科学] 0808[工学-电气工程] 07[理学] 08[工学] 070105[理学-运筹学与控制论] 081101[工学-控制理论与控制工程] 0811[工学-控制科学与工程] 0701[理学-数学] 071101[理学-系统理论] 

主　　题：Linear optimal control Structural optimization Time-delay systems Delay analysis Bandwidth allocation 

摘      要：We address the problem of sparsity-promoting optimal control of cyber-physical systems (CPSs) in the presence of communication delays. The delays are categorized into two types - namely, an inter-layer delay for passing state and control information between the physical layer and the cyber layer, and an intra-layer delay that operates between the computing agents, referred to here as control nodes (CNs), within the cyber-layer. Our objective is to minimize the closed-loop H-2-norm of the physical system by co-designing an optimal combination of these two delays and a sparse state-feedback controller while respecting a given bandwidth cost constraint. We propose a two-loop optimization algorithm for this. Based on the alternating directions method of multipliers (ADMM), the inner loop handles the conflicting directions between the decreasing H-2-norm and the increasing sparsity level of the controller. The outer loop comprises a semidefinite program (SDP)-based relaxation of non-convex inequalities necessary for closed-loop stability. Moreover, for CPSs where the state and control information assigned to the CNs are not private, we derive an additional algorithm that further sparsifies the communication topology by modifying the row and column structures of the obtained controller, resulting in a reassignment of the communication map between the cyber and physical layers, and determining which physical agent should send its state information to which CN. Proofs for closed-loop stability and optimality are provided for both algorithms, followed by numerical simulations. (C) 2022 Elsevier Ltd. All rights reserved.