Home /Research /Approximate Dynamic Programming Strategies and Their Applicability for Process Control: A Review and Future Directions
LEARNING

Approximate Dynamic Programming Strategies and Their Applicability for Process Control: A Review and Future Directions

Jong Min Lee, Jay H. Lee

Year
2004
Citations
86

Abstract

Abstract: This paper reviews dynamic programming (DP), surveys approximate solution methods for it, and considers their applicability to process control problems. Reinforcement Learning (RL) and Neuro-Dynamic Programming (NDP), which can be viewed as approximate DP techniques, are already established techniques for solving difficult multi-stage decision problems in the fields of operations research, computer science, and robotics. Owing to the significant disparity of problem formulations and objective, however, the algorithms and techniques available from these fields are not directly applicable to process control problems, and reformulations based on accurate understanding of these techniques are needed. We categorize the currently available approximate solution techniques for dynamic programming and identify those most suitable for process control problems. Several open issues are also identified and discussed.

Keywords

Dynamic programmingProcess (computing)Artificial intelligenceComputer scienceRoboticsMechatronicsReinforcement learningMachine learningControl (management)Categorization

Related papers

Browse all LEARNING papers