Difference between revisions of "Lotka Experimental Design"
(first crappy version, need to save to restart server) |
(No difference)
|
Revision as of 08:53, 31 August 2012
| Lotka Experimental Design | |
|---|---|
| State dimension: | 1 |
| Differential states: | 12 |
| Discrete control functions: | 2 |
| Interior point equalities: | 12 |
The Lotka Experimental Design problem looks for an optimal fishing strategy to be performed on a fixed time horizon to control the biomasses of both predator as prey fish as described in Lotka Volterra fishing problem. The goal here, however, is to minimize the uncertainty of a follow-up parameter estimation problem. In addition to the fishing decision the question when measurements of the two state variables are performed becomes a degree of freedom.
The mathematical equations form a small-scale ODE model. The ODE from Lotka Volterra fishing problem is extended such that it also includes state sensitivities, the Fisher information matrix entries and integrated sampling states.
The optimal integer control functions shows bang bang behavior.
Contents
Mathematical formulation
We are interested in estimating the parameters 
and 
of the Lotka-Volterra type predator-prey fish initial value problem
![\begin{array}{rcl}
\dot{x_1}(t) &=& p_1 \; x_1(t) - p_2 x_1(t) x_2(t) - p_5 u(t) x_1(t), \; t \in [0,t_f], \quad x_1(0) = 0.5, \\
\dot{x_2}(t) &=& - p_3 \; x_2(t) + p_4 x_1(t) x_2(t) - p_6 u(t) x_2(t), \; t \in [0,t_f], \quad x_2(0) = 0.7,
\end{array}](https://mintoc.de/images/math/3/1/d/31daaad30b442898b092905f1c6b6f93.png)
where 
is a fishing control that may or may not be fixed. The other parameters, the initial values and 
are fixed. We are interested in how to fish and when to measure, with an upper bound 
on the measuring time. We can measure the states directly, 
and 
. We use two different sampling functions, 
and 
in the same experimental setting. This can be seen either as a two-dimensional measurement function 
, or as a special case of a multiple experiment, in which 
, and Failed to parse (unknown function "\Ge"): \Ge(\cdot)
are identical. The experimental design problem then reads
For ![t \in [t_0, t_f]](https://mintoc.de/images/math/5/5/8/55823791d9100bcb5461801aff4f6edd.png)
almost everywhere the mixed-integer optimal control problem is given by
![\begin{array}{llcl}
\displaystyle \min_{x, w} & x_2(t_f) \\[1.5ex]
\mbox{s.t.} & \dot{x}_0(t) & = & x_0(t) - x_0(t) x_1(t) - \; c_0 x_0(t) \; w(t), \\
& \dot{x}_1(t) & = & - x_1(t) + x_0(t) x_1(t) - \; c_1 x_1(t) \; w(t), \\
& \dot{x}_2(t) & = & (x_0(t) - 1)^2 + (x_1(t) - 1)^2, \\[1.5ex]
& x(0) &=& (0.5, 0.7, 0)^T, \\
& w(t) &\in& \{0, 1\}.
\end{array}](https://mintoc.de/images/math/1/0/1/101f9757fbe04ebd1e38721a62291665.png)
Here the differential states 
describe the biomasses of prey and predator, respectively. The third differential state is used here to transform the objective, an integrated deviation, into the Mayer formulation 
. The decision, whether the fishing fleet is actually fishing at time 
is denoted by 
.
Parameters
These fixed values are used within the model.
![\begin{array}{rcl}
[t_0, t_f] &=& [0, 12],\\
(c_0, c_1) &=& (0.4, 0.2).
\end{array}](https://mintoc.de/images/math/c/0/d/c0d44a47d896216ce3c5ba02b67a90ff.png)
Reference Solutions
If the problem is relaxed, i.e., we demand that be in the continuous interval ![[0, 1]](https://mintoc.de/images/math/c/c/f/ccfcd347d0bf65dc77afe01a3306a96b.png)
instead of the binary choice 
, the optimal solution can be determined by means of Pontryagins maximum principle. The optimal solution contains a singular arc, as can be seen in the plot of the optimal control. The two differential states and corresponding adjoint variables in the indirect approach are also displayed. A different approach to solving the relaxed problem is by using a direct method such as collocation or Bock's direct multiple shooting method. Optimal solutions for different control discretizations are also plotted in the leftmost figure.
The optimal objective value of this relaxed problem is 
. As follows from MIOC theory<bibref>Sager2008</bibref> this is the best lower bound on the optimal value of the original problem with the integer restriction on the control function. In other words, this objective value can be approximated arbitrarily close, if the control only switches often enough between 0 and 1. As no optimal solution exists, two suboptimal ones are shown, one with only two switches and an objective function value of 
, and one with 56 switches and 
.
- Reference solution plots
Optimal relaxed control determined by an indirect approach and by a direct approach on different control discretization grids.
Differential states and corresponding adjoint variables in the indirect approach.
Control and differential states with only two switches.
Control and differential states with 56 switches.
Source Code
Model descriptions are available in
Variants
There are several alternative formulations and variants of the above problem, in particular
- a prescribed time grid for the control function <bibref>Sager2006</bibref>, see also Lotka Experimental Design (AMPL),
- different fishing control functions for the two species,
- different parameters and start values.
Miscellaneous and Further Reading
The Lotka Volterra fishing problem was introduced by Sebastian Sager in a proceedings paper <bibref>Sager2006</bibref> and revisited in his PhD thesis <bibref>Sager2005</bibref>. These are also the references to look for more details. The experimental design problem has been described in the habilitation thesis of Sager, <bibref>Sager2011d</bibref>.
References
<bibreferences/>
