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

DOI10.3934/MCRF.2019012zbMATH Open1425.93030arXiv1805.02507OpenAlexW2800088212WikidataQ128914503 ScholiaQ128914503MaRDI QIDQ2329686FDOQ2329686

Authors: R. Baier, Thuy T. T. Le 

Publication date: 18 October 2019

Published in: Mathematical Control and Related Fields (Search for Journal in Brave)

Abstract: 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., Holder continuity) 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 Holder continuous or even discontinuous.

Full work available at URL: https://arxiv.org/abs/1805.02507

Recommendations

• Higher order discrete controllability and the approximation of the minimum time function
• scientific article; zbMATH DE number 4163606
• Approximation of the optimal-time problem for controlled differential inclusions
• A numerical method for reachable sets of linear control systems
• On the Time-Discretization of Control Systems

zbMATH Keywords

minimum time functionreachable setsdirect discretization methodshigher-order set-valued methodslinear control problems

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Linear systems in control theory (93C05)

Cites Work

• Second order conditions for the controllability of nonlinear systems with drift
• Higher order discrete controllability and the approximation of the minimum time function
• Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
• An Approximation Scheme for the Minimum Time Function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal control of ODEs and DAEs.
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
• Error estimates for discretized differential inclusions
• Dynamics and control of trajectory tubes. Theory and computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integrals of set-valued functions
• Reachability Analysis of Hybrid Systems Using Support Functions
• Approximations of linear control problems with bang-bang solutions
• Viability Theory
• Minimum time control problems for non-autonomous differential equations
• The Exponential Formula for the Reachable Set of a Lipschitz Differential Inclusion
• On the Separation and Order Law of Cancellation for Bounded Sets
• Approximation of reachable sets by direct solution methods for optimal control problems
• Functional analysis and time optimal control
• Some New Regularity Properties for the Minimal Time Function
• Non-Lipschitz points and the \(SBV\) regularity of the minimum time function
• Title not available (Why is that?)
• Hybrid Systems: Computation and Control
• Approximation of the viability kernel
• Second-Order Discrete Approximation to Linear Differential Inclusions
• Parametrizations of integrals of set-valued mappings and applications
• On the Bellman function for the time-optimal process problem
• Moduli of smoothness of vector valued functions of a real variable and applications
• Numerical Analysis and Its Applications
• Hausdorff distance and convex sets
• Title not available (Why is that?)
• A double-sided dynamic programming approach to the minimum time problem and its numerical approximation
• Title not available (Why is that?)

Cited In (2)

• Higher order discrete controllability and the approximation of the minimum time function
• Time-minimal set point transition for nonlinear SISO systems under different constraints

This page was built for publication: Construction of the minimum time function for linear systems via higher-order set-valued methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329686)