Keyword

Bellman dynamic programming

Description: Bellman dynamic programming is a method for solving sequential decision and control problems by recursively optimizing value over successive states.
OpenAlex ID: keywords/bellman-dynamic-programming
1961 · J. J. FLORENTIN · Journal of Electronics and Control · 158
1962 · Richard E. Kopp · Mathematics in Science and Engineering/Mathematics in science and engineering · 139
2014 · Simon Haykin, Joaquin M. Fuster · Proceedings of the IEEE · 93
1990 · X. Y. Zhou · Journal of Optimization Theory and Applications · 89
2014 · Mehdi Fatemi, Simon Haykin · IEEE Access · 71
1986 · Augustine O. Esogbue · Fuzzy Sets and Systems · 54
2004 · Michael Back, Stephan Terwen, et al. · IFAC Proceedings Volumes · 50
2009 · George G. Lendaris · International Joint Conference on Neural Networks (IJCNN) · 48
1990 · Xun Yu Zhouf · Stochastics and stochastics reports · 47
2017 · Yinyan Zhang, Shuai Li, et al. · Nonlinear Dynamics · 46
2009 · V. Azhmyakov, R. Galvan-Guerra, et al. · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · 43
2002 · Frank Kirschbaum, Michael Back, et al. · IFAC Proceedings Volumes · 41
1999 · S. Sieniutycz · Journal of Non-Equilibrium Thermodynamics · 41
2018 · Jingtao Su, Shengsong Yang, et al. · China Communications · 23
1990 · R. H. Motte, S. Calvert · Journal of Navigation · 22
2021 · H. Lu, A. Li, et al. · Journal of Aerospace Engineering · 19
2020 · Yun Sun, Hongyan Yan, et al. · Soft Computing · 17
2003 · Vladislav I Zhukovskiy · CRC Press eBooks · 17
2010 · V Azhmyakov, R Galvan-Guerra, et al. · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · 14
Works count: 186
Citation count: 1,600
Year
Topic
Type