Simulated Annealing for Multi-agent Coalition Formation

2009 ◽  
pp. 30-39 ◽  
Author(s):  
Helena Keinänen
Keyword(s):  
Simulated Annealing ◽  
Coalition Formation ◽  
Multi Agent

scholarly journals A multi-responsibility–oriented coalition formation framework for dynamic task allocation in mobile–distributed multi-agent systems

2018 ◽  
Vol 15 (6) ◽  
pp. 172988141881303 ◽  
Author(s):  
Bing Xie ◽  
Xueqiang Gu ◽  
Jing Chen ◽  
LinCheng Shen
Keyword(s):  
Coalition Formation ◽  
Task Allocation ◽  
Game Model ◽  
Multi Agent Systems ◽  
Coalition Game ◽  
Task Execution ◽  
Agent Systems ◽  
Dynamic Task ◽  
Dynamic Task Allocation ◽  
Multi Agent

In this article, we study a problem of dynamic task allocation with multiple agent responsibilities in distributed multi-agent systems. Agents in the research have two responsibilities, communication and task execution. Movements in agent task execution bring changes to the system network structure, which will affect the communication. Thus, agents need to be autonomous on communication network reconstruction for good performance on task execution. First, we analyze the relationships between the two responsibilities of agents. Then, we design a multi-responsibility–oriented coalition formation framework for dynamic task allocation with two parts, namely, task execution and self-adaptation communication. For the former part, we integrate our formerly proposed algorithm in the framework for task execution coalition formation. For the latter part, we develop a constrained Bayesian overlapping coalition game model to formulate the communication network. A task-allocation efficiency–oriented communication coalition utility function is defined to optimize a coalition structure for the constrained Bayesian overlapping coalition game model. Considering the geographical location dependence between the two responsibilities, we define constrained agent strategies to map agent strategies to potential location choices. Based on the abovementioned design, we propose a distributed location pruning self-adaptive algorithm for the constrained Bayesian overlapping coalition formation. Finally, we test the performance of our framework, multi-responsibility–oriented coalition formation framework, with simulation experiments. Experimental results demonstrate that the multi-responsibility oriented coalition formation framework performs better than the other two distributed algorithms on task completion rate (by over 9.4% and over 65% on average, respectively).

scholarly journals Heterogeneous Simulated Annealing Teams: An Optimizing Search Algorithm Inspired by Engineering Design Teams

2018 ◽  
Author(s):  
Christopher McComb ◽  
Jonathan Cagan ◽  
Kenneth Kotovsky
Keyword(s):  
Simulated Annealing ◽  
Engineering Design ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Random Search ◽  
Design Teams ◽  
Design Cognition ◽  
Gradient Based ◽  
Multi Agent ◽  
Annealing Algorithms

Although insights uncovered by design cognition are often utilized to develop the methods used by human designers, using such insights to inform computational methodologies also has the potential to improve the performance of design algorithms. This paper uses insights from research on design cognition and design teams to inform a better simulated annealing search algorithm. Simulated annealing has already been established as a model of individual problem solving. This paper introduces the Heterogeneous Simulated Annealing Team (HSAT) algorithm, a multi-agent simulated annealing algorithm. Each agent controls an adaptive annealing schedule, allowing the team develop heterogeneous search strategies. Such diversity is a natural part of engineering design, and boosts performance in other multi-agent algorithms. Further, interaction between agents in HSAT is structured to mimic interaction between members of a design team. Performance is compared to several other simulated annealing algorithms, a random search algorithm, and a gradient-based algorithm. Compared to other algorithms, the team-based HSAT algorithm returns better average results with lower variance.

scholarly journals Contextual and Possibilistic Reasoning for Coalition Formation

AI ◽  
2020 ◽  
Vol 1 (3) ◽  
pp. 389-417
Author(s):  
Antonis Bikakis ◽  
Patrice Caire
Keyword(s):  
Coalition Formation ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Contextual Reasoning ◽  
Multi Agent

In multi-agent systems, agents often need to cooperate and form coalitions to fulfil their goals, for example by carrying out certain actions together or by sharing their resources. In such situations, some questions that may arise are: Which agent(s) to cooperate with? What are the potential coalitions in which agents can achieve their goals? As the number of possibilities is potentially quite large, how to automate the process? And then, how to select the most appropriate coalition, taking into account the uncertainty in the agents’ abilities to carry out certain tasks? In this article, we address the question of how to identify and evaluate the potential agent coalitions, while taking into consideration the uncertainty around the agents’ actions. Our methodology is the following: We model multi-agent systems as Multi-Context Systems, by representing agents as contexts and the dependencies among agents as bridge rules. Using methods and tools for contextual reasoning, we compute all possible coalitions with which the agents can fulfil their goals. Finally, we evaluate the coalitions using appropriate metrics, each corresponding to a different requirement. To demonstrate our approach, we use an example from robotics.

Multi-agent pursuit coalition formation based on a limited overlapping of the dynamic groups

2019 ◽  
Vol 36 (6) ◽  
pp. 5617-5629
Author(s):  
Mohammed El Habib Souidi ◽  
Abderrahim Siam ◽  
Zhaoyi Pei
Keyword(s):  
Coalition Formation ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document