scispace - formally typeset
Search or ask a question

Showing papers on "Multi-agent system published in 2009"


Journal ArticleDOI
TL;DR: The authors' convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.
Abstract: We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.

3,238 citations


Journal ArticleDOI
TL;DR: This paper proposes a class of nonlinear consensus protocols, which ensures that the related states of all agents will reach an agreement in a finite time under suitable conditions, and applies these protocols to the formation control, including time-invariant formation, time-varying formation and trajectory tracking.

822 citations


Journal ArticleDOI
TL;DR: Modification to the Olfati-Saber algorithm is proposed and it is shown that the resulting algorithm enables the asymptotic tracking of the virtual leader.
Abstract: All agents being informed and the virtual leader traveling at a constant velocity are the two critical assumptions seen in the recent literature on flocking in multi-agent systems. Under these assumptions, Olfati-Saber in a recent IEEE Transactions on Automatic Control paper proposed a flocking algorithm which by incorporating a navigational feedback enables a group of agents to track a virtual leader. This paper revisits the problem of multi-agent flocking in the absence of the above two assumptions. We first show that, even when only a fraction of agents are informed, the Olfati-Saber flocking algorithm still enables all the informed agents to move with the desired constant velocity, and an uninformed agent to also move with the same desired velocity if it can be influenced by the informed agents from time to time during the evolution. Numerical simulation demonstrates that a very small group of the informed agents can cause most of the agents to move with the desired velocity and the larger the informed group is the bigger portion of agents will move with the desired velocity. In the situation where the virtual leader travels with a varying velocity, we propose modification to the Olfati-Saber algorithm and show that the resulting algorithm enables the asymptotic tracking of the virtual leader. That is, the position and velocity of the center of mass of all agents will converge exponentially to those of the virtual leader. The convergent rate is also given.

817 citations


Journal ArticleDOI
TL;DR: This work shows how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system.
Abstract: In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on system-theoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.

784 citations


Journal ArticleDOI
TL;DR: This paper surveys the literature in manufacturing control systems using distributed artificial intelligence techniques, namely multi-agent systems and holonic manufacturing systems principles and points out the challenges and research opportunities for the future.

770 citations


Proceedings ArticleDOI
15 Mar 2009
TL;DR: Simulation results indicate that the proposed multi-agent system can facilitate the seamless transition from grid connected to an island mode when upstream outages are detected, which denotes the capability of a multi- agent system as a technology for managing the microgrid operation.
Abstract: The objective of this paper is to discuss the design and implementation of a multi-agent system that provides intelligence to a distributed smart grid — a smart grid located at a distribution level. A multi-agent application development will be discussed that involves agent specification, application analysis, application design and application realization. The message exchange in the proposed multi-agent system is designed to be compatible with an IP-based network (IP = Internet Protocol) which is based on the IEEE standard on Foundation for Intelligent Physical Agent (FIPA). The paper demonstrates the use of multi-agent systems to control a distributed smart grid in a simulated environment. The simulation results indicate that the proposed multi-agent system can facilitate the seamless transition from grid connected to an island mode when upstream outages are detected. This denotes the capability of a multi-agent system as a technology for managing the microgrid operation.

715 citations


Journal ArticleDOI
01 Jun 2009
TL;DR: By the theoretical analysis, it is proved that the consensus error can be reduced as small as desired and the proposed method is extended to two cases: agents form a prescribed formation, and agents have the higher order dynamics.
Abstract: A robust adaptive control approach is proposed to solve the consensus problem of multiagent systems. Compared with the previous work, the agent's dynamics includes the uncertainties and external disturbances, which is more practical in real-world applications. Due to the approximation capability of neural networks, the uncertain dynamics is compensated by the adaptive neural network scheme. The effects of the approximation error and external disturbances are counteracted by employing the robustness signal. The proposed algorithm is decentralized because the controller for each agent only utilizes the information of its neighbor agents. By the theoretical analysis, it is proved that the consensus error can be reduced as small as desired. The proposed method is then extended to two cases: agents form a prescribed formation, and agents have the higher order dynamics. Finally, simulation examples are given to demonstrate the satisfactory performance of the proposed method.

564 citations


Journal ArticleDOI
01 Dec 2009
TL;DR: This work extends existing learning algorithms to accommodate restricted action sets caused by the limitations of agent capabilities and group based decision making, and introduces a new class of games called sometimes weakly acyclic games for time-varying objective functions and action sets, and provides distributed algorithms for convergence to an equilibrium.
Abstract: We present a view of cooperative control using the language of learning in games. We review the game-theoretic concepts of potential and weakly acyclic games, and demonstrate how several cooperative control problems, such as consensus and dynamic sensor coverage, can be formulated in these settings. Motivated by this connection, we build upon game-theoretic concepts to better accommodate a broader class of cooperative control problems. In particular, we extend existing learning algorithms to accommodate restricted action sets caused by the limitations of agent capabilities and group based decision making. Furthermore, we also introduce a new class of games called sometimes weakly acyclic games for time-varying objective functions and action sets, and provide distributed algorithms for convergence to an equilibrium.

524 citations


Journal ArticleDOI
TL;DR: It is shown that arbitrary bounded time-delays can safely be tolerated, even though the communication structures between agents dynamically change over time and the corresponding directed graphs may not have spanning trees.

490 citations


Journal ArticleDOI
TL;DR: A new approach based on a tree-type transformation to investigate consensus problems in all three cases of finite-time consensus in directed networks with dynamically changing topologies and nonuniform time-varying delays is proposed.
Abstract: In this note, we study consensus problems for continuous-time multi-agent systems in directed networks with dynamically changing topologies and nonuniform time-varying delays. We have analyzed consensus problems in the following three cases: 1) directed networks with dynamically changing topologies and nonuniform time-varying delays; 2) directed networks with intermittent communication and data packet dropout; and 3) finite-time consensus in directed networks with dynamically changing topologies and nonuniform time-varying delays. We propose a new approach based on a tree-type transformation to investigate consensus problems in all three cases. Some necessary and/ or sufficient conditions are established. Simulation results are also given to demonstrate the theoretical results.

380 citations


Book ChapterDOI
23 Jun 2009
TL;DR: In this article, a specification language based on epistemic logic for knowledge has been proposed to express security specifications involving anonymity in epistemic formalisms as they explicitly state the lack of different kinds of knowledge of the principals.
Abstract: While temporal logic in its various forms has proven essential to reason about reactive systems, agent-based scenarios are typically specified by considering high-level agents attitudes. In particular, specification languages based on epistemic logic [7], or logics for knowledge, have proven useful in a variety of areas including robotics, security protocols, web-services, etc. For example, security specifications involving anonymity [4] are known to be naturally expressible in epistemic formalisms as they explicitly state the lack of different kinds of knowledge of the principals.

Journal ArticleDOI
TL;DR: In this paper, the authors study a model of opinion dynamics introduced by Krause, where each agent has an opinion represented by a real number, and updates its opinion by averaging all agent opinions that differ from its own by less than one.
Abstract: We study a model of opinion dynamics introduced by Krause: each agent has an opinion represented by a real number, and updates its opinion by averaging all agent opinions that differ from its own by less than one. We give a new proof of convergence into clusters of agents, with all agents in the same cluster holding the same opinion. We then introduce a particular notion of equilibrium stability and provide lower bounds on the inter-cluster distances at a stable equilibrium. To better understand the behavior of the system when the number of agents is large, we also introduce and study a variant involving a continuum of agents, obtaining partial convergence results and lower bounds on inter-cluster distances, under some mild assumptions.

Proceedings ArticleDOI
13 Dec 2009
TL;DR: This brief tutorial introducesAgent-based modeling by describing the foundations of ABMS, discussing some illustrative applications, and addressing toolkits and methods for developing agent-based models.
Abstract: Agent-based modeling and simulation (ABMS) is a new approach to modeling systems comprised of autonomous, interacting agents. Computational advances have made possible a growing number of agent-based models across a variety of application domains. Applications range from modeling agent behavior in the stock market, supply chains, and consumer markets, to predicting the spread of epidemics, mitigating the threat of bio-warfare, and understanding the factors that may be responsible for the fall of ancient civilizations. Such progress suggests the potential of ABMS to have far-reaching effects on the way that businesses use computers to support decision-making and researchers use agent-based models as electronic laboratories. Some contend that ABMS "is a third way of doing science" and could augment traditional deductive and inductive reasoning as discovery methods. This brief tutorial introduces agent-based modeling by describing the foundations of ABMS, discussing some illustrative applications, and addressing toolkits and methods for developing agent-based models.

Posted Content
TL;DR: This paper examines the entire continuum of agent based toolkits and characterize each based on 5 important characteristics users consider when choosing a toolkit, and then categorize the characteristics into user-friendly taxonomies that aid in rapid indexing and easy reference.
Abstract: Agent Based Modeling (ABM) toolkits are as diverse as the community of people who use them. With so many toolkits available, the choice of which one is best suited for a project is left to word of mouth, past experiences in using particular toolkits and toolkit publicity. This is especially troublesome for projects that require specialization. Rather than using toolkits that are the most publicized but are designed for general projects, using this paper, one will be able to choose a toolkit that already exists and that may be built especially for one's particular domain and specialized needs. In this paper, we examine the entire continuum of agent based toolkits. We characterize each based on 5 important characteristics users consider when choosing a toolkit, and then we categorize the characteristics into user-friendly taxonomies that aid in rapid indexing and easy reference.

Proceedings ArticleDOI
01 Dec 2009
TL;DR: In this article, the authors considered a first-order agreement problem in a multi-agent system, where each agent needs to be aware of the states of its neighbors for the controller implementation.
Abstract: Event-driven strategies for multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the individual agent controller updates. The control actuation updates considered in this paper are event-driven, depending on the ratio of a certain measurement error with respect to the norm of a function of the state, and are applied to a first order agreement problem. A centralized formulation of the problem is considered first and then the results are extended to the decentralized counterpart, in which agents require knowledge only of the states of their neighbors for the controller implementation.

Journal ArticleDOI
TL;DR: With the help of graph theory and convex analysis, coordination conditions are obtained in some important cases, and the results show that simple local rules can make the networked agents with first-order nonlinear individual dynamics achieve desired collective behaviors.

Journal ArticleDOI
TL;DR: This paper proposes decentralized model predictive control schemes that take into account constraints on the agents' input and show that they guarantee consensus under mild assumptions.
Abstract: In this paper, we address the problem of driving a group of agents towards a consensus point when the agents have a discrete-time single- or double-integrator dynamics and the communication network is time-varying. We propose decentralized model predictive control schemes that take into account constraints on the agents' input and show that they guarantee consensus under mild assumptions. Since the global cost does not decrease monotonically, it cannot be used as a Lyapunov function for proving convergence to consensus. For this reason, our proofs exploit geometric properties of the optimal path followed by individual agents.

Journal ArticleDOI
TL;DR: This paper has two main objectives: to present problems, methods, approaches and practices in traffic engineering (especially regarding traffic signal control); and to highlight open problems and challenges so that future research in multiagent systems can address them.
Abstract: The increasing demand for mobility in our society poses various challenges to traffic engineering, computer science in general, and artificial intelligence and multiagent systems in particular As it is often the case, it is not possible to provide additional capacity, so that a more efficient use of the available transportation infrastructure is necessary This relates closely to multiagent systems as many problems in traffic management and control are inherently distributed Also, many actors in a transportation system fit very well the concept of autonomous agents: the driver, the pedestrian, the traffic expert; in some cases, also the intersection and the traffic signal controller can be regarded as an autonomous agent However, the "agentification" of a transportation system is associated with some challenging issues: the number of agents is high, typically agents are highly adaptive, they react to changes in the environment at individual level but cause an unpredictable collective pattern, and act in a highly coupled environment Therefore, this domain poses many challenges for standard techniques from multiagent systems such as coordination and learning This paper has two main objectives: (i) to present problems, methods, approaches and practices in traffic engineering (especially regarding traffic signal control); and (ii) to highlight open problems and challenges so that future research in multiagent systems can address them

Journal ArticleDOI
TL;DR: It is shown that the closed-loop dynamics of the proposed multi-agent system can be transformed into a form of a stochastic approximation algorithm and prove its convergence using Ljung's ordinary differential equation approach.

Posted Content
TL;DR: This paper discusses the specific aspects of this approach to modeling and simulation from the perspective of Informatics, describing the typical elements of an agent-based simulation model and the relevant research.
Abstract: The term computer simulation is related to the usage of a computational model in order to improve the understanding of a system's behavior and/or to evaluate strategies for its operation, in explanatory or predictive schemes. There are cases in which practical or ethical reasons make it impossible to realize direct observations: in these cases, the possibility of realizing 'in-machina' experiments may represent the only way to study, analyze and evaluate models of those realities. Different situations and systems are characterized by the presence of autonomous entities whose local behaviors (actions and interactions) determine the evolution of the overall system; agent-based models are particularly suited to support the definition of models of such systems, but also to support the design and implementation of simulators. Agent-Based models and Multi-Agent Systems (MAS) have been adopted to simulate very different kinds of complex systems, from the simulation of socio-economic systems to the elaboration of scenarios for logistics optimization, from biological systems to urban planning. This paper discusses the specific aspects of this approach to modeling and simulation from the perspective of Informatics, describing the typical elements of an agent-based simulation model and the relevant research.


BookDOI
03 Jun 2009
TL;DR: This reference book provides the necessary overview of experiences with MAS simulation and the tools needed to exploit simulation in MAS for future research in a vast array of applications including home security, computational systems biology, and traffic management.
Abstract: Methodological Guidelines for Modeling and Developing MAS-Based Simulations The intersection of agents, modeling, simulation, and application domains has been the subject of active research for over two decades Although agents and simulation have been used effectively in a variety of application domains, much of the supporting research remains scattered in the literature, too often leaving scientists to develop multi-agent system (MAS) models and simulations from scratch Multi-Agent Systems: Simulation and Applications provides an overdue review of the wide ranging facets of MAS simulation, including methodological and application-oriented guidelines This comprehensive resource reviews two decades of research in the intersection of MAS, simulation, and different application domains It provides scientists and developers with disciplined engineering approaches to modeling and developing MAS-based simulations After providing an overview of the fields history and its basic principles, as well as cataloging the various simulation engines for MAS, the book devotes three sections to current and emerging approaches and applications Simulation for MAS explains simulation support for agent decision making, the use of simulation for the design of self-organizing systems, the role of software architecture in simulating MAS, and the use of simulation for studying learning and stigmergic interaction MAS for Simulation discusses an agent-based framework for symbiotic simulation, the use of country databases and expert systems for agent-based modeling of social systems, crowd-behavior modeling, agent-based modeling and simulation of adult stem cells, and agents for traffic simulation Tools presents a number of representative platforms and tools for MAS and simulation, including Jason, James II, SeSAm, and RoboCup Rescue Complete with over 200 figures and formulas, this reference book provides the necessary overview of experiences with MAS simulation and the tools needed to exploit simulation in MAS for future research in a vast array of applications including home security, computational systems biology, and traffic management

Proceedings Article
10 May 2009
TL;DR: This paper describes a new algebraic approach, shows some theoretical properties of it, and empirically evaluates it on two social network datasets, incorporating a new methodology that involves dealing with opinions in an evidential setting.
Abstract: Trust is a crucial basis for interactions among parties in large, open systems. Yet, the scale and dynamism of such systems make it infeasible for each party to have a direct basis for trusting another party. For this reason, the participants in an open system must share information about trust. However, they should not automatically trust such shared information. This paper studies the problem of propagating trust in multiagent systems. It describes a new algebraic approach, shows some theoretical properties of it, and empirically evaluates it on two social network datasets. This evaluation incorporates a new methodology that involves dealing with opinions in an evidential setting.

Journal ArticleDOI
TL;DR: A personalized multi-agent e-learning system based on item response theory and artificial neural network which presents adaptive tests and personalized recommendations (based on IRT and ANN) and these agents add adaptivity and interactivity to the learning environment and act as a human instructor which guides the learners in a friendly and personalized teaching environment.
Abstract: In web-based educational systems the structure of learning domain and content are usually presented in the static way, without taking into account the learners' goals, their experiences, their existing knowledge, their ability (known as insufficient flexibility), and without interactivity (means there is less opportunity for receiving instant responses or feedbacks from the instructor when learners need support). Therefore, considering personalization and interactivity will increase the quality of learning. In the other side, among numerous components of e-learning, assessment is an important part. Generally, the process of instruction completes with the assessment and it is used to evaluate learners' learning efficiency, skill and knowledge. But in web-based educational systems there is less attention on adaptive and personalized assessment. Having considered the importance of tests, this paper proposes a personalized multi-agent e-learning system based on item response theory (IRT) and artificial neural network (ANN) which presents adaptive tests (based on IRT) and personalized recommendations (based on ANN). These agents add adaptivity and interactivity to the learning environment and act as a human instructor which guides the learners in a friendly and personalized teaching environment.

Journal ArticleDOI
TL;DR: A relatively generic agent-oriented metamodel whose suitability for supporting modeling language development is demonstrated and is a potential candidate for future standardization as an important component for engineering an agent modeling language.
Abstract: In some areas of software engineering research, there are several metamodels claiming to capture the main issues. Though it is profitable to have variety at the beginning of a research field, after some time, the diversity of metamodels becomes an obstacle, for instance to the sharing of results between research groups. To reach consensus and unification of existing metamodels, metamodel-driven software language engineering can be applied. This paper illustrates an application of software language engineering in the agent-oriented software engineering research domain. Here, we introduce a relatively generic agent-oriented metamodel whose suitability for supporting modeling language development is demonstrated by evaluating it with respect to several existing methodology-specific metamodels. First, the metamodel is constructed by a combination of bottom-up and top-down analysis and best practice. The concepts thus obtained and their relationships are then evaluated by mapping to two agent-oriented metamodels: TAO and Islander. We then refine the metamodel by extending the comparisons with the metamodels implicit or explicit within five more extant agent-oriented approaches: Adelfe, PASSI, Gaia, INGENIAS, and Tropos. The resultant FAML metamodel is a potential candidate for future standardization as an important component for engineering an agent modeling language.

Journal ArticleDOI
TL;DR: In this article, the authors present a decentralized optimization method known as constraint-based reasoning, which allows individual agents in a multi-agent system to optimize their behaviors over various alternatives and incorporates the optimization of all agents' objectives through an interaction scheme, in which the ith agent optimizes its objective with a selected priority for collaboration and forwards the solution and consequences to all agents that interact with it.
Abstract: [1] A watershed can be simulated as a multiagent system (MAS) composed of spatially distributed land and water users (agents) within a common defined environment. The watershed system is characterized by distributed decision processes at the agent level with a coordination mechanism organizing the interactions among individual decision processes at the system level. This paper presents a decentralized (distributed) optimization method known as constraint-based reasoning, which allows individual agents in an MAS to optimize their behaviors over various alternatives. The method incorporates the optimization of all agents' objectives through an interaction scheme, in which the ith agent optimizes its objective with a selected priority for collaboration and forwards the solution and consequences to all agents that interact with it. Agents are allowed to determine how important their own objectives are in comparison with the constraints, using a local interest factor (βi). A large βi value indicates a selfish agent who puts high priority on its own benefit and ignores collaboration requirements. This bottom-up problem-solving approach mimics real-world watershed management problems better than conventional “top-down” optimization methods in which it is assumed that individual agents will completely comply with any recommendations that the coordinator makes. The method is applied to a steady state hypothetical watershed with three off-stream human agents, one in-stream human agent (reservoir), and two ecological agents.

Book
30 Mar 2009
TL;DR: The Handbook of Research on Multi-Agent Systems for Traffic and Transportation Engineering provides a unique compendium of research covering topics such as transportation system designs, control devices, and techniques to optimize existing networks.
Abstract: Our increasing societal demand for mobility now challenges researchers to devise more efficient traffic and transportation systems.The Handbook of Research on Multi-Agent Systems for Traffic and Transportation Engineering provides a unique compendium of research covering topics such as transportation system designs, control devices, and techniques to optimize existing networks. Presenting a collection of approaches to issues in traffic and transportation, this authoritative reference offers a compilation of chapters with innovative methods and systems written by leading international researchers.

Proceedings Article
07 Dec 2009
TL;DR: A model for how people can infer social goals from actions, based on inverse planning in multiagent Markov decision problems (MDPs), is proposed and behavioral evidence is presented in support of this model over a simpler, perceptual cue-based alternative.
Abstract: Everyday social interactions are heavily influenced by our snap judgments about others' goals. Even young infants can infer the goals of intentional agents from observing how they interact with objects and other agents in their environment: e.g., that one agent is 'helping' or 'hindering' another's attempt to get up a hill or open a box. We propose a model for how people can infer these social goals from actions, based on inverse planning in multiagent Markov decision problems (MDPs). The model infers the goal most likely to be driving an agent's behavior by assuming the agent acts approximately rationally given environmental constraints and its model of other agents present. We also present behavioral evidence in support of this model over a simpler, perceptual cue-based alternative.

Journal ArticleDOI
TL;DR: In this paper, the authors study the consensus problems for a group of interacting agents and prove that the agents of the group under a particular type of nonlinear interaction can reach the consensus state in finite time in the scenarios with fixed and switching undirected topologies.

Journal ArticleDOI
TL;DR: This paper has developed an IEEE FIPA compliant mobile agent system called Mobile-C and designed an agent-based real-time traffic detection and management system (ABRTTDMS), which takes advantages of both stationary agents and mobile agents.
Abstract: Agent technology is rapidly emerging as a powerful computing paradigm to cope with the complexity in dynamic distributed systems, such as traffic control and management systems. However, while a number of agent-based traffic control and management systems have been proposed and the multi-agent systems have been studied, to the best of our knowledge, the mobile agent technology has not been applied to this field. In this paper, we propose to integrate mobile agent technology with multi-agent systems to enhance the ability of the traffic management systems to deal with the uncertainty in a dynamic environment. In particular, we have developed an IEEE FIPA compliant mobile agent system called Mobile-C and designed an agent-based real-time traffic detection and management system (ABRTTDMS). The system based on Mobile-C takes advantages of both stationary agents and mobile agents. The use of mobile agents allows ABRTTDMS dynamically deploying new control algorithms and operations to respond unforeseen events and conditions. Mobility also reduces incident response time and data transmission over the network. The simulation of using mobile agents for dynamic algorithm and operation deployment demonstrates that mobile agent approach offers great flexibility in managing dynamics in complex systems.