Elsevier

Automatica

Volume 146, December 2022, 110586
Automatica

Observability-blocking control using sparser and regional feedback for network synchronization processes

https://doi.org/10.1016/j.automatica.2022.110586Get rights and content

Abstract

The design of feedback control systems to block observability in a network synchronization model, i.e. to make the dynamics unobservable from measurements at a subset of the network’s nodes, is studied. First, a general design algorithm is presented for blocking observability at any group of m nodes, by applying state feedback controls at m+2 specified actuation nodes. The algorithm is based on a method for eigenstructure assignment, which allows surgical modification of particular eigenvectors to block observability while preserving the remaining open-loop eigenstructure. Next, a sparser design is obtained, which leverages low-cardinality vertex cutsets separating the actuation and measurement locations in the network’s graph to reduce the required number of actuation nodes for observability blocking. Also, the design is modified to encompass regional feedback controls, which only use data from accessible nodes. The regional feedback design does not maintain the open-loop eigenstructure, but can be guaranteed to preserve stability via a time-scale argument. The sparser and regional feedback designs are illustrated with numerical examples.

Introduction

The controllability and observability of dynamical network processes with actuation/measurement at a subset of network nodes has been extensively researched during the last few years (Dhal and Roy, 2015, Li et al., 2020, Liu et al., 2011, Pasqualetti et al., 2014, Rahmani et al., 2009, Roy et al., 2016, Summers et al., 2015, Summers and Lygeros, 2014, Sundaram and Hadjicostis, 2012, Wang et al., 2016). These studies have largely focused on the relationship between a network’s native topology and controllability/observability. A key further question of interest is whether control systems in a network can be designed to facilitate or block observability/controllability from particular network locations, while preserving overall performance. Such design problems often arise when multiple control authorities or stakeholders have access to the network’s dynamics, and have cross-cutting goals in modulating the dynamics (whether cooperative or competitive). For instance, given increasing concern about cyber-attacks in the power grid, there is interest in designing wide-area control systems that not only damp oscillations but prevent adversaries from estimating or manipulating the dynamics (Sridhar, Hahn, & Govindarasu, 2011). Likewise, control initiatives in the air transportation system potentially could be designed to improve or prevent estimation of flow dynamics (Liu, Kwon, Aljanabi, & Hwang, 2012), At a different scale, controller designs for multi-vehicle systems may need to consider security from intruders that can probe a subset of vehicles (Xue, Wang, & Roy, 2014). Based on this motivation, here we examine the problem of designing controls at a subset of a network’s nodes, to make the network’s dynamics unobservable from measurements at remote locations.

Specifically, we focus in this study on a linear network synchronization model (Ren and Beard, 2005, Xiao and Boyd, 2004, Xiao et al., 2007) which can be actuated at a sparse set of network nodes. Our goal is to determine whether regional state feedback controls applied at these nodes can be used to enforce unobservability to monitoring at a set of remote nodes, while maintaining dynamical properties of the network. We study the design of such observability-blocking controllers, by applying and enhancing eigenstructure assignment methods in tandem with graph-theoretic and linear-algebraic techniques. The main contributions of the study are as follows:

  • A general algorithm is obtained for designing state-feedback controllers which block observability at a set of measurement nodes through assignment of one or a few closed-loop eigenvectors (Algorithm 1). The algorithm is shown to yield control designs that block observability, while preserving the remaining open-loop eigenvectors and all the open-loop eigenvalues (Theorem 1, Theorem 2).

  • A topology-exploiting scheme is developed to block observability which requires fewer actuation nodes relative to the general algorithm (Theorem 3). Specifically, it is shown that the required number of actuators depends on the minimum cardinality among vertex cutsets (i.e. sets of vertices whose removal partitions the graph) separating actuation and measurement locations in the network’s graph.

  • The design scheme is further modified to accommodate regional feedback where only the states from a region or partition are used (Theorem 4). In this case, the observability-blocking control scheme modifies the eigenstructure of the open-loop system, but stability can still be guaranteed via a time-scale separation-based design (Theorem 5).

The developed methodology for observability-blocking controller design centrally draws on algebraic techniques for eigenstructure assignment, which originated in the classical works of Moore et al. (Klein and Moore, 1977, Moore, 1976) and others (Fahmy and O’reilly, 1983, Padula et al., 2021, Porter and D’azzo, 1978). These techniques have proved useful for a number of control applications, include e.g. aircraft control and malicious control of the power grid (DeMarco et al., 1996, Nieto-Wire and Sobel, 2014). Motivated by applications requiring only targeted eigenstructure assignment, we have recently adapted the classical eigenstructure assignment method for surgical eigenstructure assignment – i.e. placement of all eigenvalues and a subset of eigenvectors – subject to conditions only on the dictated eigenvectors (Al Maruf and Roy, 2021a, Maruf and Roy, 2020) (see also Lu, Chiang, and Thorp (1991)). The design algorithms presented here use and enhance the eigenstructure assignment methods introduced in Klein and Moore, 1977, Maruf and Roy, 2020, Moore, 1976.

The research described here also connects to a wide literature on controller design for built network processes, i.e. ones which have fixed topological interactions with sparse actuation and measurement capabilities, such as oscillation-damping in the power grid (Trudnowski, Smith, Short, & Pierre, 1991) and pinning control of synchronization processes (Yu, Chen, Lu, & Kurths, 2013). However, while this literature is mainly focused on modal properties of linearized networks models, our focus here is in shaping external or channel properties. Very recently, there has been a growing interest in shaping the input–output dynamics of networks (Besselink and Knorn, 2018, Li et al., 2020, Paridari et al., 2017, Roy et al., 2016, Stüdli et al., 2017); the research described here contributes to this effort.

The paper is organized as follows. The observability-blocking controller design problem is formulated in Section 2. In Section 3, the eigenstructure assignment methods which form the basis for our approach are briefly reviewed. The general algorithm for designing observability-blocking controllers is presented in Section 4, with graph-exploiting sparser and regional feedback methods developed in Sections 5 Sparser observability blocking using network graph cutsets, 6 Observability blocking using regional state feedback respectively. A brief conclusion is given in Section 7. Examples are presented throughout to illustrate the formal results. Proofs are relegated to an appendix to simplify the presentation. Some preliminary results related to observability-blocking control were presented in the conference paper Al Maruf and Roy (2019). Relative to Al Maruf and Roy (2019), the design algorithms are now presented in generality (e.g., encompassing the repeated eigenvalue case, general graph structures, etc.), an error in the general algorithm is corrected, the regional feedback design is developed, new examples are included, and the motivation for the work has been substantially updated. We also note that the dual problem of blocking controllability has been considered in the conference paper Al Maruf (2021b), however entirely different algorithms are obtained in this case.

Section snippets

Problem formulation

We consider a standard model for network synchronization (Ren and Beard, 2005, Xiao and Boyd, 2004, Xiao et al., 2007), which has been enhanced to represent: (1) actuation nodes where feedback controls can be applied by a system operator, and (2) measurements or outputs available to a stakeholder (e.g. an adversary).

Formally, a network model with n subsystems or nodes labeled 1,,n is considered; each node has a scalar state xi which evolves in continuous time. The interactions among the nodes

Preliminaries

Results on surgical and full eigenstructure assignment (Maruf and Roy, 2020, Moore, 1976), which are foundational to our design approach, are summarized in a single proposition here. To present these results, let us consider the closed-loop dynamics of a generic controllable linear system with an applied state feedback controller: ẋ̲=(A̲+B̲F̲)x̲ where x̲Rn, A̲Rn×n, B̲Rn×q and F̲Rq×n denote the state, open-loop state matrix, input matrix and gain matrix, respectively. Then, for any given

General design of observability-blocking controllers

We develop an algorithm for designing a state-feedback controller which makes the pair (C,(L+BF)) unobservable, while preserving much of the open-loop eigenstructure. The design is based on the eigenstructure assignment method reviewed above. To allow for a clear presentation, we first develop the algorithm for the case where open-loop eigenvalues are distinct, and then extend the algorithm to encompass the more general setting where eigenvalues can be repeated.

For the case with distinct

Sparser observability blocking using network graph cutsets

In this section, we demonstrate that observability blocking can sometimes be achieved using a sparser set of actuation nodes compared to the general case above, by exploiting the network’s graph topology. The genesis of this sparser design is that blocking observability at the nodes associated with a cutset of the network graph using actuation in one partition can serve to block observability at all nodes associated with the other partition. We formalize this notion first, and then explore

Observability blocking using regional state feedback

The need for observability blocking often arise in networks with independent or adversarial control authorities, which may not have access to the full network state. Here, we consider the alternative that control authorities only can access states in a region of the network. For this case, we demonstrate that observability can be blocked at measurement nodes outside that accessible region, by blocking observability at nodes associated with a vertex-cutset at the region’s boundary. A general

Conclusions and future work

A suite of algorithms for designing observability-blocking controllers in dynamical networks have been developed. These design algorithms may be especially valuable for applications where security and privacy needs are paramount, since they can allow operators to keep adversaries and other stakeholders from having full visibility of the dynamics. From a methodological standpoint, our study begins to address design in networks with multiple orthogonal control authorities, by showing how one

Abdullah Al Maruf received his B.Sc. degree in Electrical and Electronic Engineering from Bangladesh University of Engineering and Technology (BUET) in 2014. He has completed his Ph.D. from Washington State University, Pullman in December 2021 and is currently a postdoc in Electrical and Computer Engineering department of University of Washington, Seattle. His research interests include control and resilient design of dynamical networks and cyber–physical systems.

References (47)

  • Al MarufA. et al.

    Observability-blocking controllers for network synchronization processes

  • Al MarufA. et al.

    Almost-surgical eigenstructure assignment for linear time invariant systems using state feedback

  • Al MarufS.

    Using feedback to block controllability at remote nodes in network synchronization processes

  • BerryA. et al.

    Generating all the minimal separators of a graph

    International Journal of Foundations of Computer Science

    (2000)
  • BesselinkB. et al.

    Scalable input-to-state stability for performance analysis of large-scale networks

    IEEE Control Systems Letters

    (2018)
  • ChapmanA.

    Strong structural controllability of networked dynamics

  • ChartrandG. et al.

    A first course in graph theory

    (2013)
  • Del GenioC.I. et al.

    All scale-free networks are sparse

    Physical Review Letters

    (2011)
  • DeMarcoC.L. et al.

    The potential for malicious control in a competitive power systems environment

  • DhalR. et al.

    Vulnerability of network synchronization processes: A minimum energy perspective

    IEEE Transactions on Automatic Control

    (2015)
  • DuanG.-R.

    Eigenstructure assignment by decentralized output feedback-a complete parametric approach

    IEEE Transactions on Automatic Control

    (1994)
  • FahmyM. et al.

    Eigenstructure assignment in linear multivariable systems–a parametric solution

    IEEE Transactions on Automatic Control

    (1983)
  • KautskyJ. et al.

    Robust pole assignment in linear state feedback

    International Journal of Control

    (1985)
  • Cited by (0)

    Abdullah Al Maruf received his B.Sc. degree in Electrical and Electronic Engineering from Bangladesh University of Engineering and Technology (BUET) in 2014. He has completed his Ph.D. from Washington State University, Pullman in December 2021 and is currently a postdoc in Electrical and Computer Engineering department of University of Washington, Seattle. His research interests include control and resilient design of dynamical networks and cyber–physical systems.

    Sandip Roy received his B.S. in Electrical Engineering from University of Illinois at Urbana-Champaign (1998), and M.S. and Ph.D. in Electrical Engineering from Massachusetts Institute of Technology (2000, 2003). He is a Professor in School of Electrical Engineering and Computer Science at Washington State University. He is currently serving as a Program Director at the United States National Science Foundation, and also holds affiliations with the Pacific Northwest National Laboratory and the School of Global Animal Health at Washington State University. His research is focused on control and management of complex dynamical networks.

    The authors gratefully acknowledge the support of the United States National Science Foundation under grants CNS-1545104 and CMMI-1635184. The material in this paper was partially presented at the 2019 American Control Conference (ACC), July 10–12, 2019, Philadelphia, PA, USA. This paper was recommended for publication in revised form by Associate Editor Nima Monshizadeh under the direction of Editor Christos G. Cassandras.

    View full text