# American Institute of Mathematical Sciences

June  2019, 9(2): 223-255. doi: 10.3934/mcrf.2019012

## Construction of the minimum time function for linear systems via higher-order set-valued methods

 1 Universität Bayreuth, Mathematisches Institut, 95440 Bayreuth, Germany 2 Otto von Guericke University Magdeburg, Department of Mathematics, Universitätsplatz 2, 39106 Magdeburg, Germany

* Corresponding author: Thuy T. T. Le

Received  December 2016 Revised  March 2018 Published  November 2018

Fund Project: The second author is supported by a PhD fellowship for foreign students at the Università di Padova funded by Fondazione CARIPARO. This paper was developed while the second author was visiting the Department of Mathematics of the University of Bayreuth.

The paper is devoted to introducing an approach to compute the approximate minimum time function of control problems which is based on reachable set approximation and uses arithmetic operations for convex compact sets. In particular, in this paper the theoretical justification of the proposed approach is restricted to a class of linear control systems. The error estimate of the fully discrete reachable set is provided by employing the Hausdorff distance to the continuous-time reachable set. The detailed procedure solving the corresponding discrete set-valued problem is described. Under standard assumptions, by means of convex analysis and knowledge of the regularity of the true minimum time function, we estimate the error of its approximation. Higher-order discretization of the reachable set of the linear control problem can balance missing regularity (e.g., if only Hölder continuity holds) of the minimum time function for smoother problems. To illustrate the error estimates and to demonstrate differences to other numerical approaches we provide a collection of numerical examples which either allow higher order of convergence with respect to time discretization or where the continuity of the minimum time function cannot be sufficiently granted, i.e., we study cases in which the minimum time function is Hölder continuous or even discontinuous.

Citation: Robert Baier, Thuy T. T. Le. Construction of the minimum time function for linear systems via higher-order set-valued methods. Mathematical Control & Related Fields, 2019, 9 (2) : 223-255. doi: 10.3934/mcrf.2019012
##### References:

show all references

##### References:
Part of the triangulation
Minimum time functions for Example 5.1 with different control sets
Minimum time function for Example 5.1 with U = [−1, 1]2, $\mathcal{S} = \left\{ 0 \right\}$
Minimum time function for Example 5.2a) with target set {0} resp. B0.05(0)
Minimum time functions for Example 5.2b)
Approximate optimal trajectories for Example 5.2a) resp. b)
Minimum time functions for Examples 5.3 and 5.4
Euler and Heun's iterates, minimum time function for Example 5.5 resp
Reachable sets and minimum time functions for Example 5.6
Reachable sets with various end times tf for Examples 5.7 and 5.8
Reachable sets with various end times and different target sets for Example 5.9
Reachable sets with various end times and different control sets for Example 5.10
error estimates for Example 5.1 with different control and target sets
 $N_{\mathcal{R}} = N_U$ $U=B_1(0)$, $\mathcal{S}=B_{0.25}(0)$ $U=[-1, 1]^2$, $\mathcal{S}=B_{0.25}(0)$ $U=[-1, 1]^2$, $\mathcal{S}=\left\{ 0 \right\}$ 0.04 50 0.2951 0.2265 0.02 100 0.1862 0.1180 0.01 200 0.1332 0.0122 0.005 400 0.1132 0.0062 0.0025 800 0.0683 0.0062
 $N_{\mathcal{R}} = N_U$ $U=B_1(0)$, $\mathcal{S}=B_{0.25}(0)$ $U=[-1, 1]^2$, $\mathcal{S}=B_{0.25}(0)$ $U=[-1, 1]^2$, $\mathcal{S}=\left\{ 0 \right\}$ 0.04 50 0.2951 0.2265 0.02 100 0.1862 0.1180 0.01 200 0.1332 0.0122 0.005 400 0.1132 0.0062 0.0025 800 0.0683 0.0062
Error estimates for Ex. 5.2 a) for combination methods of order 1 and 2
 h $N_{\mathcal{R}}$ Euler scheme & Riemann sum Heun's scheme & trapezoid rule 0.04 50 0.2951 0.2265 0.02 100 0.1862 0.1180 0.01 200 0.1332 0.0122 0.005 400 0.1132 0.0062 0.0025 800 0.0683 0.0062
 h $N_{\mathcal{R}}$ Euler scheme & Riemann sum Heun's scheme & trapezoid rule 0.04 50 0.2951 0.2265 0.02 100 0.1862 0.1180 0.01 200 0.1332 0.0122 0.005 400 0.1132 0.0062 0.0025 800 0.0683 0.0062
Error estimates for Ex. 5.2 a) for Runge-Kutta meth. of order 1 and 2
 h $N_{\mathcal{R}}$ set-valued Euler method set-valued Heun method 0.04 50 0.2330 0.2265 0.02 100 0.1681 0.1180 0.01 200 0.1149 0.0122 0.005 400 0.0753 0.0062 0.0025 800 0.0318 0.0062
 h $N_{\mathcal{R}}$ set-valued Euler method set-valued Heun method 0.04 50 0.2330 0.2265 0.02 100 0.1681 0.1180 0.01 200 0.1149 0.0122 0.005 400 0.0753 0.0062 0.0025 800 0.0318 0.0062
Error estimates for Example 5.3 for methods of order 1 and 2
 h Euler scheme & Riemann sum Heun's scheme & trapezoid rule 0.05 0.170 0.1153 0.025 0.095 0.0470 0.0125 0.0599 0.0133 0.00625 0.0285 0.0032
 h Euler scheme & Riemann sum Heun's scheme & trapezoid rule 0.05 0.170 0.1153 0.025 0.095 0.0470 0.0125 0.0599 0.0133 0.00625 0.0285 0.0032
Error estimates for Example 5.5 with set-valued methods of order 1 and 2
 h $N_{\mathcal{R}}$ set-valued Euler scheme set-valued Heun's scheme 0.5 50 0.0848 0.1461 0.1 100 0.0060 0.0076 0.05 200 0.0015 0.0020 0.025 400 0.00042 0.000502 0.0125 800 0.000108 0.000126
 h $N_{\mathcal{R}}$ set-valued Euler scheme set-valued Heun's scheme 0.5 50 0.0848 0.1461 0.1 100 0.0060 0.0076 0.05 200 0.0015 0.0020 0.025 400 0.00042 0.000502 0.0125 800 0.000108 0.000126
 [1] Shasha Hu, Yihong Xu, Yuhan Zhang. Second-Order characterizations for set-valued equilibrium problems with variable ordering structures. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020164 [2] Baoli Yin, Yang Liu, Hong Li, Zhimin Zhang. Approximation methods for the distributed order calculus using the convolution quadrature. Discrete & Continuous Dynamical Systems - B, 2021, 26 (3) : 1447-1468. doi: 10.3934/dcdsb.2020168 [3] Lars Grüne, Roberto Guglielmi. On the relation between turnpike properties and dissipativity for continuous time linear quadratic optimal control problems. Mathematical Control & Related Fields, 2021, 11 (1) : 169-188. doi: 10.3934/mcrf.2020032 [4] Bin Wang, Lin Mu. Viscosity robust weak Galerkin finite element methods for Stokes problems. Electronic Research Archive, 2021, 29 (1) : 1881-1895. doi: 10.3934/era.2020096 [5] Wolfgang Riedl, Robert Baier, Matthias Gerdts. Optimization-based subdivision algorithm for reachable sets. Journal of Computational Dynamics, 2021, 8 (1) : 99-130. doi: 10.3934/jcd.2021005 [6] Wenbin Li, Jianliang Qian. Simultaneously recovering both domain and varying density in inverse gravimetry by efficient level-set methods. Inverse Problems & Imaging, , () : -. doi: 10.3934/ipi.2020073 [7] Tetsuya Ishiwata, Takeshi Ohtsuka. Numerical analysis of an ODE and a level set methods for evolving spirals by crystalline eikonal-curvature flow. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 893-907. doi: 10.3934/dcdss.2020390 [8] Yuyuan Ouyang, Trevor Squires. Some worst-case datasets of deterministic first-order methods for solving binary logistic regression. Inverse Problems & Imaging, 2021, 15 (1) : 63-77. doi: 10.3934/ipi.2020047 [9] Awais Younus, Zoubia Dastgeer, Nudrat Ishaq, Abdul Ghaffar, Kottakkaran Sooppy Nisar, Devendra Kumar. On the observability of conformable linear time-invariant control systems. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020444 [10] Philippe G. Ciarlet, Liliana Gratie, Cristinel Mardare. Intrinsic methods in elasticity: a mathematical survey. Discrete & Continuous Dynamical Systems - A, 2009, 23 (1&2) : 133-164. doi: 10.3934/dcds.2009.23.133 [11] Lars Grüne, Matthias A. Müller, Christopher M. Kellett, Steven R. Weller. Strict dissipativity for discrete time discounted optimal control problems. Mathematical Control & Related Fields, 2020  doi: 10.3934/mcrf.2020046 [12] Elimhan N. Mahmudov. Infimal convolution and duality in convex optimal control problems with second order evolution differential inclusions. Evolution Equations & Control Theory, 2021, 10 (1) : 37-59. doi: 10.3934/eect.2020051 [13] Jingrui Sun, Hanxiao Wang. Mean-field stochastic linear-quadratic optimal control problems: Weak closed-loop solvability. Mathematical Control & Related Fields, 2021, 11 (1) : 47-71. doi: 10.3934/mcrf.2020026 [14] Predrag S. Stanimirović, Branislav Ivanov, Haifeng Ma, Dijana Mosić. A survey of gradient methods for solving nonlinear optimization. Electronic Research Archive, 2020, 28 (4) : 1573-1624. doi: 10.3934/era.2020115 [15] Xing-Bin Pan. Variational and operator methods for Maxwell-Stokes system. Discrete & Continuous Dynamical Systems - A, 2020, 40 (6) : 3909-3955. doi: 10.3934/dcds.2020036 [16] Gang Luo, Qingzhi Yang. The point-wise convergence of shifted symmetric higher order power method. Journal of Industrial & Management Optimization, 2021, 17 (1) : 357-368. doi: 10.3934/jimo.2019115 [17] Tomasz Szostok. Inequalities of Hermite-Hadamard type for higher order convex functions, revisited. Communications on Pure & Applied Analysis, , () : -. doi: 10.3934/cpaa.2020296 [18] Vito Napolitano, Ferdinando Zullo. Codes with few weights arising from linear sets. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020129 [19] Hyung-Chun Lee. Efficient computations for linear feedback control problems for target velocity matching of Navier-Stokes flows via POD and LSTM-ROM. Electronic Research Archive, , () : -. doi: 10.3934/era.2020128 [20] Chungang Shi, Wei Wang, Dafeng Chen. Weak time discretization for slow-fast stochastic reaction-diffusion equations. Discrete & Continuous Dynamical Systems - B, 2021  doi: 10.3934/dcdsb.2021019

2019 Impact Factor: 0.857