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

Gridding discretization-based multiple stability switching delay search algorithm: The movement of a human being on a controlled swaying bow

Repozitář DSpace/Manakin

Zobrazit minimální záznam


dc.title Gridding discretization-based multiple stability switching delay search algorithm: The movement of a human being on a controlled swaying bow en
dc.contributor.author Pekař, Libor
dc.contributor.author Matušů, Radek
dc.contributor.author Prokop, Roman
dc.relation.ispartof PLoS ONE
dc.identifier.issn 1932-6203 Scopus Sources, Sherpa/RoMEO, JCR
dc.date.issued 2017
utb.relation.volume 12
utb.relation.issue 6
dc.type article
dc.language.iso en
dc.publisher Public Library of Science
dc.identifier.doi 10.1371/journal.pone.0178950
dc.relation.uri http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0178950
dc.description.abstract Delay represents a significant phenomenon in the dynamics of many human-related systems - including biological ones. It has i.a. a decisive impact on system stability, and the study of this influence is often mathematically demanding. This paper presents a computationally simple numerical gridding algorithm for the determination of stability margin delay values in multiple-delay linear systems. The characteristic quasi-polynomial - the roots of which decide about stability - is subjected to iterative discretization by means of pre-warped bilinear transformation. Then, a linear and a quadratic interpolation are applied to obtain the associated characteristic polynomial with integer powers. The roots of the associated characteristic polynomial are closely related to the estimation of roots of the original characteristic quasi-polynomial which agrees with the system's eigenvalues. Since the stability border is crossed by the leading one, the switching root locus is enhanced using the Regula Falsi interpolation method. Our methodology is implemented on - and verified by - a numerical bio-cybernetic example of the stabilization of a human-being's movement on a controlled swaying bow. The advantage of the proposed novel algorithm lies in the possibility of the rapid computation of polynomial zeros by means of standard programs for technical computing; in the low level of mathematical knowledge required; and, in the sufficiently high precision of the roots loci estimation. The relationship to the direct search QuasiPolynomial (mapping) Rootfinder algorithm and computational complexity are discussed as well. This algorithm is also applicable for systems with non-commensurate delays. © 2017 Pekař et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1007422
utb.identifier.obdid 43877006
utb.identifier.scopus 2-s2.0-85020447208
utb.identifier.wok 000402923200071
utb.identifier.pubmed 28594904
utb.identifier.coden POLNC
utb.source j-scopus
dc.date.accessioned 2017-09-08T12:14:54Z
dc.date.available 2017-09-08T12:14:54Z
dc.description.sponsorship CZ.1.05/2.1.00/19.0376, ERDF, European Regional Development Fund
dc.description.sponsorship Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [LO1303 (MSMT-7778/2014)]; European Regional Development Fund under the project CEBIA-Tech Instrumentation [CZ.1.05/2.1.00/19.0376]
dc.rights Attribution 4.0 International
dc.rights.uri https://creativecommons.org/licenses/by/4.0/
dc.rights.access openAccess
utb.ou CEBIA-Tech
utb.contributor.internalauthor Pekař, Libor
utb.contributor.internalauthor Matušů, Radek
utb.contributor.internalauthor Prokop, Roman
utb.fulltext.affiliation Libor Pekař 1*, Radek Matušů 2☯, Roman Prokop 3☯ 1 Department of Automation and Control Engineering, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic, 2 Regional Research Centre CEBIA-Tech, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic, 3 Department of Mathematics, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic ☯ These authors contributed equally to this work. * pekar@fai.utb.cz
utb.fulltext.dates Received: February 29, 2016 Accepted: May 22, 2017 Published: June 8, 2017
utb.scopus.affiliation Department of Automation and Control Engineering, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic; Regional Research Centre CEBIA-Tech, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic; Department of Mathematics, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.ou Department of Automation and Control Engineering
utb.fulltext.ou CEBIA-Tech
utb.fulltext.ou Department of Mathematics
Find Full text

Soubory tohoto záznamu

Zobrazit minimální záznam

Attribution 4.0 International Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Attribution 4.0 International