Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Omi, Saki, Shin, Hyo-Sang, Cho, Namhoon, Tsourdos, Antonios
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911479791353856
author Omi, Saki
Shin, Hyo-Sang
Cho, Namhoon
Tsourdos, Antonios
author_facet Omi, Saki
Shin, Hyo-Sang
Cho, Namhoon
Tsourdos, Antonios
contents Recent studies have greatly improved reinforcement learning, and an increased interest in real-world implementation has emerged. In many cases, the implementation is challenged by time-varying disturbances as it introduces hidden states, which makes the problem best described with Partially Observable Markov Decision Processes. An effective approach to address this problem is to introduce a Recurrent Neural Network (RNN) in place of a state estimator. However, only a few studies have investigated the types of information to be supplied to the RNN and the network architecture to handle them. This study discusses the effectiveness of the inclusion of action along with observation and the impact of network architecture to handle them by providing interpretations of how the trajectories are summarized at LSTM networks. Specifically, three novel approaches with different architectures are introduced. All algorithms demonstrated the effectiveness of the inclusion of the action trajectories in simulation environments. In particular, one of the developed algorithms, H-TD3, differs from the typical actor and critic network as the critic network is trained by utilizing the hidden states generated by the actor network as the summarized trajectory information. This novel approach exhibited the potential improvement of the computational time while maintaining the performance.
format Preprint
id arxiv_https___arxiv_org_abs_2307_15931
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes
Omi, Saki
Shin, Hyo-Sang
Cho, Namhoon
Tsourdos, Antonios
Machine Learning
Recent studies have greatly improved reinforcement learning, and an increased interest in real-world implementation has emerged. In many cases, the implementation is challenged by time-varying disturbances as it introduces hidden states, which makes the problem best described with Partially Observable Markov Decision Processes. An effective approach to address this problem is to introduce a Recurrent Neural Network (RNN) in place of a state estimator. However, only a few studies have investigated the types of information to be supplied to the RNN and the network architecture to handle them. This study discusses the effectiveness of the inclusion of action along with observation and the impact of network architecture to handle them by providing interpretations of how the trajectories are summarized at LSTM networks. Specifically, three novel approaches with different architectures are introduced. All algorithms demonstrated the effectiveness of the inclusion of the action trajectories in simulation environments. In particular, one of the developed algorithms, H-TD3, differs from the typical actor and critic network as the critic network is trained by utilizing the hidden states generated by the actor network as the summarized trajectory information. This novel approach exhibited the potential improvement of the computational time while maintaining the performance.
title Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes
topic Machine Learning
url https://arxiv.org/abs/2307.15931