scispace - formally typeset
Search or ask a question
Topic

Multi-agent system

About: Multi-agent system is a research topic. Over the lifetime, 27978 publications have been published within this topic receiving 465191 citations. The topic is also known as: multi-agent systems & multiagent system.


Papers
More filters
Journal ArticleDOI
TL;DR: The potential and limitations of the MAS are discussed to build models that enable spatial planners to include the 'actor factor' in their analysis and design of spatial scenarios.

160 citations

Journal ArticleDOI
TL;DR: In this article, a review of the development and use of multi-agent modelling techniques and simulations in the context of manufacturing systems and supply chain management (SCM) is presented.
Abstract: This paper offers a review of the development and use of multi-agent modelling techniques and simulations in the context of manufacturing systems and supply chain management (SCM). The objective of the paper is twofold. First, it presents a comprehensive literature review of current multi-agent systems (MAS) research applications in the field of manufacturing systems and SCM. Second, it aims to identify and evaluate some key issues involved in using MAS methods to model and simulate manufacturing systems. A variety of different MAS applications are reviewed in three different classified research areas: production design and development, production planning and control, and SCM. In presenting a detailed taxonomy of MAS applications, the paper describes MAS application domains from five different perspectives. The review suggests the MAS approach represents a feasible framework for designing and analysing real-time manufacturing operations, since the approach is capable of modelling different levels of agen...

160 citations

Proceedings ArticleDOI
19 Jul 2004
TL;DR: This paper reports on a novel anytime algorithm for coalition structure generation that produces solutions that are within a finite bound from the optimal, and is shown to be up to 10^379 times faster (for systems containing 1000 agents) when small bounds fromThe optimal are desirable.
Abstract: The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent systems. When effective, such coalitions can improve the performance of the individual agents and/or of the system as a whole. However, one of the main problems that hinders the wide spread adoption of coalition formation technologies is the computational complexity of coalition structure generation. That is, once a group of agents has been identified, how can it be partitioned in order tomaximise the social payoff? This problem has been shown to be NP-hard and even finding a sub-optimal solution requires searching an exponential number of solutions. Against this background, this paper reports on a novel anytime algorithm for coalition structure generation that produces solutions that are within a finite bound from the optimal. Our algorithm is benchmarked against Sandholm et al.ýs algorithm [8] (the only other known algorithm for this task that can also establish a worst-case bound from the optimal) and is shown to be up to 10^379 times faster (for systems containing 1000 agents) when small bounds from the optimal are desirable.

159 citations

Book ChapterDOI
01 Jan 2012
TL;DR: A basic learning framework based on the economic research into game theory is described, and a representative selection of algorithms for the different areas of multi-agent reinforcement learning research is described.
Abstract: Reinforcement Learning was originally developed for Markov Decision Processes (MDPs). It allows a single agent to learn a policy that maximizes a possibly delayed reward signal in a stochastic stationary environment. It guarantees convergence to the optimal policy, provided that the agent can sufficiently experiment and the environment in which it is operating is Markovian. However, when multiple agents apply reinforcement learning in a shared environment, this might be beyond the MDP model. In such systems, the optimal policy of an agent depends not only on the environment, but on the policies of the other agents as well. These situations arise naturally in a variety of domains, such as: robotics, telecommunications, economics, distributed control, auctions, traffic light control, etc. In these domains multi-agent learning is used, either because of the complexity of the domain or because control is inherently decentralized. In such systems it is important that agents are capable of discovering good solutions to the problem at hand either by coordinating with other learners or by competing with them. This chapter focuses on the application reinforcement learning techniques in multi-agent systems. We describe a basic learning framework based on the economic research into game theory, and illustrate the additional complexity that arises in such systems. We also described a representative selection of algorithms for the different areas of multi-agent reinforcement learning research.

158 citations

Journal ArticleDOI
TL;DR: A novel decentralized solution to the coalition formation process that pervades disaster management is provided using the state-of-the-art Max-Sum algorithm that provides a completely decentralized message-passing solution and a novel algorithm (F-Max-Sum) that avoids sending redundant messages and efficiently adapts to changes in the environment.
Abstract: Emergency responders are faced with a number of significant challenges when managing major disasters. First, the number of rescue tasks posed is usually larger than the number of responders (or agents) and the resources available to them. Second, each task is likely to require a different level of effort in order to be completed by its deadline. Third, new tasks may continually appear or disappear from the environment, thus requiring the responders to quickly recompute their allocation of resources. Fourth, forming teams or coalitions of multiple agents from different agencies is vital since no single agency will have all the resources needed to save victims, unblock roads and extinguish the fires which might erupt in the disaster space. Given this, coalitions have to be efficiently selected and scheduled to work across the disaster space so as to maximize the number of lives and the portion of the infrastructure saved. In particular, it is important that the selection of such coalitions should be performed in a decentralized fashion in order to avoid a single point of failure in the system. Moreover, it is critical that responders communicate only locally given they are likely to have limited battery power or minimal access to long-range communication devices. Against this background, we provide a novel decentralized solution to the coalition formation process that pervades disaster management. More specifically, we model the emergency management scenario defined in the RoboCup Rescue disaster simulation platform as a coalition formation with spatial and temporal constraints (CFST) problem where agents form coalitions to complete tasks, each with different demands. To design a decentralized algorithm for CFST, we formulate it as a distributed constraint optimization problem and show how to solve it using the state-of-the-art Max-Sum algorithm that provides a completely decentralized message-passing solution. We then provide a novel algorithm (F-Max-Sum) that avoids sending redundant messages and efficiently adapts to changes in the environment. In empirical evaluations, our algorithm is shown to generate better solutions than other decentralized algorithms used for this problem.

158 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
90% related
Optimization problem
96.4K papers, 2.1M citations
87% related
Fuzzy logic
151.2K papers, 2.3M citations
86% related
Artificial neural network
207K papers, 4.5M citations
85% related
Wireless sensor network
142K papers, 2.4M citations
85% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023536
20221,212
2021849
20201,098
20191,079
20181,105