Old Web
English
Sign In
Acemap
>
Paper
>
Approximate dynamic programming using model-free Bellman Residual Elimination
Approximate dynamic programming using model-free Bellman Residual Elimination
2010
Brett Bethke
Jonathan P. How
Keywords:
Mathematical optimization
Dynamic programming
Linear search problem
Residual
Mathematics
Optimal substructure
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]