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.
|Original language||English (US)|
|Number of pages||8|
|Journal||Physics Letters, Section A: General, Atomic and Solid State Physics|
|State||Published - Aug 24 1998|
ASJC Scopus subject areas
- Physics and Astronomy(all)