TBU Publications
Repository of TBU Publications

On the optimal pole assignment for time-delay systems

DSpace Repository

Show simple item record

dc.title On the optimal pole assignment for time-delay systems en
dc.contributor.author Pekař, Libor
dc.relation.ispartof International Journal of Mathematical Models and Methods in Applied Sciences
dc.identifier.issn 1998-0140 Scopus Sources, Sherpa/RoMEO, JCR
dc.date.issued 2013
utb.relation.volume 7
utb.relation.issue 1
dc.citation.spage 63
dc.citation.epage 74
dc.type article
dc.language.iso en
dc.publisher North Atlantic University Union (NAUN) en
dc.relation.uri http://www.naun.org/multimedia/NAUN/ijmmas/16-603.pdf
dc.subject Artificial intelligence en
dc.subject Iterative algorithms en
dc.subject Optimization en
dc.subject Pole placement en
dc.subject Spectral abscissa en
dc.subject Time-delay systems en
dc.description.abstract The well-known fact about linear time-invariant timedelay systems (LTI-TDS) is that these systems have an infinite spectrum. Not only plants themselves but also the whole control feedbacks then have this undesirable feature in most cases. The aim of this contribution is to present algebraic controller design in a special ring of proper and stable meromorphic functions followed by an optimal pole assignment minimizing the spectral abscissa. The main problem is how to place feedback poles to the prescribed positions exactly by a finite number of free (controller) parameters. Clearly, it is not possible to place all poles but the idea is to push the rightmost ones as left as possible, which gives rise to the task of the spectral abscissa minimization. The spectral abscissa is a nonsmooth nonconvex function of free controller parameters in general. Moreover, there is a problem of its sensitivity to infinitesimally small delay changes. Four advanced iterative algorithms; namely, Quasi- Continuous Shifting Algorithm, Nelder-Mead algorithm, Extended Gradient Sampling Algorithm and Self-Organizing Migration Algorithm, are described as a possible numerical tools when minimization. Only two of them have already been used for the spectral abscissa minimization and none of them with the combination with algebraic controller design. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1003086
utb.identifier.obdid 43869895
utb.identifier.scopus 2-s2.0-84872148858
utb.source j-scopus
dc.date.accessioned 2013-02-02T01:12:47Z
dc.date.available 2013-02-02T01:12:47Z
utb.contributor.internalauthor Pekař, Libor
utb.fulltext.affiliation L. Pekař is with the Tomas Bata University in Zlín, Faculty of Applied Informatics, nám. T. G. Masaryka 5555, 76001 Zlín, Czech Republic (corresponding author to provide phone: +420576035161; e-mail: pekar@fai.utb.cz).
utb.fulltext.dates -
utb.fulltext.sponsorship The author kindly appreciates the financial support which was provided by the Ministry of Education, Youth and Sports of the Czech Republic by the European Regional Development Fund under the project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089.
utb.fulltext.projects CZ.1.05/2.1.00/03.0089
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.ou -
Find Full text

Files in this item

Show simple item record