• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.467-470
• /
• 1994

In this paper, we develop two sufficient conditions for Schur stability of convex combinations of discrete time polynomials. We give conditions under which Schur stability of the extremes implies Schur stability of the entire convex combination. These results are based on Bhattacharyya's result(1991), the AHMC theory in Barmish and Kang's paper (1993) and the bilinear transformation. Important applications of the results involves robust Schur stability of a feedback system having degenerate interval plants in an extreme point context.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.368-371
• /
• 1996

In this paper, a feedforward-plus-feedback control scheme is presented to prevent congestion in store-and-forward packet switching networks. The control scheme consists of two algorithms. Specifically, the input traffic adjustment algorithm employs a fairness policy such that the transmission rate of the input traffic is proportional to its offered rate. The control signal computation algorithms to ensure stability of the overall system in the robust sense and to ensure the desired transient behavior in the adaptive, with respect to variations of input traffic, are designed.