Difference between revisions of "LinearMetabolic"

From mintOC
Jump to: navigation, search
(Created page with "{{Dimensions |nd = 1 |nx = 4 |nw = 1 |nc = 2 |nri = 2 |nre = 5 }}<!-- Do not insert line break here or Dimensions Box moves up in the...")
 
m (Tsiantis reference)
Line 13: Line 13:
 
The '''Linear Metabolic problem''' is a generalized inverse optimal control problem. It tries to identify an a priori unknown objective function from data. The control unction <math> u(t) </math> is ...
 
The '''Linear Metabolic problem''' is a generalized inverse optimal control problem. It tries to identify an a priori unknown objective function from data. The control unction <math> u(t) </math> is ...
  
−
The problem is discussed in detail in <bib id="Sager2015" />.
+
The problem is discussed in detail in <bib id="Tsiantis2018" />.
  
 
== Mathematical formulation ==
 
== Mathematical formulation ==

Revision as of 13:41, 19 October 2023

LinearMetabolic
State dimension: 1
Differential states: 4
Discrete control functions: 1
Path constraints: 2
Interior point inequalities: 2
Interior point equalities: 5


Under construction...

The Linear Metabolic problem is a generalized inverse optimal control problem. It tries to identify an a priori unknown objective function from data. The control unction u(t) is ...

The problem is discussed in detail in [Tsiantis2018]Author: Tsiantis, Nikolaos; Balsa-Canto, Eva; Banga, Julio R
Journal: Bioinformatics
Number: 14
Pages: 2433-2440
Title: Optimality and identification of dynamic models in systems biology: an inverse optimal control framework
Volume: 34
Year: 2018
Link to Google Scholar.

Mathematical formulation

The mixed-integer optimal control problem is given by

\begin{array}{llclr} \displaystyle \min_{x, u} & x_3(t_f) \\[1.5ex] \mbox{s.t.} & \dot{x}_0 & = & (V_{alim} u - R_m x_0 - K_m x_1) / L_m, \\ & \dot{x}_1 & = & \frac{K_r^2}{Mr^2} (K_m x_0 - \frac{r}{K_r} ( M g K_f + \frac{1}{2} \rho S C_x \frac{r^2}{K_r^2} x_1^2)), \\ & \dot{x}_2 & = & \frac{r}{K_r} x_1, \\ & \dot{x}_3 & = & V_{alim} u x_0 + R_{bat} x_0^2, \\[1.5ex] & x(t_0) &=& (0,0,0,0)^T, \\ & x(t_f) & \in & \mathcal{T} \subseteq \mathbb{R}^4,\\ & x_0(t) & \in & [-i_{max}, i_{max}], \\ & u(t) &\in& \{-1, 1\}. \end{array}

Here the four differential states stand for the electrical current ( x_0 ), the angular velocity ( x_1 ), the position of the car ( x_2 ), and the consumed energy ( x_3 ). The objective function x_3(t_f) is just a reformulation of the Lagrange-type objective function tracking the used energy over time.

Parameters

These fixed values are used within the model.

Parameters
Name Symbol Value Unit
Coefficient of reduction K_r 10 [-]
Air density \rho 1.293 kg/m^3
Aerodynamic coefficient C_x 0.4 [-]
Area in the front of the vehicle S 2 m^2
Radius of the wheel r 0.33 m
Constant representing the friction of the wheels on the road K_f 0.03 [-]
Coefficient of the motor torque K_m 0.27 [-]
Inductor resistance R_m 0.03 Ohms
inductance of the rotor L_m 0.05 [-]
Mass M 250 kg
Gravity constant g 9,81 [-]
Battery voltage V_{alim} 150 V
Resistance of the battery R_{bat} 0.05 Ohms

Reference Solutions

We look at the particular instance of our problem with t_f = 10s and target set \mathcal{T} = \mathbb{R} \times \mathbb{R} \times \{100\} \times \mathbb{R} , in which the car needs to cover 100m in 10s. Figure 1 shows a plot of the differential states of the optimal trajectory of the relaxed problem (i.e. u \in [-1,1] instead of u \in \{-1,1\} ) for N = 1000, N being the number of time discretization points. The current x_0 increases to its maximal value of 150A, stays there for a certain time, decreases on its minimal value of -150A, stays on this value and eventually increases slightly. This behavior corresponds to the different arcs bang, path-constrained, singular, path-constrained, bang and can be observed also in Figure 2. It shows the corresponding switching function and the optimal control. Note that the plots show data from the solution with the indirect approach.

Applying the sum up rounding strategy results in an integer-feasible chattering solution. The resulting primal states are shown in Figure 3. One observes the high-frequency zig-zagging of the current x_0 that results from the fast switches in the control.

The direct and indirect approaches are local optimization techniques and only provide upper bounds for the relaxed problem and hence for the original problem. Here the indirect solution of the relaxed problem gives us a bound of x_3(t_f) = 22777.2 .


  • Reference solution plots

  • Primal states of an optimal trajectory for the relaxed problem on a control discretization grid with N = 1,000 .

  • The optimal control and switching function. The dotted vertical lines show the switching times \tau_i where transitions between different kinds of arcs occur.

  • Primal states with Sum up rounding on grid with \Delta t = 10^{-2} .

Source Code

Model descriptions are available in

Variants

There are several alternative formulations and variants of the above problem, in particular

  • fixed final velocity, \mathcal{T} = \mathbb{R} \times \{ 50 \frac{K_r}{3.6r} \} \times \{100\} \times \mathbb{R}, t_f = 10s
  • bounded velocity, \mathcal{T} = \mathbb{R} \times \mathbb{R} \times \{100\} \times \mathbb{R}, t_f = 10s, x_2(t) \leq 45 \frac{K_r}{3.6r} \forall t
  • fixed final velocity, bounded velocity, longer time horizon, x_2(t) \leq 30 \frac{K_r}{3.6r} \forall t, \mathcal{T} = \mathbb{R} \times \{ 30 \frac{K_r}{3.6r} \} \times \{100\} \times \mathbb{R}, t_f = 15s .

References

[Sager2015]Sager, S.; M. Claeys; F. Messine (2015): Efficient upper and lower bounds for global mixed-integer optimal control. Journal of Global Optimization, 61, 721--743Link to Google Scholar
Retrieved from "https://mintoc.de/index.php?title=LinearMetabolic&oldid=2347"