Publikace UTB
Repozitář publikační činnosti UTB

PPSA: A tool for suboptimal control of time delay systems: Revision and open tasks

Repozitář DSpace/Manakin

Zobrazit minimální záznam


dc.title PPSA: A tool for suboptimal control of time delay systems: Revision and open tasks en
dc.contributor.author Pekař, Libor
dc.contributor.author Navrátil, Pavel
dc.relation.ispartof Modern Trends and Techniques in Computer Science (CSOC 2014)
dc.relation.ispartof Advances in Intelligent Systems and Computing
dc.identifier.issn 2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-331906739-1
dc.date.issued 2014
utb.relation.volume 285
dc.citation.spage 17
dc.citation.epage 28
dc.event.title 3rd Computer Science On-line Conference, CSOC 2014
dc.event.sdate 2014-04-28
dc.event.edate 2014-04-30
dc.type conferenceObject
dc.language.iso en
dc.publisher Springer-Verlag
dc.identifier.doi 10.1007/978-3-319-06740-7_2
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-319-06740-7_2
dc.subject Direct-search algorithms en
dc.subject Evolutionary algorithms en
dc.subject Gradient sampling algorithm en
dc.subject Model matching en
dc.subject Nelder-Mead algorithm en
dc.subject Optimization en
dc.subject Pole placement controller tuning en
dc.subject SOMA en
dc.subject Time delay systems en
dc.description.abstract Abstract During the development of algebraic controller design in a special ring for time delay systems (TDSs) a problem of a suitable free controller parameters setting appeared. The first author of this contribution recently suggested a natural idea of placing the dominant characteristic numbers (poles) and zeros of the infinite-dimensional feedback control system on the basis of the desired overshoot for a simple finite-dimensional matching model and shifting of the rest of the spectrum. However, the original procedure called the Pole-Placement Shifting based controller tuning Algorithm (PPSA) was not developed and described entirely well. The aim of this paper is to revise the idea of the PPSA and suggest a possible ways how to improve or extend the algorithm. A concise illustrative example is attached to clarify the procedure for the reader as well. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1004193
utb.identifier.obdid 43871590
utb.identifier.scopus 2-s2.0-84923803685
utb.identifier.wok 000370620000002
utb.source d-scopus
dc.date.accessioned 2015-05-06T06:58:19Z
dc.date.available 2015-05-06T06:58:19Z
utb.contributor.internalauthor Pekař, Libor
utb.contributor.internalauthor Navrátil, Pavel
utb.fulltext.affiliation Libor Pekař and Pavel Navrátil L. Pekař (&) P. Navrátil Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic e-mail: pekar@fai.utb.cz P. Navrátil e-mail: pnavratil@fai.utb.cz
utb.fulltext.dates -
utb.fulltext.sponsorship The authors kindly appreciate the financial support which was provided by the European Regional Development Fund under the project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089.
Find Full text

Soubory tohoto záznamu

Zobrazit minimální záznam