LMIs for constrained polynomial interpolation with application in trajectory planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03118665" target="_blank" >RIV/68407700:21230/06:03118665 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
LMIs for constrained polynomial interpolation with application in trajectory planning
Original language description
We consider an open-loop trajectory planning problem for linear systems with bound constraints originating from saturations or physical limitations. Using an algebraic approach and results on positive polynomials, we show that this control problem can becast into a constrained polynomial interpolation problem admitting a convex linear matrix inequality (LMI) formulation.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Systems & Control Letters
ISSN
0167-6911
e-ISSN
—
Volume of the periodical
55
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
5
Pages from-to
473-477
UT code for WoS article
—
EID of the result in the Scopus database
—