No abstract

A general purpose chaos control algorithm based on reinforcement learning is introduced and applied to the stabilization of unstable periodic orbits in various chaotic systems and to the targeting problem. The algorithm does not require any information about the dynamical system nor about the location of periodic orbits. Numerical tests demonstrate good and fast performance under noisy and nonstationary conditions. (c) 1999 American Institute of Physics.

No abstract

In this paper the control of a periodically kicked mechanical rotor without gravity in the presence of noise is investigated. In recent work it was demonstrated that this system possesses many competing attracting states and thus shows the characteristics of a complex multistable system. We demonstrate that it is possible to stabilize the system at a desired attracting state even in the presence of high noise level. The control method is based on a recently developed algorithm [S. Gadaleta and G. Dangelmayr, Chaos 9, 775 (1999)] for the control of chaotic systems and applies reinforcement learning to find a global optimal control policy directing the system from any initial state towards the desired state in a minimum number of iterations. Being data-based, the method does not require any information about governing dynamical equations.

Batch maximum likelihood (ML) and maximum a posteriori (MAP) estimation with process noise is now more than thirty-five years old, and its use in multiple target tracking has long been considered to be too computationally intensive for real-time applications. While this may still be true for general usage, it is ideally suited for special needs such as bias estimation, track initiation and spawning, long-term prediction of track states, and state estimation during periods of rapidly changing target dynamics. In this paper, we examine the batch estimator formulation for several cases: nonlinear and linear models, with and without a prior state estimate (MAP vs. ML), and with and without process noise. For the nonlinear case, we show that a single pass of an extended Kalman smoother-filter over the data corresponds to a Gauss-Newton step of the corresponding nonlinear least-squares problem. Even the iterated extended Kalman filter can be viewed within this framework. For the linear case, we develop a compact least squares solution that can incorporate process noise and the prior state when available. With these new views on the batch approach, one may reconsider its usage in tracking because it provides a robust framework for the solution of the aforementioned problems. Finally, we provide some examples comparing linear batch initiation with and without process noise to show the value of the new approach.