Combinatorial problem arising in chaotic control

DOI10.1080/10241230306730MaRDI QIDQ1886200zbMATH OpenOpenAlexFDO

Authors V. A. Bondarenko, J. Mustard, Alexei Pokrovskii

Publication date 16 November 2004

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10241230306730

zbMATH Keywords

chaos controlcomplexitydiscretization

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Dynamical systems in control (37N35) Nonlinear systems in control theory (93C10)

Review text

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.

Recommendations

• A set oriented approach to global optimal control
• scientific article; zbMATH DE number 434965
• Optimization of nonlinear discrete systems with finite set of controls
• scientific article; zbMATH DE number 175878
• scientific article; zbMATH DE number 3940096

Cited in

(2)

• A set oriented approach to global optimal control
• A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems

This page was built for publication: Combinatorial problem arising in chaotic control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886200)