返回
Lebesgue-Sampling-Based Optimal Control Problems With Time Aggregation
DOI:10.1109/TAC.2010.2073610.png)
摘要
En 中文
We formulate the Lebesgue-sampling-based optimal control problem. We show that the problem can be solved by the time aggregation approach in Markov decision processes (MDP) theory. Policy-iteration-based and reinforcement-learning-based methods are developed for the optimal policies. Both analytical solutions and sample-path-based algorithms are given. Compared to the periodic-sampling scheme, the Lebesgue sampling scheme improves system performance.
Keyword:
Aggregation
Markov decision processes (MDPs)
performance potentials
reinforcement learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W

