M. Malek-Zavarei and M. Jamshidi. Time-Delay Systems Analysis, Optimization, and Application. North-Holland, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....by intentionally introducing a delay on the other. 14 discrete time) systems and time delay systems. This analytic approach can be applied to obtain the value of a function f(t) between the sample times as well as to compute the discrete transfer function of a continuous system with time delay [5, 18]. Using this method, possible analytical error introduced by other methods (such as the Pade approximation) can be eliminated. Furthermore, the modified Z transform has the desirable properties of the standard Z transform such as linearity, final value theorem, etc. greatly simplifying the ....

....possible analytical error introduced by other methods (such as the Pade approximation) can be eliminated. Furthermore, the modified Z transform has the desirable properties of the standard Z transform such as linearity, final value theorem, etc. greatly simplifying the analysis of the system [18]. In this section, we describe how the modified Z transform can be used to analyze the closed loop behavior of our example system with time delays. Let the plant be a second order type I system with transfer function P (s) K s(s a) For the examples we consider in this paper, this transfer ....

[Article contains additional citation context not shown here]

M. Malek-Zavarei and M. Jamshidi. Time-Delay Systems Analysis, Optimization, and Application. North-Holland, 1987.

....can be chosen such that the inequality F F max holds. Notice: we are not concentrating here on the problem of stability: it is assumed that the gains K 1 p ; K 1 d ; K 2 p , and K 2 d can be determined, taking into account the effect of the time delays and sampling period, see e.g. [Malek Zavarei and Jamshidi, 1987].work) The values of ffi c and c will effect our ability to choose the above parameters to guarantee F Fmax . 5.3 Verification of Req 3 To verify Req 3 we must prove that the execution time of each phase is bounded and that the sum of the time bounds is less then T max , i.e. T max TG TL ....

Malek-Zavarei, M. and Jamshidi, M. (1987). Time-Delay Systems: analysis, optimization, and applications. Elsevier Science Pub. Co.

....of the system can be chosen such that the inequality F Fmax holds. We are not concentrating here on the problem of stability: it is assumed the the gains K 1 p ; K 1 d ; K 2 p , and K 2 d can be determined, taking into account the effect of the timedelays and sampling period [13]. Verification of Req 3 : To verify Req 3 we must prove that the execution time of each phase is bounded and that the sum of the time bounds is less then Tmax , i.e. Tmax TG TL TM TD . Here we prove only that the Grasp phase is bounded. Grasp is bounded, dGraspe ) TG follows because ....

M. Malek-Zavarei & M. Jamshidi. Time-Delay Systems: analysis, optimization, and applications. Elsevier Science Pub. Co., 1987.

....can be chosen such that the inequality F F max holds. Notice: we are not concentrating here on the problem of stability: it is assumed that the gains K 1 p ; K 1 d ; K 2 p , and K 2 d can be determined, taking into account the effect of the time delays and sampling period, see e.g. [Malek Zavarei and Jamshidi, 1987].work) The values of ffi c and c will effect our ability to choose the above parameters to guarantee F F max . 5.3 Verification of Req 3 To verify Req 3 we must prove that the execution time of each phase is bounded and that the sum of the time bounds is less then T max , i.e. T max TG ....

Malek-Zavarei, M. and Jamshidi, M. (1987). Time-Delay Systems: analysis, optimization, and applications. Elsevier Science Pub. Co.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC