SearcharxivSearch

arXiv subjects

Chris Guiver

Publications and source records attributed to Chris Guiver.

8 recordsLinked to original sources

First Steps towards Categorical Algebraic Artificial Chemistry

We construct a functor that gives a dynamics to an algebraic model of interacting components. The construction generalises a computational model of Fontana and Buss in the field of artificial life known as AlChemy, in which molecules and their chemical interactions are emulated by lambda calculus terms and their application and subsequent reduction. We discuss future directions for the application of category theory to algebraic artificial chemistry as an organisational tool, with a focus on formalising the connection between the algebraic and the dynamical facets of such models.

cs.CE

Well-posedness of Lur'e systems with feedthrough

For a large class of Lur'e systems with time-varying nonlinearities and feedthrough we consider several well-posedness issues, namely: existence, continuation, blow-up in finite-time, forward completeness and uniqueness of solutions. Lur'e systems with feedthrough are systems of forced, nonlinear ordinary differential equations coupled with a nonlinear algebraic equation determining the output of the system. The presence of feedthrough means that the algebraic equation is implicit in the output, and, in general, the output may not be expressible by an analytic formula in terms of the state and the input. Simple examples illustrate that the well-posedness properties of such systems are not necessarily guaranteed by assumptions sufficient for the corresponding well-posedness properties of Lur'e systems without feedthrough. We provide sufficient conditions for the well-posedness properties mentioned above, using global inversion theorems from real analysis and tools from non-smooth analysis and differential inclusions. The theory is illustrated with examples.

math.OC

Passivity theorems for input-to-state stability of forced Lur'e inclusions and equations, and consequent entrainment-type properties

A suite of input-to-state stability results are presented for a class of forced differential inclusions, so-called Lur'e inclusions. As a consequence, semi-global incremental input-to-state stability results for systems of forced Lur'e differential equations are derived. The results are in the spirit of the passivity theorem from control theory as both the linear and nonlinear components of the Lur'e inclusion (or equation) are assumed to satisfy passivity-type conditions. These results provide a basis for the analysis of forced Lur'e differential equations subject to (almost) periodic forcing terms and, roughly speaking, ensure the existence and attractivity of (almost) periodic state- and output-responses, comprising another focus of the present work. One ultimate aim of the study is to provide a robust and rigorous theoretical foundation for a well-defined and tractable ``frequency response'' of forced Lur'e systems.

math.OC

Convex neural network synthesis for robustness in the 1-norm

With neural networks being used to control safety-critical systems, they increasingly have to be both accurate (in the sense of matching inputs to outputs) and robust. However, these two properties are often at odds with each other and a trade-off has to be navigated. To address this issue, this paper proposes a method to generate an approximation of a neural network which is certifiably more robust. Crucially, the method is fully convex and posed as a semi-definite programme. An application to robustifying model predictive control is used to demonstrate the results. The aim of this work is to introduce a method to navigate the neural network robustness/accuracy trade-off.

eess.SY

A linear dissipativity approach to incremental input-to-state stability for a class of positive Lur'e systems

Incremental stability properties are considered for certain systems of forced, nonlinear differential equations with a particular positivity structure. An incremental stability estimate is derived for pairs of input/state/output trajectories of the Lur'e systems under consideration, from which a number of consequences are obtained, including the incremental exponential input-to-state stability property and certain input-output stability concepts with linear gain. Incremental stability estimates provide a basis for an investigation into the response to convergent and (almost) periodic forcing terms, and is treated presently. Our results show that an incremental version of the real Aizerman conjecture is true for positive Lur'e systems when an incremental gain condition is imposed on the nonlinear term, as we describe. Our argumentation is underpinned by linear dissipativity theory -- a property of positive linear control systems.

eess.SY

Constrained optimal control of monotone systems with applications to battery fast-charging

Enabling fast charging for lithium ion batteries is critical to accelerating the green energy transition. As such, there has been significant interest in tailored fast-charging protocols computed from the solutions of constrained optimal control problems. Here, we derive necessity conditions for a fast charging protocol based upon monotone control systems theory.

math.OC

The mass-conversion method: a hybrid technique for simulating well-mixed chemical reaction networks

There exist several methods for simulating biological and physical systems as represented by chemical reaction networks. Systems with low numbers of particles are frequently modelled as discrete-state Markov jump processes and are typically simulated via a stochastic simulation algorithm (SSA). An SSA, while accurate, is often unsuitable for systems with large numbers of individuals, and can become prohibitively expensive with increasing reaction frequency. Large systems are often modelled deterministically using ordinary differential equations, sacrificing accuracy and stochasticity for computational efficiency and analytical tractability. In this paper, we present a novel hybrid technique for the accurate and efficient simulation of large chemical reaction networks. This technique, which we name the mass-conversion method, couples a discrete-state Markov jump process to a system of ordinary differential equations by simulating a reaction network using both techniques simultaneously. Individual molecules in the network are represented by exactly one regime at any given time, and may switch their governing regime depending on particle density. In this manner, we model high copy-number species using the cheaper continuum method and low copy-number species using the more expensive, discrete-state stochastic method to preserve the impact of stochastic fluctuations at low copy number. The motivation, as with similar methods, is to retain the advantages while mitigating the shortfalls of each method. We demonstrate the performance and accuracy of our method for several test problems that exhibit varying degrees of inter-connectivity and complexity by comparing averaged trajectories obtained from both our method and from exact stochastic simulation.

q-bio.QM

An equivalence framework for an age-structured multi-stage representation of the cell cycle

We develop theoretical equivalences between stochastic and deterministic models for populations of individual cells stratified by age. Specifically, we develop a hierarchical system of equations describing the full dynamics of an age-structured multi-stage Markov process for approximating cell cycle time distributions. We further demonstrate that the resulting mean behaviour is equivalent, over large timescales, to the classical McKendrick-von Foerster integro-partial differential equation. We conclude by extending this framework to a spatial context, facilitating the modelling of travelling wave phenomena and cell-mediated pattern formation. More generally, this methodology may be extended to myriad reaction-diffusion processes for which the age of individuals is relevant to the dynamics.

q-bio.PE