Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

A linear programming approach to approximating infinite time reachable sets of strictly stable linear control systems

Title data

Ernst, Andreas ; Grüne, Lars ; Rieger, Janosch:
A linear programming approach to approximating infinite time reachable sets of strictly stable linear control systems.
Melbourne , 2019 . - 15 p.

Official URL: Volltext

Abstract in another language

We develop a new numerical method for approximating infinite time reachable sets of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with fixed facet normals as an outer approximation of the limit set. In particular, this approach does not rely on forward iteration of finite-time reachable sets.

Further data

Item Type: Preprint, postprint, working paper, discussion paper
Refereed: Yes
Keywords: reachable set; limit set; discrete-time linear systems; numerical approximation; polytopes; linear optimization
Institutions of the University: Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics V (Applied Mathematics)
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics V (Applied Mathematics) > Chair Mathematics V (Applied Mathematics) - Univ.-Prof. Dr. Lars Grüne)
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Applied Mathematics (Applied Mathematics)
Result of work at the UBT: Yes
DDC Subjects: 500 Science > 510 Mathematics
Date Deposited: 20 Feb 2019 08:49
Last Modified: 14 Mar 2019 13:32
URI: https://eref.uni-bayreuth.de/id/eprint/47496