2010
DOI: 10.1016/j.jtice.2009.04.013
|View full text |Cite
|
Sign up to set email alerts
|

The solutions of time-delayed optimal control problems by the use of modified line-up competition algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
8
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 31 publications
4
8
0
Order By: Relevance
“…For the time step size h = 0.4,0.04,0.004, Figs and show the simulation curves of x ( t ) and u ( t ) for the OCP ()‐() with constant time‐delay τ ( t ) = 1 and time‐varying delay τ(t)=1+12t21+t, respectively. These figures indicate that the numerical solution of the new approximation scheme is in good agreement with the available litreture .…”
Section: The Second‐order Two‐step Fd Methodssupporting
confidence: 71%
See 1 more Smart Citation
“…For the time step size h = 0.4,0.04,0.004, Figs and show the simulation curves of x ( t ) and u ( t ) for the OCP ()‐() with constant time‐delay τ ( t ) = 1 and time‐varying delay τ(t)=1+12t21+t, respectively. These figures indicate that the numerical solution of the new approximation scheme is in good agreement with the available litreture .…”
Section: The Second‐order Two‐step Fd Methodssupporting
confidence: 71%
“…From Table it is observed that for the time step size h = 0.004 and constant time‐delay τ ( t ) = 1, a minimum value of the cost functional is obtained as J = 4.796786. As it is shown in Table , this value of J computed by the proposed scheme is compared very well with those achieved by the single‐term Walsh series , iterative dynamic programming , Legendre multi‐wavelets , modified line‐up competition algorithm and recursive shooting method . Comparison results reveal the validity of the proposed FD method for solving the TDOCP ()–().…”
Section: The Second‐order Two‐step Fd Methodssupporting
confidence: 59%
“…Table shows the numerical results obtained with Legendre multiwavelets by using eight basis functions, hybrid Bernoulli polynomials with k =2, M =2, hybrid function and Páde approximation with N =2, M =2, modified line‐up competition algorithm with eight time divisions and 200 trial members in one generation using line‐up competition algorithm.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Example 6. Consider the following example: Numerical methods J Hybrid Bernoulli polynomials 24 3.21663 Semigroup approximation 50 3.2587 Hybrid function and Páde approximation 53 3.3208 Modified line-up competition algorithm 54 3.4004 Legendre multiwavelets 27 3.43254 Hybrid Legendre polynomials 55 3 subject to the time-delay system…”
Section: Examplementioning
confidence: 99%
“…The Line-up algorithm has been successfully applied to various fields such as mathematical function optimization [19], [20]; separation process optimization [21]; optimal control problems [22], [23], among other applications.…”
Section: Line-up Algorithmmentioning
confidence: 99%