.png){kind=icon}
返回
Accelerated Point-Wise Maximum Approach to Approximate Dynamic Programming
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2021.3050440.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we describe an approximate dynamic programming (ADP) approach to compute lower bounds on the optimal value function for a discrete time, continuous space, and infinite horizon setting. The approach iteratively constructs a family of lower bounding approximate value functions by using the so-called Bellman inequality. The novelty of our approach is that, at each iteration, we aim to compute an approximate value function that maximizes the point-wise maximum taken with the family of approximate value functions computed thus far. This leads to a nonconvex objective, and we propose a gradient ascent algorithm to find stationary points by solving a sequence of convex optimization problems. We provide convergence guarantees for our algorithm and an interpretation for how the gradient computation relates to the state-relevance weighting parameter appearing in related ADP approaches. We demonstrate through numerical examples that, when compared to the existing approaches, the algorithm we propose computes tighter suboptimality bounds with comparable computation time.
Keyword:
Approximation algorithms
Pulse width modulation
Linear programming
Heuristic algorithms
Dynamic programming
Optimal control
Aerospace electronics
Discrete-time systems
dynamic programming
infinite horizon optimal control
stochastic systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Optimization over state feedback policies for robust control with constraints具有约束的鲁棒控制的状态反馈策略优化.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏Antithetic Integral Feedback Ensures Robust Perfect Adaptation in Noisy Biomolecular NetworksCELL SYSTEMSOAAI
CELL SYSTEMSIF7.7
OAAI分享收藏
Relaxation-Time Determination from Continuous-Microwave Saturation of EPR Spectra从EPR光谱的连续微波饱和确定弛豫时间OAAI
OAAI分享收藏
查看更多内容