1993
DOI: 10.1016/0005-1098(93)90129-h
|View full text |Cite
|
Sign up to set email alerts
|

Direct control design in sampled-data uncertain systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 10 publications
0
23
0
Order By: Relevance
“…In the last example, the computational superiority of the proposed method is shown by comparison with existing algorithms the number of floating point operations, flops, required for generating QFT bounds. Therefore, from (20), the solution set for the bivariate polynomial inequality corresponding to the edge E 1 is F = {g: g≥ 62.9952}. The solution sets for the remaining 12 bivariate polynomial inequalities corresponding to the 12 edges of the three-dimensional box B can be computed in the same manner.…”
Section: Illustrative Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…In the last example, the computational superiority of the proposed method is shown by comparison with existing algorithms the number of floating point operations, flops, required for generating QFT bounds. Therefore, from (20), the solution set for the bivariate polynomial inequality corresponding to the edge E 1 is F = {g: g≥ 62.9952}. The solution sets for the remaining 12 bivariate polynomial inequalities corresponding to the 12 edges of the three-dimensional box B can be computed in the same manner.…”
Section: Illustrative Examplesmentioning
confidence: 99%
“…However, these geometry based algorithms are inefficient. Recently, more efficient algorithms based on quadratic inequalities have been proposed [6,7,20]. These algorithms solve quadratic inequalities generated from the plant template of the plant to compute QFT bounds at a fixed frequency and controller phase.…”
Section: Introductionmentioning
confidence: 99%
“…For a rigorous extension of the QFT technique to sampled data systems see Yaniv and Chait (1993), whose technique includes algorithms to achieve closed loop specs on the sampled plant output, as well as on the continuous plant output.…”
Section: Notes and Referencesmentioning
confidence: 99%
“…The plant can be unstable (see Horowitz and Sidi 1972) or non-minimum-phas e (NMP) (see Sidi 1976, Horowitz andSidi 1978) and can be embedded in a sampled feedback system (see Sidi 1977, Horowitz and Liao 1986, Yaniv and Chait 1993 (1). d…s † is the disturbance function shown in ®gure 1.…”
Section: The Qft Design Techniquementioning
confidence: 99%