Because contraction analysis stems from a differential and incremental framework, the nature and methodology of contraction-based proofs are significantly different from those of their Lyapunov-based counterparts. This paper specifically studies this issue, and illustrates it by revisiting some classical examples traditionally addressed using Lyapunov theory. Even in these cases, contraction tools can often yield significantly simplified analysis. The examples include adaptive control, robotics, and a proof of convergence of the deterministic extended Kalman filter.
|Titel||Proceedings of the IEEE Conference on Decision and Control|
|Status||Udgivet - 2004|
- Teknik, ingeniørvidenskab og IT