Jump to content

Three Tank multimode problem: Difference between revisions

From mintOC
Line 38: Line 38:


<gallery caption="Reference solution plots" widths="180px" heights="140px" perrow="2">
<gallery caption="Reference solution plots" widths="180px" heights="140px" perrow="2">
  Image:three_tank_relaxed_solution.png| Optimal relaxed controls and states determined by an direct approach with python 3.6 and CasADi, applied Multiple Shooting, 4th order Runge Kutta scheme and <math>n_u=100</math>.
  Image:three_tank_relaxed_solution.png| Optimal relaxed controls and states determined by an direct approach with python 3.6 and CasADi, applied Multiple Shooting, 4th order Runge Kutta scheme and 100 discretization intervals.
  Image:three_tank_binary_solution.png| According optimal binary controls and states determined by the direct approach. The relaxed controls were approximated by Combinatorial Integral Approximation.
  Image:three_tank_binary_solution.png| According optimal binary controls and states determined by the direct approach. The relaxed controls were approximated by Combinatorial Integral Approximation.
  Image:three_tank_rounding_solution.png| Binary and relaxed control values as part of the Combinatorial Integral Approximation problem
  Image:three_tank_rounding_solution.png| Binary and relaxed control values as part of the Combinatorial Integral Approximation problem

Revision as of 09:13, 14 March 2020

Three Tank multimode problem
State dimension: 1
Differential states: 3
Discrete control functions: 3
Interior point equalities: 2

This site describes a Double tank problem variant with three binary controls instead of only one control and three tanks, i.e., three differential states representing different compartments.

Mathematical formulation

The mixed-integer optimal control problem is given by

minx,w0Tk1(x2k2)2+k3(x3k4)2dts.t.x˙1=x1+c1w1+c2w2w3c3x3,x˙2=x1x2,x˙3=x2x3+w3c3x3,x(0)=(2,2,2)T,1=i=13wi(t),wi(t){0,1},i=13.


Parameters

These fixed values are used within the model.

T=12,c1=1,c2=2,c3=0.8,k1=2,k2=3,k3=1,k4=3.

Reference Solutions

If the problem is relaxed, i.e., we demand that w(t) be in the continuous interval [0,1] instead of the binary choice {0,1}, the optimal solution can be determined by means of direct optimal control and the CIA decomposition. We denote the relaxed control values with a(t)[0,1].

The optimal objective value of the relaxed problem with nt=100,nu=100 is 8.775979. The objective value of the binary controls obtained by Combinatorial Integral Approimation (CIA) is 8.789487.