Dimitri P. Bertsekas
Papers
2
Total Citations
8
H-Index
2
About
Dimitri P. Bertsekas is a towering figure in optimization, control theory, and reinforcement learning, whose work has fundamentally shaped modern computational decision-making. His major contributions span dynamic programming, neuro-dynamic programming (now called reinforcement learning), and convex optimization, with a particular focus on multiagent systems and partially observable Markov decision processes (POMDPs). His recent papers, such as "Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems" (2020, 6 citations) and "Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration" (2020, 2 citations), introduce innovative algorithms that combine rollout, policy iteration, and terminal cost approximations to solve complex, real-world sequential repair problems under uncertainty. These works are notable for their rigorous theoretical foundations and practical applicability to autonomous systems. With over 100,000 citations across his career, Bertsekas is among the most influential researchers in his field. He is also the author of classic textbooks like *Dynamic Programming and Optimal Control* and *Convex Optimization Algorithms*, which are essential reading for students and researchers alike. His work continues to drive advances in robotics, AI, and operations research.
Research Focus
Key Achievements
Top Papers
- 1
- 2