Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  generalized predictive control
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Self-tuning generalized predictive control with input constraints

100%
EN
The handling of various input constraints in the self-tuning generalized predictive control (STGPC) problem of ARIMAXARMAX systems is considered. The methods based on the Lagrange multipliers and Lemke's algorithm are used to solve the constrained optimization problem. A self-tuning controller is implemented in an indirect way, and the considered constraints imposed on the control input signal are of the rate, amplitude and energy types. A comparative simulation study of self-tuning control system behaviour is given with respect to the design parameters and constraints. The stability of a closed-loop control system is analyzed and the computational loads of both the methods are compared.
2
Content available remote

A multivariable multiobjective predictive controller

75%
EN
Predictive control of MIMO processes is a challenging problem which requires the specification of a large number of tuning parameters (the prediction horizon, the control horizon and the cost weighting factor). In this context, the present paper compares two strategies to design a supervisor of the Multivariable Generalized Predictive Controller (MGPC), based on multiobjective optimization. Thus, the purpose of this work is the automatic adjustment of the MGPC synthesis by simultaneously minimizing a set of closed loop performances (the overshoot and the settling time for each output of the MIMO system). First, we adopt the Weighted Sum Method (WSM), which is an aggregative method combined with a Genetic Algorithm (GA) used to minimize a single criterion generated by the WSM. Second, we use the NonDominated Sorting Genetic Algorithm II (NSGA-II) as a Pareto method and we compare the results of both the methods. The performance of the two strategies in the adjustment of multivariable predictive control is illustrated by a simulation example. The simulation results confirm that a multiobjective, Pareto-based GA search yields a better performance than a single objective GA.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.