Approximating Reachable Sets for n-dimensional Linear Discrete Systems |
| |
| Authors: | GAYEK JONATHAN E; FISHER MICHAEL E |
| |
| Institution: |
1Department of Mathematics, Trinity University San Antonio, Texas, 78284, U.S.A.
2Department of Mathematics, University of Western Australia Nedlands, Western Australia 6009
|
| |
| Abstract: | We present a technique for approximating the reachable set fromthe origin for n-dimensional discrete-time linear systems subjectto bounded control, where the state matrix is stable and diagonalizable.The procedure is based on decomposing the system into one- andtwo-dimensional subsystems for which the reachable set of eachof the subsystems can be over-estimated by a polygon. Thesepolygons are then used to create an n-dimensional polyhedronwhich contains the reachable set of the original system |
| |
| Keywords: | Reachable set linear discrete systems bounded control decomposition |
| 本文献已被 Oxford 等数据库收录！ |
|
