Figures
Abstract
We present a detailed set-based analysis of the well-known SIR and SEIR epidemic models subjected to hard caps on the proportion of infective individuals, and bounds on the allowable intervention strategies, such as social distancing, quarantining and vaccination. We describe the admissible and maximal robust positively invariant (MRPI) sets of these two models via the theory of barriers. We show how the sets may be used in the management of epidemics, for both perfect and imperfect/uncertain models, detailing how intervention strategies may be specified such that the hard infection cap is never breached, regardless of the basic reproduction number. The results are clarified with detailed examples.
Citation: Esterhuizen W, Lévine J, Streif S (2021) Epidemic management with admissible and robust invariant sets. PLoS ONE 16(9): e0257598. https://doi.org/10.1371/journal.pone.0257598
Editor: Ivan Kryven, Utrecht University, NETHERLANDS
Received: March 1, 2021; Accepted: September 6, 2021; Published: September 24, 2021
Copyright: © 2021 Esterhuizen et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the manuscript.
Funding: This work was partially funded by the German Federal Ministry of Education and Research (BMBF; grants 05M18OCA: "Verbundprojekt 05M2018 - KONSENS: Konsistente Optimierung und Stabilisierung elektrischer Netzwerksysteme") awarded to SS. No additional external funding was received for this study.
Competing interests: The authors have declared that no competing interests exist.
1 Introduction
There is a large literature on the application of optimal control to epidemiology. Some of the earliest papers on the topic are [1], which investigates the optimal control of a disease of SIS type (susceptible-infective-susceptible), and [2], which considers an SIR (susceptible-infective-removed) model with vaccination to obtain optimal vaccination policies via dynamic programming. Other papers consider the optimal control of SIR models, [3–6]; of HIV [7, 8]; and of malaria [9]. This list is by no means exhaustive, and we point the reader to the survey paper, [10]. Moreover, scores of papers have recently appeared involving the modelling and control of COVID-19, often via model-predictive control (MPC), see for example [11–15] and the thorough discussion of [16].
In this paper we build on the recent work concerning the application of set-based methods to epidemiology. We present a set-based analysis of two well-known compartmental epidemic models: the SIR and SEIR models, see for example [17, 18], subjected to constraints on their inputs (social distancing, quarantine rate and/or vaccination rate) and state (a hard cap on the proportion of infectives), utilising the theory of barriers, [19, 20]. These models often serve as good initial candidates to model new diseases, later being elaborated on to be more accurate.
It has only recently been shown that set-based methods may be used to maintain hard infection caps in epidemic models. To our knowledge, the paper [21] introduced the idea, describing the so-called viability kernel the set of all states for which there exists an input such that the state and input constraints are satisfied for all future time, [22], of a two-dimensional model of a vector-borne disease. The work was then extended in [23] where the effects of modelling uncertainties of this system were investigated via the robust viability kernel. The recent paper [24] finds the viability kernel for an SIR model of a vector bourne disease by approximating the value function of an appropriate optimal control problem by solving the related Hamilton-Jacobi-Bellmann (HJB) equation.
In our previous research, [25], we showed that the theory of barriers may be utilised to describe the viability kernel (also known as the admissible set) as well as the maximal robust positively invariant set (MRPI) the set of states in which the state and input constraints are satisfied for all time regardless of the input of the malaria model considered in [21]. The theory of barriers describes the non-trivial part of these sets’ boundaries, made of integral curves of the system that satisfy a minimum-/maximum-like principle, allowing them to easily be constructed. This contrasts with other approaches that estimate the viability kernel with algorithms that iteratively compute reachable sets, [26, Ch. 5], with interval analysis, [27], through the solution of HJB equations, [28], or via polynomial optimisation, [29], all of which suffer from the curse of dimensionality. Moreover, optimal control problems with hard state constraints (such as a hard cap on the number of infectives) are notoriously difficult to solve due to the presence of “active arcs”, “jump conditions” and adjoint dynamics that are often difficult to specify. The construction of the sets via the theory of barriers does not suffer from these difficulties because the state constraints do not directly appear in their construction.
Other research that contributes to epidemiology with set-based ideas includes the paper [30], which describes the set of sustainable thresholds (in some sense the dual of the viability kernel) for the class of so-called cooperative epidemic models. An attractive aspect of this approach is that competing costs (for example, number of infective individuals versus the disease containment costs) may be analysed via Pareto efficiency. The work in [31, 32] is closely related to set-based methods, but differs in that they do not describe or compute sets. Rather, these works combine Lyapunov-like functions with ideas from Viability theory (the so-called “regulation map”) to specify continuous selections of set-valued maps that describe the elimination of a disease.
The set-based approach to the management of epidemics, as presented in [21, 23, 25], argues that intervention strategies (for example, the level of fumigation in the control of mosquito-borne diseases) should be chosen based on the location of the state with respect to the computed sets: If the state is located in the admissible set, then it is possible to maintain the infection cap for all time with a suitably chosen input (intervention strategy). If the state is located in the MRPI, then the cap will never be breached and any input may be used, such as, e.g., saving resources or minimising economic damage.
In the current paper we analyse these sets for the constrained SIR and SEIR models under two cases: a perfect model case and an imperfect model case. For the perfect model case the modelling parameters are assumed to be perfectly known and the intervention strategy may be chosen depending on the location of the state, as was described earlier. For the imperfect model case we assume that there is a pre-designed intervention strategy, possibly a feedback, that has been designed and implemented on the system. For this case we only describe the MRPI, which corresponds to states from which the infection cap can always be maintained by the intervention strategy regardless of the modelling uncertainty. This latter aspect could be very valuable to epidemiologists because the parameters appearing in epidemic models sometimes cannot be accurately estimated (see e.g. [16]).
The contributions of the paper are as follows:
- To our knowledge, this is the first paper that deals with the problem of maintaining a hard infection cap for the SIR and SEIR epidemic models (under the assumption of both perfect and imperfect modelling), via a set-theoretic approach: the theory of barriers, [19, 20].
- With the theory of barriers we are not only able to decrease the dimension in the computation of the sets, but also able to obtain easily checkable inequalities of the systems’ parameters that allow one to classify the two sets, for the considered models, into trivial or nontrivial ones.
- We demonstrate that the MRPI, whose use in epidemics was introduced in our previous research [25], is also useful as a tool to maintain an infection cap for uncertain epidemic models.
- A note-worthy observation made in the paper regards the basic reproduction number,
. In epidemiology intervention strategies are often designed so that
is less than one, which guarantees that the disease will eventually die out. We demonstrate that using the computed sets the infection cap can be maintained regardless of the value of
, even if it is greater than one.
The paper is organised as follows. We present the SIR and SEIR models we will study in Section 2, along with precise formulations of the three problems we will address in the paper. We summarise the relevant results from the theory of barriers in Section 3, which we apply to describe the sets for the two epidemic models in Sections 4, 5 and 6. In Section 7 we present conditions involving the system parameters that allow one to easily determine whether the sets are trivial or not. Detailed examples are presented in Section 8 and the paper is concluded with a discussion in Section 9.
2 Two epidemic models
In this section we describe the two well-known epidemic models on which the paper will focus: the SIR and SEIR models.
2.1 SIR model
The (normalised) SIR model, see for example [17, Ch. 2] and [18], is described by the following ordinary differential equations:
(1)
(2)
(3)
with t ∈ [t0, ∞[ denoting time, measured in days. The state variable S(t) ∈ [0, 1] denotes the proportion of individuals at time t that are susceptible to the disease; I(t) ∈ [0, 1] denotes the proportion that are infected with the disease and are infective (that is, can infect susceptibles); and R(t) ∈ [0, 1] denotes the proportion that have been infected and removed, in the sense that they cannot re-infect susceptibles. “Removal” may encapsulate recovery and immunisation from the disease, death from the disease, quarantine measures, vaccination, etc.
We assume that the birth and death rates are zero. In other words, we assume that the disease is relatively short-lived such that the effects of demographic change can be ignored. Therefore, assuming an initial state satisfying S(t0) + I(t0) + R(t0) = 1, all integral curves of the system remain in the set:
(4)
for all t ≥ t0. Let
denote the constant population size, and let
,
and
denote the number of susceptibles, infectives and recovered individuals, respectively. Let
, the contact rate, denote the average number of contacts a person makes per unit time that is sufficient for disease transmission (this contact can be with infectives and/or other susceptibles). Then βI is the average number of contacts with infectives a susceptible makes per unit time, and βIs is the number of new infectives per unit time. Thus, βIS is the proportion of new infectives per unit time. It is assumed that recoveries occur according to a Poisson process with arrival rate
. See [17, Ch. 2], [18] and [13] for a more in-depth discussion of this model’s derivation.
In conclusion, β may be interpreted as the average number of people a member of the population comes into contact with over one day, and is the average number of days an infective individual remains infective.
2.2 SEIR model
This model is described by the following ODEs:
(5)
(6)
(7)
(8) t ∈ [t0, ∞[, with the additional compartment E(t) ∈ [0, 1] denoting exposed individuals. This is a general model for diseases where individuals only become infective after a non-negligible period of time from exposure. It is assumed that an individual’s evolution from being exposed to being infective follows a Poisson process with arrival rate
. Thus,
is the average number of days it takes an exposed individual to become infective.
As before, we assume that the total population remains constant and that the SEIR model is normalised. Thus, all solutions remain in the (redefined) set
(9)
for all t ∈ [t0, ∞[.
2.3 On set-based methods applied to epidemiology
Now we present an introductory overview of how we intend to apply set-based methods to the management of epidemics. The subsequent sections will present rigorous treatment of the ideas.
Consider the SIR model, (1)–(3), and impose a hard infection cap, I(t) ≤ Imax, for all time. Moreover, assume that the contact rate, β, may be changed over time within some bounds, representing social distancing measures. That is, assume β(t)∈[βmin, βmax], 0 < βmin ≤ βmax where βmin is the minimal contact rate (and thus represents the maximal social distancing) and βmax is the maximal or nominal contact rate (and may thus represent minimal social distancing).
Consider the SEIR model, (5)–(8), and also impose a hard infection cap, I(t) ≤ Imax, for all time. Assume that in addition to the contact rate, β, the parameter γ may also be changed over time within some bounds, i.e., γ(t) ∈ [γmin, γmax], 0 < γmin ≤ γmax. This may represent quarantine or vaccination measures.
The first problem we want to address is the following:
Problem 1. For the SIR model, supposing the parameter γ is perfectly known (SIR prefect model), how should the contact rate β(t), be specified over time such that the infection cap, Imax, is never breached? For the SEIR model, supposing the parameter η is perfectly known (SEIR prefect model), how should the contact rate β(t) and the removal rate γ(t) be specified over time such that the infection cap is never breached?
Our approach to solving this problem will be to find the admissible set, , which, for the SIR model, will correspond to all states from which there exists an input β satisfying β(t)∈[βmin, βmax] for all t ∈ [t0, ∞[ and such that the infection cap, Imax, is never breached. For the SEIR model,
will correspond to all states for which inputs β(t) ∈ [βmin, βmax] and γ(t) ∈ [γmin, γmax] exist such that the infection cap is never breached. Then the contact rate β, as well as the removal rate γ for the SEIR model, will be deduced depending on the location of the state with respect to the computed sets. Moreover, the complement of the admissible set,
, is the set of states for which the infection cap cannot be maintained, regardless of the interventions. Thus, from this set the problem has no solution and if the state is located here, either the infection cap needs to be relaxed, or the maximal allowable social distancing measures (βmin), and/or maximal quarantine rate for the SEIR model (γmax), need to be strengthened.
The set is obtained by constructing its boundary, which will be seen to be made of two parts, the usable part, a subset included in the boundary of the state constraints, and the barrier, entirely contained in the interior of the state constraint set (see the general presentation of Section 4, and further results and comparisons for the SIR and SEIR perfect models in Sections 7 and 8).
The second problem concerns also the SIR and SEIR perfect models:
Problem 2. For the SIR perfect model, we want to determine the set of initial states, (S(t0), I(t0), R(t0)), from which the infection cap Imax will be maintained for all times and for any function β: [t0, ∞[→[βmin, βmax], γ being perfectly known. For the SEIR model, the problem consists also in maintaining the infection cap Imax for all times and any pair of functions (β, γ) with β: [t0, ∞[→[βmin, βmax] and γ: [t0, ∞[→[γmin, γmax], η being perfectly known.
These sets are called the Maximal Robust Positively Invariant (MRPI) sets associated to the SIR and SEIR perfect model respectively (see their general definitions 3.2 and 3.3). Their construction, again via the construction of their boundary, consisting, as before, of a usable part and a barrier, is presented in Sections 5, 7 and 8).
The third problem concerns the SIR and SEIR imperfect models:
Problem 3. Suppose now that, for the SIR model, the value of the parameter γ is not known. All that we know is that γ ∈ [γmin, γmax]. We also assume that an intervention strategy has been pre-designed (SIR imperfect model). Find the states from which this intervention strategy will maintain the infection cap regardless of the error in the parameter γ, for all t ∈ [t0, ∞[. For the SEIR model, we pose the same problem with unknown parameter η ∈ [ηmin, ηmax] in place of γ and with predesigned intervention strategies
and
(SEIR imperfect model).
Its solution will consist in constructing the MRPI set associated to the SIR (resp. SEIR) imperfect model (see Sections 6, 7 and 8).
Table 1 summarises the status of the parameters and controls for each problem.
The main mathematical tool to solve these three problems is sketched in the next section.
3 The theory of barriers
We now summarise the relevant theory from [19, 20], which we will apply to describe the sets of the two epidemic models. Consider a state and input constrained nonlinear system:
(10)
(11)
where
is the state; x0 is the initial condition;
is the input;
is the set of Lebesgue measurable functions that map the interval
to a compact and convex set
(note the difference between
, a function space, and U, a subset of
); and gi, i = 1, …, p, are the state constraints. We impose the following assumptions:
- Assumptions
- (A1) The function
is
on an open set containing
.
- (A2) Every x0, with ‖x0‖<∞, and every
admits a unique absolutely continuous integral curve of (10) that remains bounded over any finite interval of time.
- (A3) The set f(x, U) is convex for all
.
- (A4) The function gi, i = 1, …, p, is
and the set of points given by gi(x) = 0 defines an n − 1 dimensional manifold.
It can be verified that the SIR and SEIR models analysed in subsequent sections satisfy Assumptions (A1)–(A4) for each considered interpretation of the input. In particular, the following growth condition is always satisfied: there exists a C < ∞ such that for all
, which implies (A2). An important consequence of these assumptions is that the admissible and MRPI sets are closed.
We use the following notation: let denote the unique solution of (10) from the initial state
at initial time t0, with input function
, and let
denote the solution at time t ∈ [t0, ∞[. If clear from context, we will use the notation xu and xu(t) instead. Let
,
, and
The set of indices of active constraints at a point x is denoted
. We let
denote the Lie derivative of a differentiable function
with respect to f(⋅, u) at the point x.
We now present the definitions of the two sets that we will describe for the compartmental epidemic models.
Definition 3.1. The admissible set also known as the viability kernel in Viability theory, [22], see [19], of the system (10) and (11), denoted by , is the set of initial states for which there exists a
such that the corresponding solution satisfies the constraints (11) for all future time,
Definition 3.2. A set
is said to be a robust positively invariant set (RPI) of the system (10) provided that
for all t ∈ [t0, ∞[, for all x0 ∈ Ω and for all
.
Definition 3.3. The maximal robust positively invariant set (MRPI) of the system (10) and (11) contained in G, see [20], is the union of all RPIs that are subsets of G. Equivalently this equivalence is shown in [20],
We obviously have . Moreover, under (A1)–(A4) the sets
and
are closed, and we denote their boundaries by
and
, respectively.
The main result from the papers [19, 20] is a characterisation of the sets’ boundaries that are made up of two complementary parts: the usable part, which is contained in the boundary of the constrained state space, and
; and the barrier, which is contained in the interior of the constrained state space,
and
. Points on the admissible set’s usable part satisfy:
(12)
whereas those on the MRPI’s usable part satisfy:
(13)
The barrier is made up of integral curves of the system that satisfy a minimum-/maximum-like principle that may intersect the boundary of the constraint set, G0, in a tangential manner. We summarise these results in the following theorem, for which proofs can be found in [19, 20].
Theorem 3.1. Under the assumptions (A1)–(A4), every integral curve
contained in
(resp.
) and crossing G0 tangentially in finite time satisfy, together with the corresponding control
, the following necessary conditions. There exists a nonzero absolutely continuous maximal solution
to the adjoint equation:
(14) such that the Hamiltonian λT f satisfies:
(15)
(16) for almost all t. Moreover, we have:
where
(17)
(18)
denotes the time at which G0 is reached,
, and i⋆ ∈ {1, …, p} denotes any index for which the constraints are active at the point z, i.e.
.
To now compute the curves running along the barrier, we first obtain the points of ultimate tangentiality via the expressions (17) (resp. (18)) and then integrate the system backwards in time with the control function that minimizes (in the case of the set ) or maximizes (in the case of the MRPI set
) the Hamiltonian for almost every t, according to the expression (15) (resp. (16)) with λ satisfying (14).
In the sequel the set G will be expressed by a single state constraint that caps the proportion of infective individuals, and we will interpret the function u in two ways. The first interpretation will be that u is a time-varying “controllable” input (u = β for the SIR model and u = (β, γ) for the SEIR model), which will allow us to solve Problem 1 (resp. Problem 2) (see Subsection 2.3 and Table 1), i.e., find the contact rate β (in the SEIR case also the removal rate γ) such that, the parameter γ being perfectly known, the infection cap, Imax, is never breached (resp. never breached for all β ∈ [βmin, βmax]).
The second interpretation will be that u is an “uncontrollable” disturbance term (u = γ for the SIR model and u = η for the SEIR model) encapsulating uncertainty in modelling parameters. This will allow us to address Problem 3, i.e., given a pre-designed feedback, find the states from which the infection cap will be always maintained regardless of the error in the modelling parameters.
4 Carrying out the analysis of the admissible set for the perfect SIR and SEIR models (problem 1)
In this section we carry out the detailed analysis of the admissible sets of the constrained SIR and SEIR models under the assumption of perfect modelling (Problem 1). For the sake of readability, comparisons of admissible and robust sets for the perfect and imperfect models as well as numerical applications are presented in Sections 7 and 8.
4.1 Admissible set for perfect SIR model
We assume that the SIR model is perfect (that is, γ is known perfectly) and that β is a controllable time-varying input, which may, for example, model social-distancing measures to halt the disease’s spread. We impose hard constraints on the input and state: I(t) ≤ Imax and β(t) ∈ [βmin, βmax] for all t ∈ [t0, ∞[, where Imax ∈ [0, 1] is the hard infection cap, and , with 0 < βmin ≤ βmax, are the minimal and maximal contact rates, respectively. Recall that the bound βmax may be interpreted as the nominal contact rate in absence of the disease, and βmin as the maximal social distancing.
Because R has no influence on S or I we can study the two-dimensional subsystem:
(19)
(20)
(21)
with t ∈ [t0, ∞[. To ease our notation we will sometimes label the state
, the control
, the control constraint set
, the single constraint function
, and the set
, where Π is given by (4). We also denote by
.
Applying condition (12), the usable part is given by the condition
which yields (βmin S − γ)Imax ≤ 0, or
. Therefore the usable part is the set
.
Focusing now on the barrier , let us label tangent points to G0 by
, where
denotes the time at which G0 is reached, as explained in Theorem 3.1. Invoking ultimate tangentiality, (17), we get: Dg(z1, z2) = (0, 1) and
. Thus:
(22)
and along with the constraints z2 = Imax and z1 + z2 ≤ 1, we get that the single tangent point must satisfy (βmin z1 − γ)Imax = 0, or
, with
, one of the end point of the usable part.
The adjoint system, (14), reads:
(23)
From the Hamiltonian minimisation condition, (15), we get:
(24)
from where we get:
(25)
where
denotes the input associated with the barrier trajectories. Thus, at the point z, we have
, which immediately implies, by continuity of the adjoint, that
in some nonempty interval, that is, for
, ϵ > 0.
Proposition 4.1. The input
, given by (25), associated with the barrier of the admissible set of the perfect SIR model, (19)–(21) only switches at isolated points in time.
Proof. Suppose that λ2(t) − λ1(t) = 0 over an interval of time , with
arbitrary and ϵ > 0. Then, we would have
identically in this interval, i.e., according to (23),
We deduce that γλ2(t) = γλ1(t) = 0 over this interval. Therefore, the adjoint would identically vanish, which is impossible according to Theorem 3.1, hence the proposition.
Remark 4.1. As is known from optimal control, an input with bang-bang structure may exhibit other complicated behaviour, such as the “Fuller phenomenon”. Though we cannot make definite statements concerning the existence or nonexistence of such behaviours along barrier trajectories, they were not observed in any of the numerical examples in this paper.
The next Proposition states that barrier curves associated with the admissible set of the perfect SIR model always evolve backwards into G−.
Proposition 4.2. Consider the constrained perfect SIR model, (19)–(21). The barrier is constituted by the curve
generated by (25) with (23), that ends tangentially to G0 ∩ Π at the point
with
, and is contained in G− at least for all
, ϵ > 0.
Proof. Let denote the mapping
over some open interval
, with ϵ > 0. We have shown that the barrier curve
has to be such that
vanishes at
as well as its first derivative, which is equal to
. Moreover, β must remain constant, equal to βmin, in the interval
. Let us compute
’s left second derivative:
Using the fact that ,
,
and
, this simplifies to:
Therefore, using Taylor’s expansion formula,
in an interval
for a sufficiently small ϵ, which proves that the barrier curve
remains in G− in this interval.
Remark 4.2. Note that the point of the barrier satisfying I = 0 is an equilibrium point: ,
. Therefore the unique solution from (S(t0), 0) is reduced to this point.
In fact, the whole axis I = 0 may be seen to be included in since every point of this axis is an equilibrium and thus satisfies the constraint forever and belongs to ∂Π, the boundary of Π (see also Section 7.1). It is remarkable that the points in this axis, though in the barrier, do not satisfy the conditions of Theorem 3.1 since they do not cross G0 (recall that Theorem 3.1 is only necessary).
Finally, the integral curve of the system S(t) = 0, ,
, i.e. the semi-open line segment {(0, I)∣I ∈ ]0, Imax]} also lies in
and hence in
, neither satisfies the conditions of Theorem 3.1 since it does not intersect G0 tangentially. It results that
is the union of the set made by the integral curves satisfying Theorem 3.1 and of a set of special curves that do not intersect G0 tangentially.
4.2 Admissible set for perfect SEIR model
We now focus on the model (5)–(8) and assume that β and γ are controllable inputs representing social distancing measures, and quarantining/isolation measures of infectives, respectively. We assume that η is perfectly known. Thus, we consider the three-dimensional constrained system:
(26)
(27)
(28)
(29)
with t ∈ [t0, ∞), 0 < Imax ≤ 1, 0 < βmin ≤ βmax, and 0 < γmin ≤ γmax. We will sometimes label the state
, the controllable input
, the control constraint set
,
, and
, where Π is given by (9).
As we did with the perfect SIR model, we first construct the usable part given, using (12), by the condition
which yields γ = γmax and
, S ∈ [0, 1 − Imax], or
Now, the barrier curves of must satisfy the ultimate tangentiality condition, (17), to get:
and along with the constraints z3 = Imax and 0 ≤ z1 + z2 + z3 ≤ 1, we obtain the set of tangent points:
(30)
Thus, unlike with the perfect SIR model, we now have a line segment in the boundary of where the admissible set’s barrier curves intersect G0 tangentially. The adjoint system, (14), reads:
(31)
and condition (15) gives the input associated with the admissible set’s barrier curves:
(32)
Since , we immediately see that
. Moreover, we see from (31) that
and thus, at
, we get
, implying that
for all
, ϵ > 0.
We have the following results concerning integral barrier curves.
Proposition 4.3. Consider the constrained perfect SEIR model, (26)–(29). Along any barrier integral curve satisfying (31) and (32) and such that z1 ≠ 0 in (30), the inputs and
, given by (32), only switch at isolated points in time.
Proof. Following the same arguments as in Proposition 4.1, suppose λ2(t) − λ1(t) = 0 over some interval of time, ,
,
. Then, we would have
for all
, which would imply λ2(t) − λ3(t) = 0 for all
. This would also imply that λ3(t) = 0 for all
since
for all
. Moreover, noting that
, we would have
for all t ∈ I. Thus, λ1(t) = λ2(t) = λ3(t) = 0 for all
, which is impossible according to Theorem 3.1.
Suppose now that λ3(t) = 0 over some nonempty interval . Then we would have
over this interval, which would imply that S(t)(λ2(t) − λ1(t)) = 0, provided that S(t)≠0, over this interval. But if S(t) = 0 over some interval of time, according to the uniqueness of the solution of (26)–(29), this would imply that S(t) = 0 for all times and in particular
, which is excluded by assumption. Therefore λ3(t) = 0 over some nonempty interval would imply λ2(t) − λ1(t) = 0 over this interval, which we have established is impossible in the first part of the proof.
The next proposition identifies which parts of are associated with barrier curves that evolve backwards into G−. To now numerically construct the admissible set one only needs to focus on these tangent points.
Proposition 4.4. Consider the constrained perfect SEIR model, (26)–(29). The barrier is constituted by the integral curves
satisfying (31) and (32), that end tangentially to G0 at a point of
, defined by (30), for which
(33) and is contained in G− at least for all
, ϵ > 0.
Proof. As in Proposition 4.2, the result follows from considering the inequality for points on
. First, evaluating
at
, thanks to (30) and (31), we get
. Therefore, λ2(t) − λ1(t) is decreasing before vanishing at
, which proves that λ2(t) − λ1(t)>0 in an interval
, with ϵ > 0 suitably chosen. We immediately deduce that β(t) = βmin in the same time interval
. We also get, using the fact that
, that γ = γmax in this interval (possibly with a smaller ϵ). Thus
. Moreover, in this interval, we must have
which proves that z1 must satisfy
and, thanks to the definition of
,
, hence (33). The same Taylor’s expansion as in Proposition 4.2, implies that the barrier curves evolve backwards into G− provided that (33) holds.
Remark 4.3. Similar to Remark 4.2, the set {(S, E, I):S ∈ [0, 1], E = 0, I = 0} is a set of equilibrium points for the SEIR model and clearly a subset of . Moreover, any integral curve of the system initiating from the set {(S, E, I):S = 0, E = 0, I ∈ [0, Imax]} results in S(t)≡0, E(t)≡0, I(t)≤Imax for all t ∈ [t0, ∞[, because γ(t)>0. Thus, as in the SIR case, the barrier
is the union of curves that satisfy the necessary conditions of Theorem 3.1 and this special subset that does not intersect G0 tangentially.
5 Carrying out the analysis of the MRPI for the perfect SIR and SEIR models (problem 2)
In this section we carry out the detailed analysis of the Maximal Robust Positively Invariant sets of the constrained SIR and SEIR models under the assumption of perfect modelling (Problem 2).
As for the previous section, comparisons and numerical applications are presented in Sections 7 and 8.
5.1 MRPI for perfect SIR model
We consider the same setting as that of Subsection 4.1, the constrained two-dimensional system (19)–(21), and describe the system’s MRPI set.
We first remark that the usable part , according to condition (13), is given by
which yields
.
Now, carrying out the analysis with the ultimate tangentiality condition, (18), and Hamiltonian maximisation condition (16), we note that the only difference with respect to (22) is that we maximize with respect to β in place of minimizing. Thus, we find that the sole tangent point is located at with
. The adjoint equation being the same as (23), the input associated with the MRPI barrier curve is given by:
(34)
which also only switches at isolated points in time, the proof being exactly the same as that of Proposition 4.1.
The following proposition is the analogue of Proposition 4.2. Its proof follows exactly the same lines and is left to the reader.
Proposition 5.1. Consider the constrained perfect SIR model, (19)–(21). The barrier is constituted by the curve
generated by (34) with (23), that ends tangentially to G0 ∩ Π at the point
with
, and is contained in G− at least for all
, ϵ > 0.
The reader may also verify that Remark 4.2 also applies to the barrier of the MRPI set.
5.2 MRPI for perfect SEIR model
We consider the same setting as that of Subsection 4.2: the constrained three-dimensional system (26)–(29) and describe the system’s MRPI set. The analysis follows exactly the same lines as in Subsection 4.2, the operation of maximisation replacing the minimisation one. We therefore only sketch the results.
Concerning the barrier, using conditions (16) and (18), we identify the line segment of potential tangent points:
(35)
where the subscript
in
refers to the “perfect” model case.
The adjoint system being described by (31), the input associated with the MPRI’s barrier curves are thus given by:
(36)
These inputs may only switch at isolated points in time provided that z1 ≠ 0 in (35), the proof following exactly the same arguments as the proof of Proposition 4.3. The next proposition is the analogue of Proposition 4.4, its proof also following the same lines of reasoning.
Proposition 5.2. Consider the constrained perfect SEIR model, (26)–(29). The barrier is constituted by the integral curves
satisfying (31) and (36), that end tangentially to G0 at a point of
, defined by (35), for which
(37) and is contained in G− at least for all
, ϵ > 0.
As before, the reader may verify that Remark 4.3 applies to the MPRI for the perfect SEIR model as well.
6 MRPI for the imperfect SIR and SEIR models (problem 3)
In this section we carry out the detailed analysis of the MRPIs of the constrained SIR and SEIR models under the assumption of imperfect modelling, corresponding to Problem 3).
6.1 MRPI for imperfect SIR model
We again consider the normalised SIR model, but now assume that the model parameter γ is not perfectly known and that the intervention strategy, a simple affine feedback strategy, is given by:
(38)
where the level of social distancing depends on the proportion of infective individuals, has been pre-designed and implemented. Thus, the system is now:
(39)
(40)
(41)
with t ∈ [t0, ∞), and 0 < γmin ≤ γmax. Again, to ease our notation, we will sometimes label the state
, the uncertain model parameter
, the parameter set
, and
.
The adjoint Eq (14) reads:
(42)
where
. Invoking conditions (16) we find the input associated with the MRPI barrier curve, given by:
(43)
We again have a result concerning singular barrier curves.
Proposition 6.1. Consider the constrained imperfect SIR model, (39)–(41). Along any barrier integral curve satisfying (42) and (43) and such that z1 ≠ 0 and 2βmin < βmax, the input , given by (43), only switches at isolated points in time.
Proof. As before, assume that λ2(t) = 0 in some open interval . Then, indeed
. The reader may confirm that if 2βmin < βmax, then α(I)≠0. Thus, if also z1 ≠ 0, we see that if λ2(t) = 0 over an interval
, then λ1(t) = λ2(t) = 0 on
, hence the contradiction.
From condition (18) the sole tangent point is located at , with
, which we derive from the fact that
.
Again, the barrier curve evolves backwards into G−:
Proposition 6.2. Consider the constrained imperfect SIR model, (39)–(41). The barrier is constituted by the curve
generated by (43) with (42), that ends tangentially to G0 ∩ Π at the point
, with
, and is contained in G− at least for all
, ϵ > 0.
Proof. The reader may easily verify that and
. Thus, since
and
, and since γ(t) is constant in a suitable interval before
, i.e.
in this interval, we have
and
. The conclusion follows by the same Taylor’s expansion argument as in Proposition 4.2.
6.2 MRPI for imperfect SEIR model
Similar to the previous case, we consider the system:
(44)
(45)
(46)
(47)
with t ∈ [t0, ∞[, 0 < ηmin ≤ ηmax. The inputs
and
are assumed to be pre-designed by the simple affine feedback strategies:
(48)
and
(49)
which may be interpreted as the fact that we increase social distancing and increase the rate of quarantining if the infective number increases.
For this setting we identify: , the uncertain modelling parameter
, the uncertain parameter set
,
, and
.
As before, the reader may easily verify that the set of potential tangent points is:
(50)
where the subscript MI in
denotes the “imperfect” case. The adjoint, (14), reads:
(51)
where
, and α(I) is as in Subsection 6.1.
It can be verified that the input associated with barrier curves of the MRPI is given by:
(52)
Proposition 6.3. Consider the constrained imperfect SEIR model, (44)–(47). Along any barrier integral curve satisfying (51) and (52) and such that z1 ≠ 0 and the determinant for all I ∈ [0, Imax], the input
, given by (52), only switches at isolated points in time.
Proof. Assume, as before, that λ3(t) − λ2(t) = 0 in a given interval of time . We immediately deduce that
and
. Differentiating once more this latter expression yields
. Thus, if the above determinant does not vanish for all I ∈ [0, Imax] and if S ≠ 0 we arrive at λ1 = λ2 = λ3 = 0, the desired contradiction.
The proof of the next proposition follows the same lines as before and is left to the reader.
Proposition 6.4. Consider the constrained imperfect SEIR model, (44)–(47). The barrier is constituted by the curves
generated by (52) with (51), that end tangentially to G0 ∩ Π at a point of
, defined by (50), with
and is contained in G− at least for all
, ϵ > 0.
7 Further results on the relative location of the admissible and MRPI sets
The admissible and/or MRPI sets may be trivially equal to the entire constrained state space, GΠ, in which case any intervention strategy will maintain the infection cap. We now present some results that summarise the relationship between certain inequalities of the system parameters and the relative location of the sets.
7.1 SIR model
Proposition 7.1. Consider the constrained perfect SIR model (19)–(21). We have the following:
-
if and only if
,
-
, if and only if
and
,
-
, if and only
.
Consider the constrained imperfect SIR model (39)–(41), under the feedback (38). We have the following:
-
if and only if
,
-
if and only if
.
Proof. The constraint set GΠ is the polyhedron:
and its boundary is the union of the four faces
Indeed, for every choice of βmin, βmax, Imax.
We will have if the vector field
points towards the interior of GΠ along ∂GΠ for all values of βmin, βmax, Imax satisfying (53), i.e.
(54)
(55)
(56)
(57)
The last three inequalities (55)–(57) are trivially satisfied and (54) results from (53), which proves that (53) implies and thus also
. The converse, namely that
implies (53), follows from the fact that (54) is valid only if (53) holds.
We proceed in the same way to prove that if
and
, up to the fact that, in (54)–(57), the maximisation with respect to β is replaced by the minimisation with respect to β.
The third bullet point results from the fact that none of the two previous cases hold, which prevents from having an equality of or
to GΠ.
The last two bullet points are obtained as the first and third bullets by changing f in and maximising with respect to γ ∈ [γmin, γmax].
Proposition 7.1 provides easily checkable inequalities of the system parameters that may be used to determine whether the sets are trivial or not. For example, focusing on the perfect SIR model, if then GΠ is invariant for any choice of input and one need not worry about ever breaching the infection cap, as long as the state initiates inside GΠ. However, this is not the case when
, and the barrier of the MRPI must be computed by integrating the coupled differential equations of the system and the adjoint ones. If
then the MRPI and the admissible set are proper subsets of GΠ. In this case there are parts of GΠ from which the infection cap will definitely be breached and, starting from
or
, we must compute the corresponding barrier to derive an adapted intervention strategy.
7.2 SEIR model
We now summarise the analogous results for the perfect and imperfect SEIR models.
Proposition 7.2. Consider the constrained perfect SEIR model (26)–(29). We have the following:
-
if and only if η(1 − Imax) − γmin Imax ≤ 0,
-
, if and only if η(1 − Imax) − γmin Imax > 0 and η(1 − Imax) − γmax Imax ≤ 0,
-
, if and only if η(1 − Imax) − γmax Imax > 0.
Consider the constrained imperfect SEIR model (44)–(47) under the feedback (48) and (49). We have the following:
-
if and only if ηmax(1 − Imax) − γmax Imax ≤ 0,
-
if and only if ηmax(1 − Imax) − γmax Imax > 0.
Proof. We follow the same arguments as in the proof of Proposition 7.1. For the SEIR model (26)–(29), the set GΠ is the polyhedron
and
We thus prove that is equivalent to the first bullet point inequality, i.e.
(58)
by showing that the vector field
(recall that η is fixed) points towards the interior of GΠ along ∂GΠ for all values of β ∈ [βmin, βmax], γ ∈ [γmin, γmax] provided that Imax satisfies (58). We thus evaluate the scalar product of f with the normal to ∂GΠ at each of its edges.
and
and
and
and
Therefore, f points towards the interior of GΠ along ∂GΠ for all values of β and γ, or equivalently , if and only if (58) holds.
We proceed in the same way to prove that if and only if η(1 − Imax) − γmin Imax > 0 and η(1 − Imax) − γmax Imax ≤ 0, up to the fact that the maximisation with respect to β and γ is replaced by the minimisation with respect to β and γ.
As in the proof of Proposition 7.1, the third bullet point results from the fact that none of the two previous cases hold, which prevents from having an equality of or
to GΠ.
Finally, the last two bullet points are obtained as the first and third bullets by changing f in and maximising with respect to η ∈ [ηmin, ηmax].
8 Examples
We now present detailed numerical examples to clarify the results of the paper.
8.1 SIR examples
8.1.1 Perfect SIR example.
First, consider the perfect SIR system, (19)–(21), with γ = 0.5, βmin = 0.6, βmax = 0.8 and Imax ∈ {0.02, 0.15, 0.4}. Thus, this (hypothetical) disease has an average recovery rate of 2 days and, on average, an individual nominally comes into contact (sufficiently to catch the disease) with 0.8 other people per day. We have chosen these parameters to demonstrate the different types of possible sets.
For Imax = 0.4 we see from Proposition 7.1 that . Thus, with such a large cap on the infection numbers the entire space GΠ is robustly invariant. For Imax = 0.15 we see from Proposition 7.1 that
. To now obtain the barrier associated with the MRPI, we integrate the system backwards in time from the tangent point
utilising the input (34). We stop integrating once the trajectory intersects the boundary of GΠ because the set Π is positively invariant (recall the discussions in Subsections 2.1 and 2.2.) For Imax = 0.02 we see from Proposition 7.1 that
. To obtain the barriers of the admissible set and MRPI we integrate the system backwards in time from the tangent points
and
utilising the input (34) and (25), respectively. See Fig 1 for details.
Projections of the admissible and MRPI sets onto the S − I axes are shown. If the infection cap is large enough the entire constrained state space GΠ is robustly invariant (top figure), otherwise the sets are subsets of GΠ.
It turns out that the input associated with the admissible set is saturated at βmin, and the one associated with the MRPI is saturated at βmax. Moreover, we can see that, going backwards, the barrier curves always evolve into G−, as is expected from Propositions 4.2 and 5.1.
To now use the sets in the management of an epidemic the intervention strategy may be chosen according to the location of the state. A possible strategy could be:
- If
, let β(t) = βmax,
- If
, let β(t) = βmin,
- If
, let
.
To clarify, if the state is located in the MRPI then it is guaranteed that the infection cap can always be maintained, and the nominal contact rate, βmax, may be allowed. The same is true if the state is located in the interior of the admissible set, but this may only be possible for some period of time. If the state reaches the admissible set’s barrier, , then maximal social distancing must be imposed, thus β(t) = βmin, and the infection cap will be reached in finite time, but never breached. If the state reaches the admissible set’s usable part,
, then some freedom in the social distancing is allowed. In fact, we may choose β(t) such that
, which yields
. Lastly, the set
should always be avoided, as from here the infection cap is guaranteed to be breached regardless of β. Fig 2 shows the result of this switching law being applied from an arbitrary initial condition,
, for the case where Imax = 0.02.
The state trajectory is shown in the top figure (dashed curve). The middle plot is of the intervention strategy, β, and the right plot is the proportion of infectives over time.
8.1.2 Imperfect SIR example.
Consider the imperfect SIR model, (39)–(41), with the simple feedback strategy as in (38) and the constants Imax = 0.2, βmin = 0.6, βmax = 0.8, and γmin = 0.3, γmax = 0.5. Thus, the recovery rate for this hypothetical disease may vary. We see from Proposition 7.1 that
, and so we find the barrier of the system’s MRPI according to the analysis in Subsection 6.1, see Fig 3. It turns out that
is saturated at γmin all along the MRPI’s barrier. We also show a few solutions of the system from the initial state
with γ ∈ [0.3, 0.5], emphasising that the infection cap can be maintained with this feedback regardless of the modelling uncertainty.
We also show ten simulations from an initial state with randomly sampled γ ∈ [0.3, 0.5].
Remark 8.1. In epidemiology it is common to want an intervention strategy that renders the basic reproduction number, , less than one in order to eradicate the disease. However, this is not required to maintain the infection cap using the introduced sets. In fact, in the examples of Subsection 8.1,
for all mentioned values of β and γ.
8.2 SEIR examples
8.2.1 Perfect SEIR example.
Consider the perfect SEIR model, (26)–(29), with the constants βmin = 0.8, βmax = 1, ,
,
and Imax ∈ {0.3, 0.4}. From Proposition 7.2 we see that
for Imax = 0.4. Thus, we sample final tangent points along the line segment
for which
(see Proposition 5.2) and integrate backwards with the appropriate inputs, as specified in Subsection 5.2, terminating the integration if the curves intersect the infection cap, or the plane
. This produces the red curves in Fig 4, running along the MRPI’s barrier.
Shown are curves running along the barriers of the MRPI (in red) and the admissible set (in blue).
For Imax = 0.3 we see that . Thus, for this case we find both
and
, integrating backwards from
and
with the appropriate inputs as given in Subsections 5.2 and 4.2.
The inputs and
are saturated at βmax and γmin (resp. βmin and γmax) for the barrier of the MRPI (resp. the barrier of the admissible set). As was observed in the examples for the SIR model, if Imax is large enough the entire set GΠ is robustly invariant, and if Imax is small enough, the sets
and
become nontrivial.
8.2.2 Imperfect SEIR example.
Now consider the imperfect SEIR model, (44)–(47) with the parameters βmin = 0.8, βmax = 1, ,
,
,
and Imax = 0.1, and the feedback (48) and (49). From Proposition 7.2, we have
. Thus, we integrate backwards from points in
for which
(see Proposition 6.4) with the input
as specified in Subsection 6.2.
An unexpected result for this set is that the input associated with barrier curves, , switches from ηmin to ηmax at some point along the barrier (these points are indicated on the figure). To explain this, we can interpret η as an input with the goal of maximising I over time. For this example it is optimal for it to remain at ηmin in order to build up the proportion of exposed individuals to some threshold when it switches to ηmax, which then results in a large increase in the proportion of infectives. This is the worst-case change in η that can be expected. The computed set is shown in Fig 5.
Going backwards in time, the input associated with the barrier, , switches from ηmax (blue curves) to ηmin (red curves) at the black dots.
9 Discussion
We applied the theory of barriers to describe integral curves of the system that run along special parts of the boundaries of the admissible and MRPI sets of the constrained SIR and SEIR models. The analysis in Sections 4, 5 and 6 summarises the details required to construct the sets for each of the three problems stated in Subsection 2.3, with Section 7 presenting inequalities of the system parameters that allow one to determine whether the sets are trivially equal to the constrained state space GΠ or not. We also demonstrated, in the example in Subsection 8.1 how an intervention strategy may be chosen using the computed sets in order to maintain the infection cap.
There are many avenues of future research to pursue: the analysis could be applied to other epidemic models; we could investigate the efficacy of combining model predictive control with knowledge of the sets; or look into the effects of more realistic intervention strategies that must remain constant over long periods of time, as opposed to the continuous ones introduced in (38) or (49)–(48).
References
- 1. Sanders JL. Quantitative guidelines for communicable disease control programs. Biometrics. 1971; p. 883–893.
- 2. Hethcote HW, Waltman P. Optimal vaccination schedules in a deterministic epidemic model. Mathematical Biosciences. 1973;18(3-4):365–381.
- 3. Hansen E, Day T. Optimal control of epidemics with limited resources. Journal of Mathematical Biology. 2011;62:423–451.
- 4. Kruse T, Strack P. Optimal control of an epidemic through social distancing. Cowles Foundation Discussion Paper. 2020.
- 5.
Miclo L, Spiro D, Weibull J. Optimal epidemic suppression under an ICU constraint. arXiv preprint arXiv:200501327. 2020.
- 6. Godara P, Herminghaus S, Heidemann KM. A control theory approach to optimal pandemic mitigation. PloS one. 2021;16(2):e0247445.
- 7. Kirschner D, Lenhart S, Serbin S. Optimal control of the chemotherapy of HIV. Journal of mathematical biology. 1997;35(7):775–792.
- 8. Culshaw RV, Ruan S, Spiteri RJ. Optimal HIV treatment by maximising immune response. Journal of mathematical biology. 2004;48(5):545–562.
- 9. Agusto FB, ELmojtaba IM. Optimal control and cost-effective analysis of malaria/visceral leishmaniasis co-infection. PLoS One. 2017;12(2):e0171102.
- 10. Sharomi O, Malik T. Optimal control in epidemiology. Annals of Operations Research. 2017;251(1-2):55–71.
- 11. Aronna MS, Guglielmi R, Moschen LM. A model for COVID-19 with isolation, quarantine and testing as control measures. Epidemics. 2021;34:100437.
- 12. Bonnans JF, Gianatti J. Optimal control techniques based on infection age for the study of the COVID-19 epidemic. Mathematical Modelling of Natural Phenomena. 2020;15:48.
- 13.
Grundel S, Heyder S, Hotz T, Ritschel TK, Sauerteig P, Worthmann K. How much testing and social distancing is required to control COVID-19? Some insight based on an age-differentiated compartmental model. arXiv preprint arXiv:201101282. 2020.
- 14. Perkins TA, España G. Optimal control of the COVID-19 pandemic with non-pharmaceutical interventions. Bulletin of mathematical biology. 2020;82(9):1–24.
- 15. Köhler J, Schwenkel L, Koch A, Berberich J, Pauli P, Allgöwer F. Robust and optimal predictive control of the COVID-19 outbreak. Annual Reviews in Control. 2020.
- 16.
Lobry C. Qu’est-ce que le pic d’une épidémie et comment le contrôler. Cassini / Spartacus—IDH, Paris; 2021.
- 17.
Brauer F, Castillo-Chavez C, Feng Z. Mathematical models in epidemiology. Springer; 2019.
- 18. Hethcote HW. The mathematics of infectious diseases. SIAM Review. 2000;42(4):599–653.
- 19. De Dona JA, Lévine J. On barriers in state and input constrained nonlinear systems. SIAM Journal on Control and Optimization. 2013;51(4):3208–3234.
- 20. Esterhuizen W, Aschenbruck T, Streif S. On maximal robust positively invariant sets in constrained nonlinear systems. Automatica. 2020;119:109044.
- 21. De Lara M, Salcedo LSS. Viable control of an epidemiological model. Mathematical Biosciences. 2016;280:24–37.
- 22.
Aubin JP. Viability theory. Springer Science & Business Media; 2009.
- 23. Salcedo LSS, De Lara M. Robust viability analysis of a controlled epidemiological model. Theoretical Population Biology. 2019;126.
- 24. Rashkov P. A model for a vector-borne disease with control based on mosquito repellents: A viability analysis. Journal of Mathematical Analysis and Applications. 2021;498(1):124958.
- 25. Esterhuizen W, Aschenbruck T, Lévine J, Streif S. Maintaining hard infection caps in epidemics via the theory of barriers. IFAC-PapersOnLine. 2020;53(2).
- 26.
Blanchini F, Miani S. Set-Theoretic Methods in Control. 2nd ed. Springer; 2015.
- 27. Monnet D, Ninin J, Jaulin L. Computing an Inner and an Outer Approximation of the Viability Kernel. Reliable Computing. 2016;22.
- 28. Mitchell IM, Bayen AM, Tomlin CJ. A Time-Dependent Hamilton-Jacobi Formulation of Reachable Sets for Continuous Dynamic Games. IEEE Transactions on Automatic Control. 2005;50(7):947–957.
- 29. Korda M, Henrion D, Jones CN. Convex Computation of the Maximum Controlled Invariant Set for Polynomial Control Systems. SIAM Journal on Control and Optimization. 2014;52(5):2944–2969.
- 30. Barrios E, Gajardo P, Vasilieva O. Sustainable thresholds for cooperative epidemiological models. Mathematical biosciences. 2018;302:9–18.
- 31. Kassara K. A unified set-valued approach to control immunotherapy. SIAM journal on control and optimization. 2009;48(2):909–924.
- 32. Boujallal L, Elhia M, Balatif O. A novel control set-valued approach with application to epidemic models. Journal of Applied Mathematics and Computing. 2021;65(1):295–319.