Name
Abstract | ||
|---|---|---|
Two algorithms for solving a specific class of steady-state control problems for Timed Event Graphs are presented. In the first, asymptotic convergence to the desired set is guaranteed. The second algorithm, which builds on from the recent developments in the spectral theory of min-max functions, guarantees Lyapunov stability since the distance between the actual state and the desired set never increases. Simulation results show the efficiency of the proposed approach in a problem of moderate complexity. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TAC.2015.2481798 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Games,Steady-state,Algebra,Linear matrix inequalities,Chebyshev approximation,Trajectory,Convergence | Convergence (routing),Graph,Spectral theory,Mathematical optimization,Control theory,Approximation theory,Lyapunov stability,Steady state,Mathematics,Trajectory | Journal |
Volume | Issue | ISSN |
61 | 8 | 0018-9286 |
Citations | PageRank | References |
4 | 0.40 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vinicius Mariano Gonçalves | 1 | 10 | 4.65 |
| Carlos A. Maia | 2 | 92 | 11.52 |
| Laurent Hardouin | 3 | 171 | 28.97 |