Submodularity in Dynamics and Control of Networked Systems

Abstract

Submodularity in Dynamics and Control of Networked Systems Andrew ClarkCo-Chairs of the Supervisory Committee:Radha Poovendran Electrical Engineering Linda Bushnell Electrical EngineeringControlling a networked dynamical system to reach a desired state is a fundamental challenge in applications including transportation, energy, social, and biological systems. One scalable approach to controlling such systems is to directly control the states of a subset of leader nodes, while relying on local interactions to steer the remaining nodes towards their desired states. The choice of leader nodes is known to affect system metrics including robustness to noise, rate of convergence to a desired state, and controllability of the system.Selecting an optimal subset of leader nodes, however, is inherently a combinatorial problem, making optimal leader node selection intractable in general.This thesis presents a submodular optimization framework to selecting leader nodes for control of networked systems. We investigate the problem of selecting a subset of leader nodes in order to minimize node state errors due to noise in the communication links between nodes. We prove that the error due to link noise is a supermodular function of the set of leader nodes, leading to the first polynomial-time algorithms for minimizing error due to link noise with provable optimality bounds. We develop our approach for networks with static topologies, as well as dynamic topologies due to random link failures, switching between predefined topologies, and arbitrary mobility.We study selecting leader nodes in order to minimize convergence error, defined as the error in the intermediate node states prior to reaching their desired values. We derive upper bounds for a class of convergence error metrics based on the hitting time of random walk on the network, which we prove to be a supermodular function of the set of input nodes.We present polynomial-time algorithms for minimizing convergence error with provable optimality bounds, for static as well as dynamic networks.Efficient algorithms have recently been proposed for selecting leader nodes to satisfy controllability, defined as the ability to drive the non-input nodes from any initial state to any desired state in finite time. These algorithms, however, do not incorporate performance criteria including robustness to noise and convergence rate. We study the problem of leader selection for joint performance and controllability, and prove that controllability can be formulated as a matroid constraint on the set of leader nodes. We propose efficient algorithms with provable optimality gap for selecting leader nodes for joint performance and controllability, and characterize the submodular structure of the largest controllable subgraph of a network.We also investigate selecting input nodes for guaranteeing synchronization in networked systems. Using the widely-studied Kuramoto model of nonlinear phase-coupled oscillators, we develop novel threshold-based conditions for a set of input nodes to ...

A Game-theoretic Framework for Security-aware Sensor Placement Problem in Networked Control Systems

“…Based on Theorem 1, the attacker-detector game is defined as follows: 4 Note that the action of the attacker is to choose matrix B and the value of the attack signal w(t) is not a decision variable.…”

“…Leader-follower systems have diverse applications from multi-agent formation control and vehicle platooning[8] to opinion dynamics in social networks[4].…”

Performance guarantees for greedy maximization of non-submodular controllability metrics

“…Examples include Kalman rank conditions [1]- [5], controllability and observability Gramians [6]- [12], and optimal and robust feedback control and estimation performance metrics [13]- [20]. Topology design problems have also been considered for specific classes of networks, including leader selection and communication network design [21], [22]. Various optimization methods have been proposed for topology design, including greedy algorithms [8], [9], [17], [18], [21], convex relaxation heuristics with sparsity inducing regularization [13]- [16], [23], and mixed-integer semidefinite programming methods [19], [20].…”

Distributed robust vehicle state estimation

“…However, the developed observer is required to be augmented with a module to address reliability of the estimation setup. The proposed module is inspired by the opinion dynamics model [16], [17]. A four-node network is considered, whose members are four corners of the vehicle with estimated states as their opinions, each having a confidence level based on the corresponding corner's slip condition.…”