Data-Driven Pole Placement in LMI Regions with Robustness Constraints

TL;DR

This paper introduces a data-driven approach for robust pole placement within LMI regions, using system trajectory data to satisfy multiple robustness and performance criteria without knowing system matrices.

Contribution

It develops a novel data-driven methodology for pole placement in LMI regions that accounts for robustness constraints, bypassing the need for system matrices, and provides theoretical guarantees.

Findings

Successfully places poles within desired regions using only trajectory data.

Ensures robustness to uncertainties and performance specifications.

Validated with numerical simulations on a third-order system.

Abstract

This paper proposes a robust learning methodology to place the closed-loop poles in desired convex regions in the complex plane. We considered the system state and input matrices to be unknown and can only use the measurements of the system trajectories. The closed-loop pole placement problem in the linear matrix inequality (LMI) regions is considered a classic robust control problem; however, that requires knowledge about the state and input matrices of the linear system. We bring in ideas from the behavioral system theory and persistency of excitation condition-based fundamental lemma to develop a data-driven counterpart that satisfies multiple closed-loop robustness specifications, such as $\mathcal{D}$-stability and mixed $H_2/H_{\infty}$ performance specifications. Our formulations lead to data-driven semi-definite programs (SDPs) that are coupled with sufficient theoretical guarantees. We validate the theoretical results with numerical simulations on a third-order dynamic system.