2014
DOI: 10.1002/asjc.1079
|View full text |Cite
|
Sign up to set email alerts
|

Spline Based Pseudo‐Inversion of Sampled Data Non‐Minimum Phase Systems for an Almost Exact Output Tracking

Abstract: This paper considers the problem of achieving a very accurate tracking of a pre-specified desired output trajectorỹ y(k), k ∈ ∠ Z + , for linear, multiple input multiple output, non-minimum phase and/or non hyperbolic, sampled data, and closed loop control systems. The proposed approach is situated in the general framework of model stable inversion and introduces significant novelties with the purpose of reducing some theoretical and numerical limitations inherent in the methods usually proposed. In particular… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 35 publications
0
14
0
Order By: Relevance
“…Later, De Boor entitled to an especial class of the SFs that have minimal support with respect to a region partition and various degrees, smoothly as BSFs. The SFs and BSFs have been recently and widely used to deal with several optimal tracking problems . Any presented degree of the SFs can be denoted as a series of the BSFs of that degree.…”
Section: The Bsfsmentioning
confidence: 99%
See 1 more Smart Citation
“…Later, De Boor entitled to an especial class of the SFs that have minimal support with respect to a region partition and various degrees, smoothly as BSFs. The SFs and BSFs have been recently and widely used to deal with several optimal tracking problems . Any presented degree of the SFs can be denoted as a series of the BSFs of that degree.…”
Section: The Bsfsmentioning
confidence: 99%
“…The SFs and BSFs have been recently and widely used to deal with several optimal tracking problems. [38][39][40][41][42][43][44][45] Any presented degree of the SFs can be denoted as a series of the BSFs of that degree. The BSFs have equal distance support points, which are considered as the partition vector t = (t i , t i+1 , t i+2 , …, t i+d+1 ) and are called control points.…”
Section: The Bsfsmentioning
confidence: 99%
“…Our goal is to solve (11) for d (t) and d (t) that are the stable inversion solutions for (3). The calculation process of (11) is similar to that of (9). For simplicity and clarity, only the calculation process of (11) is studied in detail, and the calculation process of (9) can be seen from that of (31).…”
Section: Assumptionmentioning
confidence: 99%
“…With the purpose of removing some limitations inherent in the aforementioned techniques, a new stable pseudo‐inversion approach has been recently proposed in .…”
Section: Introductionmentioning
confidence: 99%
“…In these references, the inverse problem consists in solving the convolution integral (or the convolution sum in the case of sampled data systems ) with respect to the transient input, which minimizes the L 2 norm of the transient tracking error. The reference input is ‘a priori’ assumed to belong to the space of piece‐wise continuously differentiable functions in or to the set of spline functions in . The assumed structure of the input guarantees an efficient solution of the optimization procedure and a sufficiently regular waveform of the reference input.…”
Section: Introductionmentioning
confidence: 99%