Probabilistic Reward-Based Reinforcement Learning for Multi-Agent Pursuit and Evasion

The reinforcement learning is studied to solve the problem of multi-agent pursuit and evasion games in this article. The main problem of current reinforcement learning for multi-agents is the low learning efficiency of agents. An important factor leading to this problem is that the delay of the Q fu...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Bo-Kun, Hu, Bin, Chen, Long, Zhang, Ding-Xue, Cheng, Xin-Ming, Guan, Zhi-Hong
Format: Conference Proceeding
Language:English
Subjects:
Adaptation models
Delays
Games
Mathematical models
Multi-agent
Probabilistic logic
Probabilistic reward
Pursuit-evasion
Reinforcement learning
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The reinforcement learning is studied to solve the problem of multi-agent pursuit and evasion games in this article. The main problem of current reinforcement learning for multi-agents is the low learning efficiency of agents. An important factor leading to this problem is that the delay of the Q function is related to the environment changing. To solve this problem, a probabilistic distribution reward value is used to replace the Q function in the multi-agent depth deterministic policy gradient framework (hereinafter referred to as MADDPG). The distribution Bellman equation is proved to be convergent, and can be brought into the framework of reinforcement learning algorithm. The probabilistic distribution reward value is updated in the algorithm, so that the reward value can be more adaptive to the complex environment. In the same time, eliminating the delay of rewards improves the efficiency of the strategy and obtains a better pursuit-evasion results. The final simulation and experiment show that the multi-agent algorithm with distribution rewards achieves better results under the setting environment.
ISSN:1948-9447
DOI:10.1109/CCDC52312.2021.9601771