2015
DOI: 10.1016/j.sysconle.2015.04.013
|View full text |Cite
|
Sign up to set email alerts
|

An iterative method for suboptimal control of linear time-delayed systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
11
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 37 publications
1
11
0
Order By: Relevance
“…Table also indicates that for h = 0.001 the cost functional value is computed as J = 3.101717 within a 1.442331 s of CPU time. This value of J is very close to its optimal value J ∗ ≈3.1017 and compares favourably with those achieved by the approximation schemes in . Comparison results are listed in Table .…”
Section: The Second‐order Two‐step Fd Methodssupporting
confidence: 74%
See 2 more Smart Citations
“…Table also indicates that for h = 0.001 the cost functional value is computed as J = 3.101717 within a 1.442331 s of CPU time. This value of J is very close to its optimal value J ∗ ≈3.1017 and compares favourably with those achieved by the approximation schemes in . Comparison results are listed in Table .…”
Section: The Second‐order Two‐step Fd Methodssupporting
confidence: 74%
“…This example was first introduced by Banks and Burns , and has been subsequently considered by Pananisamy and Rao and Mirhosseini‐Alizamini et al. to illustrate their methods. Find the optimal control u ∗ ( t ) which minimizes the quadratic cost functional J=32x2(2)+12falsefalse02u2(t)dt, subject to the time‐delay system {arrayleftẋ(t)=x(t)+x(t1)+u(t),0t2,x(t)=1,1t0. …”
Section: The Second‐order Two‐step Fd Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Example Consider the following example: J=32X2false(2false)+12true02U2false(tfalse)dt, subject to the time‐delay system alignleftalign-1X(t)align-2=X(t)+X(t1)+U(t),0t2,align-1X(t)align-2=1,1t0, in which the analytic solution for U ( t ) is U(t)= δfalse(e2t+false(1tfalse)e1tfalse),0t1,δe2t,1t2, and with δ =−0.3932, J ≃3.1017. This example solved by several numerical techniques such as averaging approximations method, single‐term Walsh series, variational iteration method, and finite difference method with h = 0.01. In Table , these numerical results are compared to the results obtained using the present method for different values of k , M .…”
Section: Numerical Resultsmentioning
confidence: 99%
“…and with = −0.3932, J ≃ 3.1017. This example solved by several numerical techniques such as averaging approximations method, 50 single-term Walsh series, 51 variational iteration method, 56 and finite difference method 57 with h = 0.01. In Table 6, these numerical results are compared to the results obtained using the present method for different values of k, M. Numerical methods J Averaging approximations method, 50 3.0833 Single-term Walsh series 51 3.0879 Variational iteration method 56 3.1091 Finite difference method 57 3 Example 7.…”
Section: Examplementioning
confidence: 99%