Construction of the Minimum Time Function Via Reachable Sets of Linear Control Systems. Part 2: Numerical Computations

In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control 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.

No reviews yet.

No comments yet.