System-level, Input-output and New Parameterizations of Stabilizing Controllers, and Their Numerical Computation

It is known that the set of internally stabilizing controller $\mathcal{C}_{\text{stab}}$ is non-convex, but it admits convex characterizations using certain closed-loop maps: a classical result is the {Youla parameterization}, and two recent notions are the {system-level parameterization} (SLP) and the {input-output parameterization} (IOP). In this paper, we address the existence of new convex parameterizations and discuss potential tradeoffs of each parametrization in different scenarios. Our main contributions are: 1) We first reveal that only four groups of stable closed-loop transfer matrices are equivalent to internal stability: one of them is used in the SLP, another one is used in the IOP, and the other two are new, leading to two new convex parameterizations of $\mathcal{C}_{\text{stab}}$. 2) We then investigate the properties of these parameterizations after imposing the finite impulse response (FIR) approximation, revealing that the IOP has the best ability of approximating $\mathcal{C}_{\text{stab}}$ given FIR constraints. 3) These four parameterizations require no \emph{a priori} doubly-coprime factorization of the plant, but impose a set of equality constraints. However, these equality constraints will never be satisfied exactly in numerical computation. We prove that the IOP is numerically robust for open-loop stable plants, in the sense that small mismatches in the equality constraints do not compromise the closed-loop stability. The SLP is known to enjoy numerical robustness in the state feedback case; here, we show that numerical robustness of the four-block SLP controller requires case-by-case analysis in the general output feedback case.Comment: 20 pages; 5 figures. Added extensions on numerial computation and robustness of closed-loop parameterization

Power network and smart grids analysis from a graph theoretic perspective

The growing size and complexity of power systems has given raise to the use of complex network theory in their modelling, analysis, and synthesis. Though most of the previous studies in this area have focused on distributed control through well established protocols like synchronization and consensus, recently, a few fundamental concepts from graph theory have also been applied, for example in symmetry-based cluster synchronization. Among the existing notions of graph theory, graph symmetry is the focus of this proposal. However, there are other development around some concepts from complex network theory such as graph clustering in the study. In spite of the widespread applications of symmetry concepts in many real world complex networks, one can rarely find an article exploiting the symmetry in power systems. In addition, no study has been conducted in analysing controllability and robustness for a power network employing graph symmetry. It has been verified that graph symmetry promotes robustness but impedes controllability. A largely absent work, even in other fields outside power systems, is the simultaneous investigation of the symmetry effect on controllability and robustness. The thesis can be divided into two section. The first section, including Chapters 2-3, establishes the major theoretical development around the applications of graph symmetry in power networks. A few important topics in power systems and smart grids such as controllability and robustness are addressed using the symmetry concept. These topics are directed toward solving specific problems in complex power networks. The controllability analysis will lead to new algorithms elaborating current controllability benchmarks such as the maximum matching and the minimum dominant set. The resulting algorithms will optimize the number of required driver nodes indicated as FACTS devices in power networks. The second topic, robustness, will be tackled by the symmetry analysis of the network to investigate three aspects of network robustness: robustness of controllability, disturbance decoupling, and fault tolerance against failure in a network element. In the second section, including Chapters 4-8, in addition to theoretical development, a few novel applications are proposed for the theoretical development proposed in both sections one and two. In Chapter 4, an application for the proposed approaches is introduced and developed. The placement of flexible AC transmission systems (FACTS) is investigated where the cybersecurity of the associated data exchange under the wide area power networks is also considered. A new notion of security, i.e. moderated-k-symmetry, is introduced to leverage on the symmetry characteristics of the network to obscure the network data from the adversary perspective. In chapters 5-8, the use of graph theory, and in particular, graph symmetry and centrality, are adapted for the complex network of charging stations. In Chapter 5, the placement and sizing of charging stations (CSs) of the network of electric vehicles are addressed by proposing a novel complex network model of the charging stations. The problems of placement and sizing are then reformulated in a control framework and the impact of symmetry on the number and locations of charging stations is also investigated. These results are developed in Chapters 6-7 to robust placement and sizing of charging stations for the Tesla network of Sydney where the problem of extending the capacity having a set of pre-existing CSs are addressed. The role of centrality in placement of CSs is investigated in Chapter 8. Finally, concluding remarks and future works are presented in Chapter 9

Safety-Critical Traffic Control by Connected Automated Vehicles

Connected automated vehicles (CAVs) have shown great potential in improving traffic throughput and stability. Although various longitudinal control strategies have been developed for CAVs to achieve string stability in mixed-autonomy traffic systems, the potential impact of these controllers on safety has not yet been fully addressed. This paper proposes safety-critical traffic control (STC) by CAVs -- a strategy that allows a CAV to stabilize the traffic behind it, while maintaining safety relative to both the preceding vehicle and the following connected human-driven vehicles (HDVs). Specifically, we utilize control barrier functions (CBFs) to impart collision-free behavior with formal safety guarantees to the closed-loop system. The safety of both the CAV and HDVs is incorporated into the framework through a quadratic program-based controller, that minimizes deviation from a nominal stabilizing traffic controller subject to CBF-based safety constraints. Considering that some state information of the following HDVs may be unavailable to the CAV, we employ state observer-based CBFs for STC. Finally, we conduct extensive numerical simulations -- that include vehicle trajectories from real data -- to demonstrate the efficacy of the proposed approach in achieving string stable and, at the same time, provably safe traffic

STABILITY AND PERFORMANCE OF NETWORKED CONTROL SYSTEMS

Network control systems (NCSs), as one of the most active research areas, are arousing comprehensive concerns along with the rapid development of network. This dissertation mainly discusses the stability and performance of NCSs into the following two parts. In the first part, a new approach is proposed to reduce the data transmitted in networked control systems (NCSs) via model reduction method. Up to our best knowledge, we are the first to propose this new approach in the scientific and engineering society. The "unimportant" information of system states vector is truncated by balanced truncation method (BTM) before sending to the networked controller via network based on the balance property of the remote controlled plant controllability and observability. Then, the exponential stability condition of the truncated NCSs is derived via linear matrix inequality (LMI) forms. This method of data truncation can usually reduce the time delay and further improve the performance of the NCSs. In addition, all the above results are extended to the switched NCSs. The second part presents a new robust sliding mode control (SMC) method for general uncertain time-varying delay stochastic systems with structural uncertainties and the Brownian noise (Wiener process). The key features of the proposed method are to apply singular value decomposition (SVD) to all structural uncertainties, to introduce adjustable parameters for control design along with the SMC method, and new Lyapunov-type functional. Then, a less-conservative condition for robust stability and a new robust controller for the general uncertain stochastic systems are derived via linear matrix inequality (LMI) forms. The system states are able to reach the SMC switching surface as guaranteed in probability 1 by the proposed control rule. Furthermore, the novel Lyapunov-type functional for the uncertain stochastic systems is used to design a new robust control for the general case where the derivative of time-varying delay can be any bounded value (e.g., greater than one). It is theoretically proved that the conservatism of the proposed method is less than the previous methods. All theoretical proofs are presented in the dissertation. The simulations validate the correctness of the theoretical results and have better performance than the existing results