paper-with-me

홈 › Papers

Model-Free Incremental Adaptive Dynamic Programming Based Approximate Robust Optimal Regulation

2021-05-04 · Cong Li, Yongchao Wang, Fangzhou Liu, Qingchen Liu, Martin Buss

This paper presents a new formulation for model-free robust optimal regulation of continuous-time nonlinear systems. The proposed reinforcement learning based approach, referred to as incremental adaptive dynamic programming (IADP), exploits measured data to allow the design of the approximate optimal incremental control strategy, which stabilizes the controlled system incrementally under model uncertainties, environmental disturbances, and input saturation. By leveraging the time delay estimation (TDE) technique, we first exploit sensory data to reduce the requirement of a complete dynamics, where measured data are adopted to construct an incremental dynamics that reflects the system evolution in an incremental form. Then, the resulting incremental dynamics serves to design the approximate optimal incremental control strategy based on adaptive dynamic programming, which is implemented as a simplified single critic structure to get the approximate solution to the value function of the Hamilton-Jacobi-Bellman equation. Furthermore, for the critic artificial neural network, experience data are used to design an off-policy weight update law with guaranteed weight convergence. Rather importantly, to address the unintentionally introduced TDE error, we incorporate a TDE error bound related term into the cost function, whereby the TDE error is attenuated during the optimization process. The system stability proof and the weight convergence proof are provided. Numerical simulations are conducted to validate the effectiveness and superiority of our proposed IADP, especially regarding the reduced control energy expenditure and the enhanced robustness.

📄 PDF Abstract BibTeX arXiv:2105.01698

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Discrete-Time Impulsive Adaptive Dynamic Programming

2019-04-11 · IEEE Transactions on Cybernetics 2019 4 · Qinglai Wei, Ruizhuo Song, Member, IEEE 외

Abstract—In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal impulsive control problems for infinite horizon discrete-time nonlinear systems. Considering the constrai…

The Adaptive Dynamic Programming Toolbox

2020-12-29 · Xiaowei Xing, Dong Eui Chang

The paper develops the Adaptive Dynamic Programming Toolbox (ADPT), which solves optimal control problems for continuous-time nonlinear systems. Based on the adaptive dynamic programming technique, the ADPT computes opti…

Reinforcement Learning for Matrix Computations: PageRank as an Example

2013-11-01 · Vivek S. Borkar, Adwaitvedant S. Mathkar

Reinforcement learning has gained wide popularity as a technique for simulation-driven approximate dynamic programming. A less known aspect is that the very reasons that make it effective in dynamic programming can also …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Non-parametric Approximate Dynamic Programming via the Kernel Method

2012-12-01 · NeurIPS 2012 12 · Nikhil Bhat, Vivek Farias, Ciamac C. Moallemi

This paper presents a novel non-parametric approximate dynamic programming (ADP) algorithm that enjoys graceful, dimension-independent approximation and sample complexity guarantees. In particular, we establish both theo…

Efficient Incremental Belief Updates Using Weighted Virtual Observations

2024-02-10 · David Tolpin

We present an algorithmic solution to the problem of incremental belief updating in the context of Monte Carlo inference in Bayesian statistical models represented by probabilistic programs. Given a model and a sample-ap…

Probabilistic Programming