Skip to main content
eScholarship
Open Access Publications from the University of California

UC Santa Barbara

UC Santa Barbara Electronic Theses and Dissertations bannerUC Santa Barbara

Control and Estimation in Network Systems

Abstract

Networks are ubiquitous in natural and engineered systems, from critical infrastructures (like power grids and water distribution systems) to contact networks in epidemiological models. Managing these systems requires a broad array of tools to monitor the configuration and state of the network, identify optimal operating points, and design controls. This thesis examines a collection of topics broadly related to this theme.

In Part 1, we consider problems related to control and optimization in network systems. Chapter 1 studies the problem of safety-critical control in networks of grid-forming inverters. Coupling a physically-meaningful Lyapunov-like function with an optimization approach to identifying forward-invariant sets, we propose a method to certify that a post-fault trajectory achieves frequency synchronization while respecting safety constraints. In Chapter 2, we consider the network resource allocation problem of optimally distributing resources to mitigate the spread of an epidemic. We propose a convex optimization framework for minimizing the basic reproduction number for general compartmental epidemiological models. Chapter 3 addresses optimal control in infinitesimally contracting systems. We provide new convergence criteria for a common indirect optimal control algorithm, and we establish the uniqueness of the optimal control in the limits of large contraction rates and short time horizons.

In Part 2, we use tools from statistical inference and machine learning to solve estimation problems in network systems. Chapter 4 examines the problem of inferring routing topologies from endpoint data in communication networks. Extending a technique called network tomography to use higher-order statistics, and using Mobius inversion to disentangle the interactions between different network paths that are reflected in these statistics, we are able to estimate routing matrices without the cooperation of intermediate routers. Finally, in Chapter 5, we use machine learning to predict edge flows. We propose an implicit neural network that incorporates two fundamental physical principles to estimate flows on unlabeled edges, and we provide a contraction mapping to evaluate the model and backpropagate loss gradients.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View