Abstract

A numerical method for the approximation of reachable sets of linear control systems is discussed. The method is based on the formulation of suitable optimal control problems with varying objective function, whose discretization by Runge–Kutta methods leads to finite-dimensional convex optimization problems. It turns out that the order of approximation for the reachable set depends on the particular choice of the Runge–Kutta method in combination with the selection strategy used for control approximation. For an inappropriate combination, the expected order of convergence cannot be achieved in general. The method is illustrated by two test examples using different Runge–Kutta methods and selection strategies, in which the run times are analysed, the order of convergence is estimated numerically and compared with theoretical results in similar areas.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.