About: On the optimal pole assignment for time-delay systems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • The well-known fact about linear time-invariant time-delay 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.
  • The well-known fact about linear time-invariant time-delay 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)
Title
  • On the optimal pole assignment for time-delay systems
  • On the optimal pole assignment for time-delay systems (en)
skos:prefLabel
  • On the optimal pole assignment for time-delay systems
  • On the optimal pole assignment for time-delay systems (en)
skos:notation
  • RIV/70883521:28140/13:43869745!RIV14-MSM-28140___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED2.1.00/03.0089)
http://linked.open...iv/cisloPeriodika
  • 1
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93915
http://linked.open...ai/riv/idVysledku
  • RIV/70883521:28140/13:43869745
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Artificial Intelligence; Iterative Algorithms; Pole Placement; Spectral Abscissa; Optimization; Time-Delay Systems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV
  • [187630193FF4]
http://linked.open...i/riv/nazevZdroje
  • International Journal of Mathematical Models and Methods in Applied Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 7
http://linked.open...iv/tvurceVysledku
  • Pekař, Libor
issn
  • 1998-0140
number of pages
http://localhost/t...ganizacniJednotka
  • 28140
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software