TY - JOUR

T1 - Optimal targeting of chaos

AU - Bollt, Erik M.

AU - Kostelich, Eric

PY - 1998/8/24

Y1 - 1998/8/24

N2 - Standard graph theoretic algorithms are applied to chaotic dynamical systems to identify orbits that are optimal relative to a prespecified cost function. We reduce the targeting problem to the problem of finding optimal paths through a graph. Numerical experiments on one-dimensional maps suggest that periodic saddle orbits of low period are typically less expensive to target (relative to a family of smooth cost functions) than periodic saddle orbits of high period.

AB - Standard graph theoretic algorithms are applied to chaotic dynamical systems to identify orbits that are optimal relative to a prespecified cost function. We reduce the targeting problem to the problem of finding optimal paths through a graph. Numerical experiments on one-dimensional maps suggest that periodic saddle orbits of low period are typically less expensive to target (relative to a family of smooth cost functions) than periodic saddle orbits of high period.

UR - http://www.scopus.com/inward/record.url?scp=0043096887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0043096887&partnerID=8YFLogxK

U2 - 10.1016/S0375-9601(98)00270-9

DO - 10.1016/S0375-9601(98)00270-9

M3 - Article

AN - SCOPUS:0043096887

VL - 245

SP - 399

EP - 406

JO - Physics Letters, Section A: General, Atomic and Solid State Physics

JF - Physics Letters, Section A: General, Atomic and Solid State Physics

SN - 0375-9601

IS - 5

ER -