A velocity algorithm for the implementation of gain-scheduled controllers (Q1899611): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:09, 5 March 2024

scientific article
Language Label Description Also known as
English
A velocity algorithm for the implementation of gain-scheduled controllers
scientific article

    Statements

    A velocity algorithm for the implementation of gain-scheduled controllers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 1996
    0 references
    Gain-scheduled controllers are effective means of controlling performances of dynamical systems which operate over a wide range of operating conditions. This paper presents a velocity (D-method) algorithm for implementation of gain-scheduled controllers for nonlinear plants. The need to differentiate some measured outputs, which may pose noise amplification problems, is indeed a weakness of this method. Also the global stability is difficult to guarantee due to the time-varying nature of the gain-scheduling operations. Before the stability issue is properly addressed, such a design method can at best be considered as an ad hoc procedure. Although it is difficult to tell how large the class of systems is to which this method is applicable, nevertheless this design method should be useful to some practical systems. The paper would be more interesting if some numerical examples and simulation results were included to illustrate its merits. More results concerning the stability of time-varying systems will be needed to make gain-scheduled controller design a formal design method.
    0 references
    D-method
    0 references
    velocity algorithm
    0 references
    nonlinear plants
    0 references
    gain-scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references