Name
Abstract | ||
|---|---|---|
This paper proposes a computational method for the feasibility check and design of discrete abstract models of nonlinear dynamical systems. First, it is shown that a given discrete-time dynamical system can be transformed into a finite automaton by embedding a quantizer into its state equation. Under this setting, a sufficient condition for approximate bisimulation in infinite steps of time between the concrete model and its discrete abstract model is derived. The condition takes the form of a set of linear inequalities and thus can be checked efficiently by a linear programming solver. Finally, the iterative refinement algorithm, which generates a discrete abstract model under a given error specification, is proposed. The algorithm is guaranteed to terminate in finite iterations. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TAC.2011.2161789 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Approximation methods,Computational modeling,Concrete,Trajectory,Quantization,Mathematical model,Aerospace electronics | Iterative refinement,Mathematical optimization,Nonlinear system,Iterative method,Finite-state machine,Linear programming,Solver,Mathematics,Discrete system,Dynamical system | Journal |
Volume | Issue | ISSN |
57 | 3 | 0018-9286 |
Citations | PageRank | References |
13 | 0.67 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuichi Tazaki | 1 | 76 | 10.74 |
| Jun-ichi Imura | 2 | 285 | 51.71 |