arrow
Return

Sparse optimization of H2 controllers for LTI Systems: A log-barrier Method

delete2025-03-01
delete0
PRE
AI
N
Nachuan Yang
J
Jiawei Tang
Y
Yuzhe Li *
L
Ling Shi
DOI:10.1016/j.automatica.2024.112102delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper studies the sparse optimization of H2 controllers for linear time-invariant systems. Due to the emergence of large-scale networked control systems in the past decades, the sparsity of a controller usually determines the communication and computation efficiency for implementation. However, the sparse design of optimal controllers has been a difficult problem because of its nonconvexity and nonsmoothness. In this paper, we consider the sparse design of controllers subject to the constraint on H2 performance, which can be used to describe the robustness margin fora control system. Unlike the sparsity promoting control which enhances the controller's sparsity by regularization, we study the constrained sparse optimization directly. Moreover, we propose an interior point method using log-barrier functions and develop an alternating direction method of multipliers (ADMM) algorithm for computation. Besides, we also characterize the first-order optimality conditions for optimal sparse controllers and show that the accumulation point of our algorithm will be a Karush-Kuhn-Tucker (KKT) point of the original problem, which is the highest pursuit in nonconvex optimization problems. Finally, we provide several simulations on a 40-dimensional mass-spring system to illustrate the effectiveness of our proposed results. (c) 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Keywords:
H2 performance
Optimal control
Sparsity

Journal

Automatica cover
Automatica
IF:
5.9
Papers:
1.2W
Citations:
5.2W

Organization

H
Hong Kong University of Science and Technology
Scholars:
2.0K
Papers: 1.2K
Citations: 3.9W
N
Northeastern Univ
Scholars:
2.9K
Papers: 1.3K
Citations: 362