Abstract
The unique characteristic of a repetitive process is a series of sweeps or passes through a set of dynamics defined over a finite duration known as the pass length. At the end of each pass, the process is reset and the next time through the output, or pass profile, produced on the previous pass acts as a forcing function on, and hence contributes to, the dynamics of the new pass profile. They are hence a class of systems where a variable must be expressed in terms of two directions of information propagation (from pass-to-pass and along a pass, respectively) where the dynamics over the finite pass length are described by a matrix linear differential equation and from pass to pass by a discrete updating structure. This means that filtering/estimation theory/algorithms for, in particular, 2D discrete linear systems is not applicable. In this paper, we solve a general robust filtering problem with a view towards use in many applications where such an action will be required.
| Original language | English |
|---|---|
| Pages (from-to) | 243-265 |
| Number of pages | 23 |
| Journal | International Journal of Adaptive Control and Signal Processing |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| State | Published - Apr 2008 |
Keywords
- Differential linear repetitive processes
- Linear matrix inequalities (LMI)
- Uncertainty
- ℋ filtering
Fingerprint
Dive into the research topics of 'Robust ℋ∞ filtering for uncertain differential linear repetitive processes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver