scholarly journals A2CM: a new multi-agent algorithm

ACTA IMEKO ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 28
Author(s):  
Gabor Paczolay ◽  
Istvan Harmati
Keyword(s):  
Artificial Intelligence ◽  
Neural Networks ◽  
Reinforcement Learning ◽  
Collision Avoidance ◽  
Multiple Agents ◽  
Pursuit Evasion ◽  
The World ◽  
Multi Agent ◽  
New Algorithms ◽  
Modified Algorithm

<p class="Abstract">Reinforcement learning is currently one of the most researched fields of artificial intelligence. New algorithms are being developed that use neural networks to compute the selected action, especially for deep reinforcement learning. One subcategory of reinforcement learning is multi-agent reinforcement learning, in which multiple agents are present in the world. As it involves the simulation of an environment, it can be applied to robotics as well. In our paper, we use our modified version of the advantage actor–critic (A2C) algorithm, which is suitable for multi-agent scenarios. We test this modified algorithm on our testbed, a cooperative–competitive pursuit–evasion environment, and later we address the problem of collision avoidance.</p>

A Review of Recent Deep Learning Models in COVID-19 Diagnosis

2021 ◽  
Vol 6 (5) ◽  
pp. 10-15
Author(s):  
Ela Bhattacharya ◽  
D. Bhattacharya
Keyword(s):  
Artificial Intelligence ◽  
Neural Networks ◽  
Deep Learning ◽  
Deep Neural Networks ◽  
Test Results ◽  
Learning Models ◽  
Future Directions ◽  
Human Contact ◽  
The World ◽  
Short Span

COVID-19 has emerged as the latest worrisome pandemic, which is reported to have its outbreak in Wuhan, China. The infection spreads by means of human contact, as a result, it has caused massive infections across 200 countries around the world. Artificial intelligence has likewise contributed to managing the COVID-19 pandemic in various aspects within a short span of time. Deep Neural Networks that are explored in this paper have contributed to the detection of COVID-19 from imaging sources. The datasets, pre-processing, segmentation, feature extraction, classification and test results which can be useful for discovering future directions in the domain of automatic diagnosis of the disease, utilizing artificial intelligence-based frameworks, have been investigated in this paper.

scholarly journals Can models of agents be transferred between different areas?

2000 ◽  
Vol 15 (2) ◽  
pp. 197-203 ◽  
Author(s):  
RUTH AYLETT ◽  
KERSTIN DAUTENHAHN ◽  
JIM DORAN ◽  
MICHAEL LUCK ◽  
SCOTT MOSS ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Computer Science ◽  
Multi Agent Systems ◽  
Ongoing Research ◽  
Agent Based ◽  
Agent Systems ◽  
Sustained Activity ◽  
Diverse Environment ◽  
The World ◽  
Multi Agent

One of the main reasons for the sustained activity and interest in the field of agent-based systems, apart from the obvious recognition of its value as a natural and intuitive way of understanding the world, is its reach into very many different and distinct fields of investigation. Indeed, the notions of agents and multi-agent systems are relevant to fields ranging from economics to robotics, in contributing to the foundations of the field, being influenced by ongoing research, and in providing many domains of application. While these various disciplines constitute a rich and diverse environment for agent research, the way in which they may have been linked by it is a much less considered issue. The purpose of this panel was to examine just this concern, in the relationships between different areas that have resulted from agent research. Informed by the experience of the participants in the areas of robotics, social simulation, economics, computer science and artificial intelligence, the discussion was lively and sometimes heated.

scholarly journals An Improved Approach towards Multi-Agent Pursuit–Evasion Game Decision-Making Using Deep Reinforcement Learning

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1433
Author(s):  
Kaifang Wan ◽  
Dingwei Wu ◽  
Yiwei Zhai ◽  
Bo Li ◽  
Xiaoguang Gao ◽  
...  
Keyword(s):  
Decision Making ◽  
Reinforcement Learning ◽  
Superior Performance ◽  
State Variables ◽  
Multi Agent Systems ◽  
Adversarial Learning ◽  
Pursuit Evasion ◽  
Evasion Game ◽  
Multi Agent ◽  
Adversarial Attack

A pursuit–evasion game is a classical maneuver confrontation problem in the multi-agent systems (MASs) domain. An online decision technique based on deep reinforcement learning (DRL) was developed in this paper to address the problem of environment sensing and decision-making in pursuit–evasion games. A control-oriented framework developed from the DRL-based multi-agent deep deterministic policy gradient (MADDPG) algorithm was built to implement multi-agent cooperative decision-making to overcome the limitation of the tedious state variables required for the traditionally complicated modeling process. To address the effects of errors between a model and a real scenario, this paper introduces adversarial disturbances. It also proposes a novel adversarial attack trick and adversarial learning MADDPG (A2-MADDPG) algorithm. By introducing an adversarial attack trick for the agents themselves, uncertainties of the real world are modeled, thereby optimizing robust training. During the training process, adversarial learning was incorporated into our algorithm to preprocess the actions of multiple agents, which enabled them to properly respond to uncertain dynamic changes in MASs. Experimental results verified that the proposed approach provides superior performance and effectiveness for pursuers and evaders, and both can learn the corresponding confrontational strategy during training.

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

2020 ◽  
Vol 4 (6) ◽  
Author(s):  
Tsega Weldu Araya ◽  
Md Rashed Ibn Nawab ◽  
A. P. Yuan Ling
Keyword(s):  
Reinforcement Learning ◽  
Learning Algorithm ◽  
Data Representation ◽  
Training Data ◽  
Two Dimensional ◽  
Multiple Agents ◽  
Learning Agents ◽  
Dimensional Array ◽  
Multi Agent ◽  
Agent Cooperation

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.

Personal Tour

2012 ◽  
pp. 178-189
Author(s):  
Fabiana Lorenzi ◽  
Stanley Loh ◽  
Mara Abel
Keyword(s):  
Artificial Intelligence ◽  
Incomplete Information ◽  
Recommender System ◽  
Local Knowledge ◽  
Knowledge Bases ◽  
Distributed Artificial Intelligence ◽  
Multiple Agents ◽  
Multi Agent ◽  
User Recommendation

This chapter describes the Personal Tour: a multi-agent recommender system designed to help users to find best travel packages according to their preferences. Personal Tour is based on the collaboration of multiple agents exchanging information stored in their local knowledge bases. Based on the paradigm of the Distributed Artificial Intelligence, a user recommendation request is divided into partial recommendations handled by different agents, each one maintaining incomplete information that may be useful to compose a recommendation.

Machine Learning and Data Mining in Bioinformatics

2012 ◽  
pp. 695-703
Author(s):  
George Tzanis ◽  
Christos Berberidis ◽  
Ioannis Vlahavas
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Data Mining ◽  
Reinforcement Learning ◽  
Supervised Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
The World ◽  
Supervised Learning Algorithms ◽  
Computational Systems

Machine learning is one of the oldest subfields of artificial intelligence and is concerned with the design and development of computational systems that can adapt themselves and learn. The most common machine learning algorithms can be either supervised or unsupervised. Supervised learning algorithms generate a function that maps inputs to desired outputs, based on a set of examples with known output (labeled examples). Unsupervised learning algorithms find patterns and relationships over a given set of inputs (unlabeled examples). Other categories of machine learning are semi-supervised learning, where an algorithm uses both labeled and unlabeled examples, and reinforcement learning, where an algorithm learns a policy of how to act given an observation of the world.

Machine Learning and Data Mining in Bioinformatics

2009 ◽  
pp. 612-621 ◽  
Author(s):  
George Tzanis ◽  
Christos Berberidis ◽  
Ioannis Vlahavas
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Data Mining ◽  
Reinforcement Learning ◽  
Supervised Learning ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
The World ◽  
Supervised Learning Algorithms ◽  
Computational Systems

Machine learning is one of the oldest subfields of artificial intelligence and is concerned with the design and development of computational systems that can adapt themselves and learn. The most common machine learning algorithms can be either supervised or unsupervised. Supervised learning algorithms generate a function that maps inputs to desired outputs, based on a set of examples with known output (labeled examples). Unsupervised learning algorithms find patterns and relationships over a given set of inputs (unlabeled examples). Other categories of machine learning are semi-supervised learning, where an algorithm uses both labeled and unlabeled examples, and reinforcement learning, where an algorithm learns a policy of how to act given an observation of the world.

Proposal of PSwithEFP and its Evaluation in Multi-Agent Reinforcement Learning

2017 ◽  
Vol 21 (5) ◽  
pp. 930-938 ◽  
Author(s):  
Kazuteru Miyazaki ◽  
Koudai Furukawa ◽  
Hiroaki Kobayashi ◽  
◽  
◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Failure Probability ◽  
Action Selection ◽  
New Method ◽  
Selection Strategy ◽  
Multiple Agents ◽  
Learning Problem ◽  
Concurrent Learning ◽  
Multi Agent

When multiple agents learn a task simultaneously in an environment, the learning results often become unstable. This problem is known as the concurrent learning problem and to date, several methods have been proposed to resolve it. In this paper, we propose a new method that incorporates expected failure probability (EFP) into the action selection strategy to give agents a kind of mutual adaptability. The effectiveness of the proposed method is confirmed using Keepaway task.

Sign in / Sign up

Export Citation Format

Share Document