Mechanisms to Restrict Exploitation and Improve Societal Performance in Multi-Agent Systems

Author(s):  
Sharmila Savarimuthu ◽  
Martin Purvis ◽  
Maryam Purvis ◽  
Mariusz Nowostawski

Societies are made of different kinds of agents, some cooperative and uncooperative. Uncooperative agents tend to reduce the overall performance of the society, due to exploitation practices. In the real world, it is not possible to decimate all the uncooperative agents; thus the objective of this research is to design and implement mechanisms that will improve the overall benefit of the society without excluding uncooperative agents. The mechanisms that we have designed include referrals and resource restrictions. A referral scheme is used to identify and distinguish noncooperators and cooperators. Resource restriction mechanisms are used to restrict noncooperators from selfish resource utilization. Experimental results are presented describing how these mechanisms operate.

Author(s):  
Rajiv T. Maheswaran ◽  
Craig M. Rogers ◽  
Romeo Sanchez ◽  
Pedro Szekely ◽  
Robert Neches

Robotica ◽  
2018 ◽  
Vol 37 (4) ◽  
pp. 691-707 ◽  
Author(s):  
Mehmet Serdar Güzel ◽  
Vahid Babaei Ajabshir ◽  
Panus Nattharith ◽  
Emir Cem Gezer ◽  
Serhat Can

SummaryThis work addresses a new framework that proposes a decentralized strategy for collective and collaborative behaviours of multi-agent systems. This framework includes a new clustering behaviour that causes agents in the swarm to agree on attending a group and allocating a leader for each group, in a decentralized and local manner. The leader of each group employs a vision-based goal detection algorithm to find and acquire the goal in a cluttered environment. As soon as the leader starts moving, each member is enabled to move in the same direction by staying coordinated with the leader and maintaining the desired formation pattern. In addition, an exploration algorithm is designed and integrated into the framework so as to allow each group to be able to explore goals in a collaborative and efficient manner. A series of comprehensive experiments are conducted in order to verify the overall performance of the proposed framework.


2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.


2021 ◽  
Author(s):  
Michał Kański ◽  
Artur Niewiadomski ◽  
Magdalena Kacprzak ◽  
Wojciech Penczek ◽  
Wojciech Nabiałek

In this paper, we deal with verification of multi-agent systems represented as concurrent game structures. To express properties to be verified, we use Alternating-Time Temporal Logic (ATL) formulas. We provide an implementation of symbolic model checking for ATL and preliminary, but encouraging experimental results.


Author(s):  
Alberto Pozanco ◽  
Yolanda E-Martín ◽  
Susana Fernández ◽  
Daniel Borrajo

In non-cooperative multi-agent systems, agents might want to prevent the opponents from achieving their goals. One alternative to solve this task would be using counterplanning to generate a plan that allows an agent to block other's to reach their goals. In this paper, we introduce a fully automated domain-independent approach for counterplanning. It combines; goal recognition to infer an opponent's goal; landmarks' computation to identify subgoals that can be used to block opponents' goals achievement; and classical automated planning to generate plans that prevent the opponent's goals achievement. Experimental results in several domains show the benefits of our novel approach. 


Author(s):  
Jose Alberto Maestro-Prieto ◽  
Sara Rodríguez ◽  
Roberto Casado ◽  
Juan Manuel Corchado

Real world applications using agent-based solutions can include many agents that needs communicate and interact each other in order to meet their objectives. In open multi-agent systems, the problems may include the organisation of a large number of agents that may be heterogeneous, of unpredictable provenance and where competitive behaviours or conflicting objectives may occur. An overview of the alternatives for dealing with these problems is presented, highlighting the way they try to solve or mitigate these problems.


2020 ◽  
Vol 08 (03) ◽  
pp. 253-260
Author(s):  
Jason Gibson ◽  
Tristan Schuler ◽  
Loy McGuire ◽  
Daniel M. Lofaro ◽  
Donald Sofge

This work develops and implements a multi-agent time-based path-planning method using A*. The purpose of this work is to create methods in which multi-agent systems can coordinate actions and complete them at the same time. We utilized A* with constraints defined by a dynamic model of each agent. The model for each agent is updated during each time step and the resulting control is determined. This results in a translational path that each of the agents is physically capable of completing in synchrony. The resulting path is given to the agents as a sequence of waypoints. Periodic updates of the path are calculated, utilizing real-world position and velocity information, as the agents complete the task to account for external disturbances. Our methodology is tested in a dynamic simulation environment as well as on real-world lighter-than-air robotic agents.


2007 ◽  
Vol 16 (01) ◽  
pp. 7-25 ◽  
Author(s):  
SEBASTIAN RODRIGUEZ ◽  
VINCENT HILAIRE ◽  
PABLO GRUER ◽  
ABDER KOUKAM

Numerous works aim to design agents and multi-agent systems architectures in order to enable cooperation and coordination between agents. Most of them use organizational structures or societies metaphor to define the MAS architecture. It seems improbable that a rigid unscalable organization could handle a real world problem, so it is interesting to provide agents with abilities to self-organize according to problem's objectives and environment dynamics. We have chosen the holonic paradigm to provide these abilities to agents. Holons are recursive self-similar entities which are organized in an emergent society — an holarchy. The aim of this paper is to present a formally specified framework for holonic MAS which allows agents to self-organize. The framework is illustrated by an example drawn from a real world problem. Some pertinent properties concerning the self-organizing capabilities of this framework are then proved.


Sign in / Sign up

Export Citation Format

Share Document