"Porovn\u00E1n\u00ED GPC \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm a jeho korigovan\u00E9 varianty za pou\u017Eit\u00ED Smithova prediktoru" . "2"^^ . . "RIV/70883521:28140/12:43868380" . . "RIV/70883521:28140/12:43868380!RIV13-MSM-28140___" . . . . "Comparison of GPC Control of Processes with Time Delay and its Corrected Variant Using the Smith Predictor"@en . . "Porovn\u00E1n\u00ED GPC \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm a jeho korigovan\u00E9 varianty za pou\u017Eit\u00ED Smithova prediktoru"@cs . . . "GPC control, time delay system, Smith predictor"@en . . . . "S" . "159742" . . "[34B6B7426DA0]" . "The specificity of the variant of predictive control GPC (Generalized Predictive Control) has been discussed in previous articles on this specialized portal. The other unusual advantages of GPC is the control of processes with time delay, which other approaches rarely offer. This is unusually easy and that only by increasing the parameter of minimal horizon equal to one plus transport delay. This approach is very appealing. This article aims to examine this possibility on the site of efficiency, if is not better to use the option, where is at first the time delay corrected and then its control by classical GPC algorithm. The connection with time delay correction is known as the Smith predictor. Simulation results can be helpful to readers in choosing one of these two variants and that from the view of quality of control or more acceptable connection scheme."@en . . "Comparison of GPC Control of Processes with Time Delay and its Corrected Variant Using the Smith Predictor"@en . "2"^^ . "Kubal\u010D\u00EDk, Marek" . "http://www.posterus.sk/?p=13488" . "Porovn\u00E1n\u00ED GPC \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm a jeho korigovan\u00E9 varianty za pou\u017Eit\u00ED Smithova prediktoru"@cs . . "O specifi\u010Dnosti varianty GPC prediktivn\u00EDho \u0159\u00EDzen\u00ED (Generalized Predictive Control) bylo pojedn\u00E1no v p\u0159edchoz\u00EDch \u010Dl\u00E1nc\u00EDch na tomto odborn\u00E9m port\u00E1le. Mezi dal\u0161\u00ED nezvykl\u00E9 v\u00FDhody GPC je \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm, jen\u017E jin\u00E9 p\u0159\u00EDstupy m\u00E1lokdy nab\u00EDz\u00ED. To je neobvykle snadn\u00E9, a to pouze nav\u00FD\u0161en\u00EDm parametru minim\u00E1ln\u00EDho horizontu na hodnotu jedna plus dopravn\u00ED zpo\u017Ed\u011Bn\u00ED. Tento p\u0159\u00EDstup je velice l\u00E1kav\u00FD. C\u00EDlem \u010Dl\u00E1nku je tuto mo\u017Enost prov\u011B\u0159it po str\u00E1nce efektivnosti, jestli nen\u00ED lep\u0161\u00ED pou\u017E\u00EDt variantu, kdy je nejprve zkorigov\u00E1no samotn\u00E9 dopravn\u00ED zpo\u017Ed\u011Bn\u00ED u procesu a pak jeho \u0159\u00EDzen\u00ED klasick\u00FDm GPC algoritmem. Zapojen\u00ED s korekc\u00ED dopravn\u00EDho zpo\u017Ed\u011Bn\u00ED je zn\u00E1m\u00E9 jako Smith\u016Fv prediktor. V\u00FDsledky simulac\u00ED mohou b\u00FDt \u010Dten\u00E1\u0159i n\u00E1pomocny p\u0159i volb\u011B jedn\u00E9 z t\u011Bchto dvou variant, a to z pohledu kvality \u0159\u00EDzen\u00ED nebo p\u0159ijateln\u011Bj\u0161\u00EDho sch\u00E9matu zapojen\u00ED."@cs . . "Porovn\u00E1n\u00ED GPC \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm a jeho korigovan\u00E9 varianty za pou\u017Eit\u00ED Smithova prediktoru" . "Barot, Tom\u00E1\u0161" . . "28140" . "O specifi\u010Dnosti varianty GPC prediktivn\u00EDho \u0159\u00EDzen\u00ED (Generalized Predictive Control) bylo pojedn\u00E1no v p\u0159edchoz\u00EDch \u010Dl\u00E1nc\u00EDch na tomto odborn\u00E9m port\u00E1le. Mezi dal\u0161\u00ED nezvykl\u00E9 v\u00FDhody GPC je \u0159\u00EDzen\u00ED proces\u016F s dopravn\u00EDm zpo\u017Ed\u011Bn\u00EDm, jen\u017E jin\u00E9 p\u0159\u00EDstupy m\u00E1lokdy nab\u00EDz\u00ED. To je neobvykle snadn\u00E9, a to pouze nav\u00FD\u0161en\u00EDm parametru minim\u00E1ln\u00EDho horizontu na hodnotu jedna plus dopravn\u00ED zpo\u017Ed\u011Bn\u00ED. Tento p\u0159\u00EDstup je velice l\u00E1kav\u00FD. C\u00EDlem \u010Dl\u00E1nku je tuto mo\u017Enost prov\u011B\u0159it po str\u00E1nce efektivnosti, jestli nen\u00ED lep\u0161\u00ED pou\u017E\u00EDt variantu, kdy je nejprve zkorigov\u00E1no samotn\u00E9 dopravn\u00ED zpo\u017Ed\u011Bn\u00ED u procesu a pak jeho \u0159\u00EDzen\u00ED klasick\u00FDm GPC algoritmem. Zapojen\u00ED s korekc\u00ED dopravn\u00EDho zpo\u017Ed\u011Bn\u00ED je zn\u00E1m\u00E9 jako Smith\u016Fv prediktor. V\u00FDsledky simulac\u00ED mohou b\u00FDt \u010Dten\u00E1\u0159i n\u00E1pomocny p\u0159i volb\u011B jedn\u00E9 z t\u011Bchto dvou variant, a to z pohledu kvality \u0159\u00EDzen\u00ED nebo p\u0159ijateln\u011Bj\u0161\u00EDho sch\u00E9matu zapojen\u00ED." .