Search arXivSearch

arXiv · 1908.09471

Predicting Network Controllability Robustness: A Convolutional Neural Network Approach

Abstract

Network controllability measures how well a networked system can be controlled to a target state, and its robustness reflects how well the system can maintain the controllability against malicious attacks by means of node-removals or edge-removals. The measure of network controllability is quantified by the number of external control inputs needed to recover or to retain the controllability after the occurrence of an unexpected attack. The measure of the network controllability robustness, on the other hand, is quantified by a sequence of values that record the remaining controllability of the network after a sequence of attacks. Traditionally, the controllability robustness is determined by attack simulations, which is computationally time consuming. In this paper, a method to predict the controllability robustness based on machine learning using a convolutional neural network is proposed, motivated by the observations that 1) there is no clear correlation between the topological features and the controllability robustness of a general network, 2) the adjacency matrix of a network can be regarded as a gray-scale image, and 3) the convolutional neural network technique has proved successful in image processing without human intervention. Under the new framework, a fairly large number of training data generated by simulations are used to train a convolutional neural network for predicting the controllability robustness according to the input network-adjacency matrices, without performing conventional attack simulations. Extensive experimental studies were carried out, which demonstrate that the proposed framework for predicting controllability robustness of different network configurations is accurate and reliable with very low overheads.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Lou, Yaodong He, Lin Wang, Guanrong Chen. 2020-09-14. Predicting Network Controllability Robustness: A Convolutional Neural Network Approach. https://doi.org/10.1109/tcyb.2020.3013251

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY