Optimal Pole Placement for LTI-TDS via Some Advanced Iterative Algorithms - Part I: Theory

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F12%3A43868715" target="_blank" >RIV/70883521:28140/12:43868715 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal Pole Placement for LTI-TDS via Some Advanced Iterative Algorithms - Part I: Theory

Popis výsledku v původním jazyce

This paper is focused on optimal pole assignment for control feedback systems with delays in the dynamics which usually appear when a plant contains delays. Generally, a system with internal delays, also called time-delay, has an infinite spectrum thus it is not possible to place all feedback poles to the prescribed positions exactly by a finite number of free (controller) parameters. We concentrate on algebraic control of time-delay systems in a special ring resulting in delayed controllers as well. The pole placement problem is translated to the minimization of the spectral abscissa which is a nonsmooth nonconvex function of free parameters in many cases. Due to these negative features, we utilize and compare four advanced iterative algorithms; namely, Quasi-Continuous Shifting Algorithm, Nelder-Mead algorithm, Extended Gradient Sampling Algorithm and Self-Organizing Migration Algorithm. This first-part, introductory, paper deals with a general description of the algorithms and their

Název v anglickém jazyce

Optimal Pole Placement for LTI-TDS via Some Advanced Iterative Algorithms - Part I: Theory

Popis výsledku anglicky

This paper is focused on optimal pole assignment for control feedback systems with delays in the dynamics which usually appear when a plant contains delays. Generally, a system with internal delays, also called time-delay, has an infinite spectrum thus it is not possible to place all feedback poles to the prescribed positions exactly by a finite number of free (controller) parameters. We concentrate on algebraic control of time-delay systems in a special ring resulting in delayed controllers as well. The pole placement problem is translated to the minimization of the spectral abscissa which is a nonsmooth nonconvex function of free parameters in many cases. Due to these negative features, we utilize and compare four advanced iterative algorithms; namely, Quasi-Continuous Shifting Algorithm, Nelder-Mead algorithm, Extended Gradient Sampling Algorithm and Self-Organizing Migration Algorithm. This first-part, introductory, paper deals with a general description of the algorithms and their

Druh

D - Stať ve sborníku

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

<a href="/cs/project/ED2.1.00%2F03.0089" target="_blank" >ED2.1.00/03.0089: Centrum bezpečnostních, informačních a pokročilých technologií (CEBIA-Tech)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 16th WSEAS International Conference on Systems

ISBN

978-1-61804-108-1

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

196-201

Název nakladatele

WSEAS Press (GR)

Místo vydání

Kos

Místo konání akce

Kos Island

Datum konání akce

14. 7. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—