Basic examination concerning multiagent cooperation with entrainment

The study of a multiagent system generating a new function was carried out. A coordinate solution, such as the multiagent system, is effective for complicated problems. Therefore, it is necessary for agents to behave systematically while building cooperative relations with each other. We pay attention to an entrainment phenomenon which can be seen in life phenomena, such as cardiac muscle cells or the emission of light by a firefly, as an element to promote organized behavior between agents. We suggest a new system model unlike conventional systems.     

Learning Coordination Strategies for Cooperative Multiagent Systems

A central issue in the design of cooperative multiagent systems is how to coordinate the behavior of the agents to meet the goals of the designer. Traditionally, this had been accomplished by hand-coding the coordination strategies. However, this task is complex due to the interactions that can take place among agents. Recent work in the area has focused on how strategies can be learned. Yet, many of these systems suffer from convergence, complexity and performance problems. This paper presents a new approach for learning multiagent coordination strategies that addresses these issues. The effectiveness of the technique is demonstrated using a synthetic domain and the predator and prey pursuit problem.     

Environment as a first class abstraction in multiagent systems

The current practice in multiagent systems typically associates the environment with resources that are external to agents and their communication infrastructure. Advanced uses of the environment include infrastructures for indirect coordination, such as digital pheromones, or support for governed interaction in electronic institutions. Yet, in general, the notion of environment is not well defined. Functionalities of the environment are often dealt with implicitly or in an ad hoc manner. This is not only poor engineering practice, it also hinders engineers to exploit the full potential of the environment in multiagent systems. In this paper, we put forward the environment as an explicit part of multiagent systems.We give a definition stating that the environment in a multiagent system is a first-class abstraction with dual roles: (1) the environment provides the surrounding conditions for agents to exist, which implies that the environment is an essential part of every multiagent system, and (2) the environment provides an exploitable design abstraction for building multiagent system applications. We discuss the responsibilities of such an environment in multiagent systems and we present a reference model for the environment that can serve as a basis for environment engineering. To illustrate the power of the environment as a design abstraction, we show how the environment is successfully exploited in a real world application. Considering the environment as a first-class abstraction in multiagent systems opens up new horizons for research and development in multiagent systems.     

TRAMMAS: A tracing model for multiagent systems

Agent's flexibility and autonomy, as well as their capacity to coordinate and cooperate, are some of the features which make multiagent systems useful to work in dynamic and distributed environments. These key features are directly related to the way in which agents communicate and perceive each other, as well as their environment and surrounding conditions. Traditionally, this has been accomplished by means of message exchange or by using blackboard systems. These traditional methods have the advantages of being easy to implement and well supported by multiagent platforms; however, their main disadvantage is that the amount of social knowledge in the system directly depends on every agent actively informing of what it is doing, thinking, perceiving, etc. There are domains, for example those where social knowledge depends on highly distributed pieces of data provided by many different agents, in which such traditional methods can produce a great deal of overhead, hence reducing the scalability, efficiency and flexibility of the multiagent system. This work proposes the use of event tracing in multiagent systems, as an indirect interaction and coordination mechanism to improve the amount and quality of the information that agents can perceive from both their physical and social environment, in order to fulfill their goals more efficiently. In order to do so, this work presents an abstract model of a tracing system and an architectural design of such model, which can be incorporated to a typical multiagent platform.     

Coordinated learning by exploiting sparse interaction in multiagent systems

Multiagent learning provides a promising paradigm to study how autonomous agents learn to achieve coordinated behavior in multiagent systems. In multiagent learning, the concurrency of multiple distributed learning processes makes the environment nonstationary for each individual learner. Developing an efficient learning approach to coordinate agents’ behavior in this dynamic environment is a difficult problem especially when agents do not know the domain structure and at the same time have only local observability of the environment. In this paper, a coordinated learning approach is proposed to enable agents to learn where and how to coordinate their behavior in loosely coupled multiagent systems where the sparse interactions of agents constrain coordination to some specific parts of the environment. In the proposed approach, an agent first collects statistical information to detect those states where coordination is most necessary by considering not only the potential contributions from all the domain states but also the direct causes of the miscoordination in a conflicting state. The agent then learns to coordinate its behavior with others through its local observability of the environment according to different scenarios of state transitions. To handle the uncertainties caused by agents’ local observability, an optimistic estimation mechanism is introduced to guide the learning process of the agents. Empirical studies show that the proposed approach can achieve a better performance by improving the average agent reward compared with an uncoordinated learning approach and by reducing the computational complexity significantly compared with a centralized learning approach. Copyright © 2012 John Wiley & Sons, Ltd.     

一种基于社会承诺的Agent组织模型OMSC

多Agent领域所面临的一个重大的挑战是解决开放异质的多Agent系统中自治Agent间的协调问题。多Agent为了协调它们之间的活动,需要进行交互。社会承诺作为一种通信和交互机制,为自治的多Agent提供了一种协调的途径。然而,仅靠交互难以实现多Agent间的协调。Agent组织作为一种协调模型可以有效地控制多Agent间的交互与合作。论文将社会承诺和Agent组织两种协调机制相结合,提出一种基于社会承诺的Agent组织模型OMSC,分析了Agent如何用社会承诺进行推理以及基于社会承诺的多Agent系统并给出了一个实例,为多Agent间的协调提供了一种新的方法。     

ACHIEVING FLEXIBLE AUTONOMY IN MULTIAGENT SYSTEMS USING CONSTRAINTS

Organizations influence many aspects of our lives. They exist for one reason: they can accomplish things that individuals cannot. While recent work in high-autonomy systems has shown that autonomy is a critical issue in artificial intelligence (AI) systems, these systems must also be able to cooperate with and rely on one another to deal with complex problems. The autonomy of such systems must be flexible, in order that agents may solve problems on their own as well as in groups. We have developed a model of distributed problem solving in which coordination of problem-solving agents is viewed as a multiagent constraint-satisfaction planning problem. This paper describes the experimental testbed that we are currently developing to facilitate the investigation of various constraint-based strategies for addressing the coordination issues inherent in cooperative distributed problem-solving domains.     

LEARNING AND COORDINATION FOR AUTONOMOUS INTERSECTION CONTROL

Future urban road traffic management is an example of a socially relevant problem that can be modeled as a large-scale, open, distributed system, composed of many autonomous interacting agents, which need to be controlled in a decentralized manner. In this context, advanced, reservation-based, intersection control—where autonomous vehicles controlled entirely by agents interact with a coordination facility that controls an intersection, to avoid collisions and minimize delays—will be a possible scenario in the near future. In this article, we seize the opportunities for multiagent learning offered by such a scenario, studying i) how vehicles, when approaching a reservation-based intersection, can coordinate their actions in order to improve their crossing times, and therefore, speed up the traffic flow through the intersection, and ii) how a set of reservation-based intersections can cooperatively act over an entire network of intersections in order to minimize travel times.     

Analyzing the dynamics of stigmergetic interactions through pheromone games

The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from local stigmergetic interactions is a complex problem. In this paper we propose to use Game Theory to analyze stigmergetic interactions. We show that a system where agents coordinate by sharing local pheromone information can be approximated by a limiting pheromone game in which different pheromone vectors represent player strategies. This game view allows us to use established methods and solution concepts from game theory to describe the properties of stigmergy based systems. Our goal is to provide a new framework to aid in the understanding and design of pheromone interactions. We demonstrate how we can use this system to determine the long term system behavior of a simple pheromone model, by analyzing the convergence properties of the pheromone update rule in the approximating game. We also apply this model to cases where multiple colonies of agents concurrently optimize different objectives. In this case a limiting colony game can be linked to colony level interactions to characterize the global system behavior.     

Individual learning of coordination knowledge

Abstract. Social agents, both human and computational, inhabiting a world containing multiple active agents, need to coordinate their activities. This is because agents share resources, and without proper coordination or ‘rules of the road’, everybody will be interfering with the plans of others. As such, we need coordination schemes that allow agents to effectively achieve local goals without adversely affecting the problem-solving capabilities of other agents. Researchers in the field of Distributed Artificial Intelligence (DAI) have developed a variety of coordination schemes under different assumptions about agent capabilities and relationships. Whereas some of these researchers have been motivated by human cognitive biases, others have approached it as an engineering problem of designing the most effective coordination architecture or protocol. We evaluate individual and concurrent learning by multiple, autonomous agents as a means for acquiring coordination knowledge. We show that a uniform reinforcement learning algorithm suffices as a coordination mechanism in both cooperative and adversarial situations. Using a number of multi-agent learning scenarios with both tight and loose coupling between agents and with immediate as well as delayed feedback, we demonstrate that agents can consistently develop effective policies to coordinate their actions without explicit information sharing. We demonstrate the viabilityof using both the Q-learning algorithm and genetic algorithm based classifier systems with different pay-off schemes, namely the bucket brigade algorithm (BBA) and the profit sharing plan (PSP), for developing agent coordination on two different multi-agent domains. In addition, we show that a semi-random scheme for action selection is preferable to the more traditional fitness proportionate selection scheme used in classifier systems.     

面向自动文摘的多Agent系统中的协调算法研究

为了解决自动文摘系统所面临的领域通用性和文摘质量的矛盾,提出了建造面向自动文摘的多Aent系统（MAS／ABS)的方案。建造这样的系统,有两个关键问题：建立什么样的系统模型和选择什么样的协调算法。给出了在Internet环境下面向自动文摘的多Agent系统模型,提出了3种协调算法。在仿真的基础上分析了系统性能,对3种协调算法进行了比较研究,并得到了在一定负载下面向各个领域合适的文摘Agent数目。     

A Formal Model of Communication and Context Awareness in Multiagent Systems

Awareness is a concept that has been frequently studied in the context of Computer Supported Cooperative Work. However, other fields of computer science can benefit from this concept. Recent research in the multi-agent systems field has highlighted the relevance of complex interaction models such as multi-party communication and context awareness for simulation and adaptive systems. In this article, we present a generic interaction model that enables to use these different models in a standardized way. Emerging as a first-order abstraction, the environment, in the sense of a common medium for the agents, is a suitable paradigm to support the agents’ awareness. We present an operational model, called Environment as Active Support of Interaction, to take into account all the agents that can be interested in a communication. This model is then extended for the regulation of multiagent systems interactions. Priority policies are given to manage the rules governing the context (un-)awareness of the agents. We also present a new AUML connector to create protocols that take into account the agent awareness to implement proactive behaviour, and several communication scenarios are proposed to show practical applications of this model.     

Congregation Formation in Multiagent Systems

We present congregating both as a metaphor for describing and modeling multiagent systems (MAS) and as a means for reducing coordination costs in large-scale MAS. When agents must search for other agents to interact with, congregations provide a way for agents to bias this search towards groups of agents that have tended to produce successful interactions in the past. This causes each agent's search problem to scale with the size of a congregation rather than the size of the population as a whole. In this paper, we present a formal model of a congregation and then apply Vidal and Durfee's CLRI framework [24] to the congregating problem. We apply congregating to the affinity group domain, and show that if agents are unable to describe congregations to each other, the problem of forming optimal congregations grows exponentially with the number of agents. The introduction of labelers provides a means of coordinating agent decisions, thereby reducing the problem's complexity. We then show how a structured label space can be exploited to simplify the labeler's decision problem and make the congregating problem linear in the number of labels. We then present experimental evidence demonstrating how congregating can be used to reduce agents' search costs, thereby allowing the system to scale up. We conclude with a comparison to other methods for coordinating multiagent behavior, particularly teams and coalitions.     

A multiagent network for peer norm enforcement

In a multiagent system where norms are used to regulate the actions agents ought to execute, some agents may decide not to abide by the norms if this can benefit them. Norm enforcement mechanisms are designed to counteract these benefits and thus the motives for not abiding by the norms. In this work we propose a distributed mechanism through which agents in the multiagent system that do not abide by the norms can be ostracised by their peers. An ostracised agent cannot interact anymore and looses all benefits from future interactions. We describe a model for multiagent systems structured as networks of agents, and a behavioural model for the agents in such systems. Furthermore, we provide analytical results which show that there exists an upper bound to the number of potential norm violations when all the agents exhibit certain behaviours. We also provide experimental results showing that both stricter enforcement behaviours and larger percentage of agents exhibiting these behaviours reduce the number of norm violations, and that the network topology influences the number of norm violations. These experiments have been executed under varying scenarios with different values for the number of agents, percentage of enforcers, percentage of violators, network topology, and agent behaviours. Finally, we give examples of applications where the enforcement techniques we provide could be used.     

Wasp-like Agents for Distributed Factory Coordination

Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they offer increased robustness against the unpredictability of factory operations. But the specification of local coordination policies that give rise to efficient global performance and effectively adapt to changing circumstances remains an interesting challenge. In this paper, we present a new approach to this coordination problem, drawing on various aspects of a computational model of how wasp colonies coordinate individual activities and allocate tasks to meet the collective needs of the nest.We focus specifically on the problem of configuring parallel multi-purpose machines in a factory to best satisfy product demands over time. Wasp-like computational agents that we call routing wasps act as overall machine proxies. These agents use a model of wasp task allocation behavior, coupled with a model of wasp dominance hierarchy formation, to determine which new jobs should be accepted into the machine's queue. If you view our system from a market-oriented perspective, the policies that the routing wasps independently adapt for their respective machines can be likened to policies for deciding when to bid and when not to bid for arriving jobs.We benchmark the performance of our system on the real-world problem of assigning trucks to paint booths in a simulated vehicle paintshop. The objective of this problem is to minimize the number of paint color changes accrued by the system, assuming no a priori knowledge of the color sequence or color distribution of trucks arriving in the system. We demonstrate that our system outperforms the bidding mechanism originally implemented for the problem as well as another related adaptive bidding mechanism.     

Adaptive architectures for resilient control of networked multiagent systems in the presence of misbehaving agents

Control algorithms of networked multiagent systems are generally computed distributively without having a centralised entity monitoring the activity of agents; and therefore, unforeseen adverse conditions such as uncertainties or attacks to the communication network and/or failure of agent-wise components can easily result in system instability and prohibit the accomplishment of system-level objectives. In this paper, we study resilient coordination of networked multiagent systems in the presence of misbehaving agents, i.e. agents that are subject to exogenous disturbances that represent a class of adverse conditions. In particular, a distributed adaptive control architecture is presented for directed and time-varying graph topologies to retrieve a desired networked multiagent system behaviour. Apart from the existing relevant literature that make specific assumptions on the graph topology and/or the fraction of misbehaving agents, we show that the considered class of adverse conditions can be mitigated by the proposed adaptive control approach that utilises a local state emulator – even if all agents are misbehaving. Illustrative numerical examples are provided to demonstrate the theoretical findings.     

A framework for organization-aware agents

Open systems are characterized by the presence of a diversity of heterogeneous and autonomous agents that act according to private goals. Organizations, such as those used in real-life to structure human activities such as task allocation, coordination and supervision, can regulate the agents’ behavior space and describe the expected behavior of the agents. Assuming an open environment, where agents are developed independently of the Organizational structures, agents need to be able to reason about the structure, so that they can deliberate about their actions and act within the expected boundaries and work towards the objectives of the organization. In this paper, we present the AORTA reasoning framework and show how it can be integrated into typical BDI-agents. We provide operational semantics that enables agents to make organizational decisions in order to coordinate and cooperate without explicit coordination mechanisms within the agents. The organizational model is independent of that of the agents, and the approach is not tied to a specific organizational model, but uses an organizational metamodel. We show how AORTA helps agents work together in a system with an organization for choosing the best tender for a building project.     

Security policies for sharing knowledge in virtual communities

Knowledge management exploits the new opportunities of sharing knowledge among members of virtual communities in distributed computer networks, and knowledge-management systems are therefore modeled and designed as multiagent systems. In this paper, normative multiagent systems for secure knowledge management based on access-control policies are studied. It is shown how distributed access control is realized by means of local policies of access-control systems for documents of knowledge providers, and by means of global community policies regulating these local policies. Moreover, it is shown how such a virtual community of multiple knowledge providers respects the autonomy of the knowledge providers.     

Wolves, bees, and football: Enhancing coordination in sociotechnological problem solving systems through the study of human and animal groups

This paper describes how sociotechnological systems comprising human and technological agents can be considered problem solving systems. Problem solving systems typically comprise many agents, each characterized by at least partial autonomy. A challenge for problem solving systems is to coordinate system agent operations during problem solving. This paper explores how competence models of human–human and animal–animal coordination might be used to inform the design of problem solving systems so that the potential for agent coordination is enhanced. System design principles are identified based on a review of competent coordination in human groups, such as work and sport teams, and animal groups, such wolf packs and bee colonies. These principles are then discussed in relation to agent coordination in the domains of E-Science, future combat systems, and medicine, which typify real-world environments comprising problem solving systems.