NWNicholas J. Watkins

Nicholas J. Watkins

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nicholas J. Watkins has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Robust Economic Model Predictive Control of Continuous-Time Epidemic Processes

    by Nicholas J. Watkins, Cameron Nowzari, George J. Pappas

    We develop a robust economic model predictive controller for the containment of stochastic Susceptible-Exposed-Infected-Vigilant (SEIV) epidemic processes which drives the process to extinction quickly, while minimizing the rate at which control resources are used. The work is significant in that it addresses the problem of efficiently controlling epidemic systems without relying on mean-field approximation, which is an important issue in the theory of stochastic epidemic processes. This enables us to provide rigorous convergence guarantees on the stochastic epidemic model itself, improving over the mean-field type convergence results of most prior work. There are two primary technical difficulties addressed in this treatment: (i) constructing a means of tractably approximating the evolution of the process, so that the designed approximation is robust to the modeling error introduced by the applied moment closure, and (ii) guaranteeing that the designed controller causes the closed-loop system to drive the process to extinction quickly. As an application, we use the developed framework for optimizing the use of quarantines in containing an outbreak.


  • Control of Generalized Discrete-Time SIS Epidemics via Submodular Function Minimization

    by Nicholas J. Watkins, George J. Pappas

    In this paper, we study a novel control method for a generalized SIS epidemic process. In particular, we use predictive control to design optimal protective resource distribution strategies which balance the need to eliminate the epidemic quickly against the need to limit the rate at which protective resources are used. We expect that such a controller may be useful in mitigating the spread of biological diseases which do not confer immunity to those who have been infected previously, with sexually transmitted infections being a prominent example of such. Technically, this paper provides a novel contribution in demonstrating that the particular combinatorial optimal control problem used to design resource allocations has an objective function which is submodular, and so can be solved in polynomial time despite its combinatorial nature. We test the performance of the proposed controller with numerical simulations, and provide some comments on directions for future work.


  • Battery management for control systems with energy harvesting sensors

    by Nicholas J. Watkins, Konstantinos Gatsis, Cameron Nowzari, George J. Pappas

    In this paper, we study the problem of computing the minimum battery capacity required to stabilize a scalar plant communicating with an energy harvesting sensor over a wireless communication channel. We prove that a particular greedy battery management policy suffices to stabilize the plant, and demonstrate that stability of the system under the greedy policy can be checked by a linear program. Moreover, we show that a critical battery capacity exists, below which no policy can stabilize the system, which itself can be computed by solving a sequence of linear programs which grows logarithmically with respect to the maximum allowed storage capacity. The first of these results address an open question pertaining to the stability of energy harvesting control systems. The last allows us to efficiently compute the smallest battery capacity required to stabilize a given system, which addresses a problem of importance when device size or cost are significant concerns.


  • Optimal Resource Allocation for Competitive Spreading Processes on Bilayer Networks

    by Nicholas J. Watkins, Cameron Nowzari, Victor M. Preciado, George J. Pappas

    We consider a competitive epidemic process in a bilayer network, and develop a framework to find an optimal allocation of control resources to eliminate one of the epidemics. We consider the SI 1 SI 2 S model, a recent generalization of the popular SIS model to the case of two competitive epidemics. We start our analysis by extending the standard SI 1 SI 2 S formulation with homogeneous parameters to a heterogeneous setting with edge-dependent infection rates, and node-dependent recovery rates. We then find necessary and sufficient conditions under which the mean-field approximation of a chosen epidemic process stabilizes to extinction exponentially quickly. Leveraging this result, we develop a framework for the solution of two optimization problems. In the first, we find an optimal allocation of control resources in order to eradicate the chosen epidemic at a minimum cost. In the second, we are given a fixed budget and propose a method which provably attains the extinction condition when sufficient capital is available, and otherwise mitigates the spread of the unwanted epidemic as much as possible. We explore the efficacy of our methods through extensive simulation.


  • Optimal resource allocation for competing epidemics over arbitrary networks

    by Nicholas J. Watkins, Cameron Nowzari, Victor M. Preciado, George J. Pappas

    This paper studies an SI1SI2S spreading model of two competing behaviors over a bilayer network. In particular, we address the problem of determining resource allocation strategies that ensure the extinction of one behavior while not necessarily ensuring the extinction of the other, and pose a marketing problem in which such a model can be of use. Our discussion begins by extending the SI1SI2S model to node-dependent infection and recovery parameters and generalized graph topologies, contrasting prior work. We then find conditions under which a chosen epidemic becomes extinct. We show that a distribution of resources which realizes this goal always exists for some budget under mild assumptions. We address the case in which the available budget is not sufficient for extinction by establishing analytic means for mitigating the spreading rate of the unwanted behavior. We demonstrate a method for tractably computing solutions to each problem via geometric programming. Our results are validated through simulation.