Combinatorial problem arising in chaotic control (Q1886200)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial problem arising in chaotic control |
scientific article |
Statements
Combinatorial problem arising in chaotic control (English)
0 references
16 November 2004
0 references
For nonlinear discrete time control systems, the problem to reach a given subset of the state space is considered when an optimality criterion involving the states and the controls is satisfied. A discretization of the state space leads to a discrete optimization problem on a directed graph. Then a variant of Dijkstra's algorithm is used to compute the set of Pareto optima. The complexity of this optimization problem is analyzed. Two numerical experiments are documented.
0 references
chaos control
0 references
complexity
0 references
discretization
0 references