2016
DOI: 10.2514/1.g001154
|View full text |Cite
|
Sign up to set email alerts
|

Theoretical and Numerical Analysis of Approximate Dynamic Programming with Approximation Errors

Abstract: This study is aimed at answering the famous question of how the approximation errors at each iteration of Approximate Dynamic Programming (ADP) affect the quality of the final results considering the fact that errors at each iteration affect the next iteration. To this goal, convergence of Value Iteration scheme of ADP for deterministic nonlinear optimal control problems with undiscounted cost functions is investigated while considering the errors existing in approximating respective functions. The boundedness… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
26
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 56 publications
(27 citation statements)
references
References 40 publications
1
26
0
Order By: Relevance
“…Let the approximation error be denoted with −1 (·). In other words instead of the exact value function V 0 (·) given by (9), one initiates the iterations using the approximate value function…”
Section: Stability Analysis Under Approximate Value Iterationmentioning
confidence: 99%
See 4 more Smart Citations
“…Let the approximation error be denoted with −1 (·). In other words instead of the exact value function V 0 (·) given by (9), one initiates the iterations using the approximate value function…”
Section: Stability Analysis Under Approximate Value Iterationmentioning
confidence: 99%
“…Proof : The proof (which resembles Relaxed Dynamic Programming presented in [4]) provided in [9] applies to the case of initiating AVI using an admissible policy as well.…”
Section: Stability Analysis Under Approximate Value Iterationmentioning
confidence: 99%
See 3 more Smart Citations