Optimal control of networked reaction–diffusion systems

Abstract

Patterns in nature are fascinating both aesthetically and scientifically. Alan Turing’s celebrated reaction–diffusion model of pattern formation from the 1950s has been extended to an astounding diversity of applications: from cancer medicine, via nanoparticle fabrication, to computer architecture. Recently, several authors have studied pattern formation in underlying networks, but thus far, controlling a reaction–diffusion system in a network to obtain a particular pattern has remained elusive. We present a solution to this problem in the form of an analytical framework and numerical algorithm for optimal control of Turing patterns in networks. We demonstrate our method’s effectiveness and discuss factors that affect its performance. We also pave the way for multidisciplinary applications of our framework beyond reaction–diffusion models.