Skip to content
naulon
Not checkedNot checked for notices yet.

An Improved Sarsa(<inline-formula> <tex-math notation="LaTeX">$\lambda$ </tex-math></inline-formula>) Reinforcement Learning Algorithm for Wireless Communication Systems

Hao Jiang, Renjie Gui, Zhen Chen and 3 more

IEEE Access · 2019

doi:10.1109/access.2019.2935255 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this article, we provide a novel improved model-free temporal-difference control algorithm, namely, Expected Sarsa(&#x03BB;), using the average value as an update target and introducing eligibility traces in wireless communication networks. In particular, we construct the update target using the average action value of all possible successive actions, and apply eligibility traces to record the historical access of every state action pair, which greatly improve the model's convergence property and learning efficiency. Numerical results demonstrate that the proposed algorithm has the advantage of high learning efficiency and a higher learning-rate tolerance range than Q Learning, Sarsa, Expected Sarsa, and Sarsa(&#x03BB;) in the tabular case of a finite Markov decision process, thereby providing an efficient solution for the study and design wireless communication networks. This provides an efficient and effective solution to design further artificial intelligent communication networks.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.