FINITE TIME MODEL MATCHING FOR TIME-DELAY SYSTEMS

This papers addresses an approximative version of the exact model matching problem for time-delay systems. The problem is the following: let be given a plant T(s) and a model Tm(s), two stable and realizable time-delay transfer functions. Find a realizable precompensator R(s) such that the matching error E(s) = Tm(s) - T(s)R(s) is the Laplace transform of an operator with bounded support. A parametrization of all precompensators that achieve this objective is done, and a constructive procedure to compute them is detailed. Then, a relationship with an optimization problem in the sense of the L∞-induced norm is described.