Research on Tensor-Based Cooperative and Competitive in Multi-Agent Reinforcement Learning

Tsega Weldu Araya, Md Rashed Ibn Nawab and A. P. Yuan Ling
Additional contact information
Tsega Weldu Araya: Northwestern Polytechnical University, China
Md Rashed Ibn Nawab: Northwestern Polytechnical University, China
A. P. Yuan Ling: Huazhong University of Science and Technology, China

European Journal of Electrical Engineering and Computer Science, 2020, vol. 4, issue 6

Abstract: As technology overgrows, the assortment of information and the density of work becomes demanding to manage. To resolve the density of employment and human labor, machine-learning (ML) technology developed. Reinforcement learning (RL) is the recent advancement of ML studies. Multi-agent reinforcement learning (MARL) is useful to train multiple agents in the surrounding environment. The previous research studies focused on two-agent cooperation. Their data representation was held in a two-dimensional array, which is called a matrix. The limitation of this two-dimensional array appears as the training data of agents increases. The growth in the training data of agents creates storage drawbacks and data redundancy. Our first aim in this research is to improve an algorithm that can represent MARL training in tensor. In MARL, multiple agents are work together to achieve joint work. To share the training records and data of numerous agents, we need to collect the previous cumulative experience of agents in tensor. Secondly, we will discover the agent's cooperation and competition, with local and global goals of agents in MARL. Local goals are the cooperation of agents in a group or team where we use the training model as a student and teacher agent. The global goal is the competition between two contrary teams to acquire the reward. All learning agents have their Q table for storing the individual agent's training data in an environment. The growth in the number of learning agents, their training experience in Q tables, and the requirement for representing multiple data become the most challenging issue. We introduce tensor to store various data to resolve the challenges for data representation in multiple agent associations. Tensor is expressed as the three-dimensional array, although it is an N-way array, which is useful for representing and accessing numerous data. Finally, we will implement an algorithm for learning three cooperative agents against the opposed team using a tensor-based framework in the Q learning algorithm. We will provide an algorithm that can store the training records and data of multiple agents. Tensor advances to get a small storage size than the matrix for the training records of agents. Although three agent cooperation benefits to having maximum optimal reward.

Keywords: Local and Global goal; MARL; Reinforcement Learning; Tensor decomposition (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://eu-opensci.org/index.php/ejece/article/view/19262 Abstract page (text/html)
https://eu-opensci.org/index.php/ejece/article/download/19262/11136 Full text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:epw:ejece0:v:4:y:2020:i:6:id:19262

DOI: 10.24018/ejece.2020.4.6.262

Access Statistics for this article

More articles in European Journal of Electrical Engineering and Computer Science from European Open Science
Bibliographic data for series maintained by support ().