A robust line search for learning control

In this paper a new line search for a Newton-Raphson learning control algorithm is presented. Theorems and rigorous proofs of its increased robustness over existing line searches are provided, and numerical examples are used to further validate the theorems. Also, the previously posed open question of whether robust optimal trajectory learning is possible is also addressed. It is shown that the answer is generally no, at least for gradient-based learning control algorithms