Infinite Horizon Dynamic Programming is a dynamic programming framework distinguished by its optimization over an unbounded time horizon, where decisions are sequentially made to maximize cumulative discounted rewards without a terminal time constraint.
137
Publications
10.1K
Citations
231
Authors
129
Institutions
Publications per year
2017–2026
28
Parents
Publications
137
1–5 of 137
Authors
231
- QW
9
h-index
- DL
8
h-index
- DPDimitri P. Bertsekas
Massachusetts Institute of Technology, United States
5 publications · 489 citations
6
h-index
- TE
4
h-index
- DB
4
h-index
1–5 of 231
Institutions
129
Chinese Academy of Sciences
Beijing, China
9 h-index
22 publications
3.7K citations
Shandong Institute of Automation
Jinan, China
9 h-index
23 publications
3.5K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
11 publications
2.1K citations
Columbia University
New York, United States
6 h-index
6 publications
762 citations
University of Maryland, College Park
College Park, United States
6 h-index
8 publications
356 citations
Duke University
Durham, United States
6 h-index
7 publications
205 citations
University of Michigan
Ann Arbor, United States
5 h-index
11 publications
1.7K citations
University of Science and Technology Beijing
Beijing, China
4 h-index
5 publications
943 citations
1–8 of 129
Venues
- Operations Research
10 publications · 660 citations
10
h-index
- Management Science
8 publications · 457 citations
8
h-index
- IEEE Transactions on Automatic Control
8 publications · 425 citations
8
h-index
- Mathematics of Operations Research
7 publications · 2.2K citations
7
h-index
- IEEE Transactions on Cybernetics
5 publications · 1.1K citations
5
h-index
1–5