SLIDE 6 in (17); it can be downloaded from the author’s web site: www.ece.ohio-state.edu/˜ozbay search for HINFCON under research heading. At the MTNS06 basic features of this program will be demonstrated. With respect to the above controller formula, first point to note is that the spectral factorization in question is finite dimensional and the order of Fγ is at most the order of W1 plus the order of W2. Secondly, L(s) is characterized by its 2(n1 + ℓ) coefficients, and the interpolation conditions (19) can be re-written as Rγ Φ = 0 (20) where the entries of the 2(n1 +ℓ)×1 vector Φ contain the coefficients of L1 and L2, and the 2(n1 + ℓ) × 2(n1 + ℓ) matrix Rγ is constructed from Mn(s), F(s) and βi, αk, for i = 1, . . . , n1 and k = 1, . . . , ℓ. Clearly, explicit computation of Mn(s) is not necessary for the construction
- f Rγ; all we need is its values at βi’s and αk’s. See [42]
for more detailed discussion of this point and further ref-
- erences. Due to symmetry in the interpolation conditions,
L(s) term in the optimal controller satisfies |L(jω)| = 1, but it may or may not be stable. The final observation we make, probably the most important one from the point of view of “controller implementation,” is that the controller has internal unstable pole-zero cancellations: the C+ zeros of Eγo and Md are cancelled by the zeros of 1 + Mn(s)Fγo(s)L(s). Since Mn is infinite dimensional, e.g. time delay, exact cancellation is not always possible. For this reason, these cancellations should be studied in more detail and a new equivalent structure, which can be implemented in a stable manner, should be investigated, see [60] for a discussion of this problem within the framework
- f general time delay systems. In this context, the optimal
controller for the plant P3 given above will be presented at the MTNS2006; it will be an example taken from [60]. Time permitting, a discussion on optimal H∞ controllers for plants P2, [39], [111], and P4, [84], [85], will also be
- included. Here we illustrate the optimal H∞ controller for
P1, with the mixed sensitivity problem weights W1(s) = 1 + ǫs s + ǫ W2(s) = k(1 + ατps). In this case the plant is stable, so ℓ = 0, and W1 is first
- rder, so n1 = 1, and thus n1 + ℓ − 1 = 0, which means
that L(s) is just a constant, +1 or −1. We have only one linear equation to form, and that gives γo. When we let ǫ → 0, we obtain γo as the largest root of the equation
- 1 − (k/γ)2 − kατp/γ2 − sin(h/γ) = 0
in the interval
2h π
≤ γ < ∞. It can be shown that, [133], the optimal H∞ controller has an “internal model controller” structure Copt = Qopt 1 − P(s)Qopt Qopt = Qo 1 + FoQo where Qo(s) = k 1 + ατps γos Fo(s) = 1 1 + ατps γs(sin(h/γo) + γs cos(h/γ)) + e−hs 1 + (γs)2 When the time delay, h, is “relatively small,” we have Fo(s) ≈
1 1+ατps, and then the closed loop transfer function
from r to y, is T (s) ≈ e−hs 1 + τcls where τcl = αkτp/γ is the approximate closed loop time constant.
In this section we present two applications of robust con- trol theory for infinite dimensional systems. Both problems involve plant models with time delays.
- A. Flow Control in Data Communication Networks
There are interesting control problems in communication networks, due to time varying time delays, [102]. To illustrate the main underlying difficulty, let us consider a generic data communication set-up shown in Figure 4. The senders adjust their packet sending rates based on the acknowledgment signals transmitted by the receivers.
Link Senders Receivers Network Congested
Generic data communication network.
Using fluid flow approximation, the queue at the bottle- neck (congested) link evolves according to ˙ q(t) = rin(t) − c(t) where rin(t) is the incoming data packet flow rate and c(t) is the outgoing flow rate (available capacity of the link). As the packets pass through the network, they reach their destination with a forward time delay hf(t) = hp + q(t)
c(t),
where hp is the propagation delay in the forward path, and
q(t) c(t) is the queueing delay. Once the packets are
received, acknowledgments are sent back; assuming they pass through the same network, with a separate buffer, which is almost always empty, the backward delay is hb ≈ hp. So, we define the return-trip-time RTT (t) = h(t) = 2hp + q(t)
c(t). Typically, the input flow rate is
set by the controller as a function of the “congestion information” relayed to the controller, delayed by h(t). In other words, we may assume that rin(t) = rc(t−h(t)), where rc(t) is the assigned flow rate at time t (i.e. output
- f the controller). Thus, we have different plant models,
depending on how this congestion information (feedback)