.png){kind=icon}
.png){kind=icon}
Return
A kernel-based approximate dynamic programming approach: Theory and application
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2024.111517.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article proposes a novel kernel -based Dynamic Programming (DP) approximation method to tackle the typical curse of dimensionality of stochastic DP problems over the finite time horizon. Such a method utilizes kernel functions in combination with Support Vector Machine (SVM) regression to determine an approximate cost function for the entire state space of the underlying Markov Decision Process (MDP), by leveraging cost function computed for selected representative states. Kernel functions are used to define the so-called kernel matrix, while the parameter vector of the given kernel -based cost function approximation is computed by moving backwards in time from the terminal condition and by applying SVM regression. This way, the difficulty of selecting a proper set of features is also tackled. The proposed method is then extended to the infinite time horizon case. To show the effectiveness of the proposed approach, the resulting Recursive Residual Approximate Dynamic Programming (RR -ADP) algorithm is applied to the sensor scheduling design in multi -process remote state estimation problems. (c) 2024 Elsevier Ltd. All rights reserved.
Keywords:
Dynamic Programming
Markov Decision Process
Approximate Dynamic Programming
Kernel function
Support Vector Machine
Sensor scheduling
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
View more organizations