SiMAMT: A Framework for Strategy-Based Multi-Agent Multi-Team Systems

Multi-agent multi-team systems are commonly seen in environments where hierarchical layers of goals are at play. For example, theater-wide combat scenarios where multiple levels of command and control are required for proper execution of goals from the general to the foot soldier. Similar structures can be seen in game environments, where agents work together as teams to compete with other teams. The different agents within the same team must, while maintaining their own ‘personality’, work together and coordinate with each other to achieve a common team goal. This research develops strategy-based multi-agent multi-team systems, where strategy is framed as an instrument at the team level to coordinate the multiple agents of a team in a cohesive way. A formal specification of strategy and strategy-based multi-agent multi-team systems is provided. A framework is developed called SiMAMT (strategy- based multi-agent multi-team systems). The different components of the framework, including strategy simulation, strategy inference, strategy evaluation, and strategy selection are described. A graph-matching approximation algorithm is also developed to support effective and efficient strategy inference. Examples and experimental results are given throughout to illustrate the proposed framework, including each of its composite elements, and its overall efficacy. This research make several contributions to the field of multi-agent multi-team systems: a specification for strategy and strategy-based systems, and a framework for implementing them in real-world, interactive-time scenarios; a robust simulation space for such complex and intricate interaction; an approximation algorithm that allows for strategy inference within these systems in interactive-time; experimental results that verify the various sub-elements along with a full-scale integration experiment showing the efficacy of the proposed framework

TOWARD A PLATFORM FOR MULTI-LAYERED MULTI-AGENT SITUATED SYSTEM (MMASS)-BASED SIMULATIONS: FOCUSING ON FIELD DIFFUSION

The paper introduces some issues and related solutions adopted in order to realize the MMASS platform. This is a framework to specify and execute simulation applications based on the multilayered multi-agent situated system model (MMASS). MMASS is a model for multi-agent systems (MAS) situated in an environment whose structure is explicitly defined. The behavior and interaction models of MMASS agents are strongly related to the spatial structure of their environment. The MMASS model is the result of a long-term research that has its roots and motivations on application domains and problems that require spatial features to be considered. Our experiences with these problems have concerned the design of domain models and their implementations, according to the MAS approach for simulation purposes. This activity has revealed that currently available tools do not support the management of spatial features of agent environment and interaction mechanisms defined by the MMASS model and thus they are not suitable for our purposes. The paper focuses on the MMASS platform that aims to support the specification and development of applications (mainly, simulations) based on MMASS. Design issues and related solutions that have been adopted in order to manage those aspects that characterize the MMASS model will be shown. After a description of the conceptual model that underlies the MMASS platform and its general architecture, we will overview how the platform supports the specification of agent structured environment, behavior and interaction, and how it supports the execution of agent actions and interactions. Then we will describe issues and adopted solutions (both algorithmic and implementative ones) to manage at-a-distance interaction among MMASS agents

Model checking ontology-driven reasoning agents using strategy and abstraction

We present a framework for the modelling, specification and verification of ontology-driven multi-agent rule-based systems (MASs). We assume that each agent executes in a separate process and that they communicate via message passing. The proposed approach makes use of abstract specifications to model the behaviour of some of the agents in the system, and exploits information about the reasoning strategy adopted by the agents. Abstract specifications are given as Linear Temporal Logic (LTL) formulas which describe the external behaviour of the agents, allowing their temporal behaviour to be compactly modelled. Both abstraction and strategy have been combined in an automated model checking encoding tool Tovrba for rule-based multi-agent systems which allows the system designer to specify information about agents' interaction, behaviour, and execution strategy at different levels of abstraction. The Tovrba tool generates an encoding of the system for the Maude LTL model checker, allowing properties of the system to be verified

Agent-based Extensions for the UML Profile for Service-Oriented Architectures (UPMS-A)

Service-Oriented Architectures are today’s favorite answer to solve interoperability issues. As various kinds of systems can be used to implement Service-Oriented Architectures, the recent trend is to apply principles of Model-Driven Development by (i) modeling the Service-Oriented Architecture in an abstract manner and (ii) providing model transformations between this abstract specification and the underlying platform specific systems. As such, Multi-Agent Systems (MASs) became very popular as both, Service-Oriented Architectures and Multi-Agent Systems, share several commonalities. In this thesis, we compare the core building blocks of Multi-Agent Systems and a proposal for a standardized UML Profile and Metamodel for Services (UPMS) requested by the Object Management Group. The major objective of this investigation is to identify if SOA-Pro–the current submission under review–offers functionalities to allow modeling of Multi-Agent Systems adequately and if not to identify what kind of functionality is missing and how this functionality can be achieved. Interaction aspect in MASs describes how the interaction between autonomous entities or organizations take place. In our comparison we found that the ability to multicast messages is one feature that is lacking in UML Sequence Diagrams. This is an important feature or characteristic of agent interaction protocols. Here we show that SOA-Pro can easily be extended to support these kinds of functionalities

Space upper bound analysis for transformation from elementary reference-net system to low-level P/T nets

Elementary Reference-nett Systems (ERS) is a class of Object-Oriented Petri Nets that follows the nets-within-nets paradigm. It combines theoretical properties as well as numerous practical needs for multi-agent-systems specification. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petri nets. This article presents a set of transformation procedure from ERS to basic Petri nets in order to make verification feasible. It further establishes the space upper bound for the transformation which shows that the state space of the transformed P/T net grows exponentially as the number of object nets increases.Keywords: Petri nets, object orientation, agent systems, interaction, mobility, transformatio

Handling temporal constraints in interaction protocols for intelligent multi-agent systems

This research focuses on handling temporal constraints in interaction protocols for multi-agent systems. There is a dire need of standardized interaction protocols that can be used to handle timing aspects in real-time multi-agent system’s negotiation. The most commonly used Foundation for Intelligent Physical Agents Protocol lacks the appropriate specification in this regard. In real-time systems timing constraint is a major concern for all of its tasks and goals. Agents require real-time responses and must eliminate the possibility of massive communication between them. The timing specification of these real-time multi-agent systems in which agents communicate with each other to achieve their goals within deadline will be of great value for their correct functioning. A high degree of dependability and predictability is expected from real-time software agents. The basis of our work is the standardized interaction protocols to support the communication between agents in real-time environment and this is possible via message passing. By incorporation of well-defined timing parameters in Foundation for Intelligent Physical Agents performatives, we have enabled them to be used in any real-time multi-agent’s communication. We demonstrate the usage and effectiveness of our proposed real-time performatives using a case study of monitoring boats in marine reserves in which the agents interact with each other to accomplish their goals

Automated experimentation in ecological networks

BACKGROUND: In ecological networks, natural communities are studied from a complex systems perspective by representing interactions among species within them in the form of a graph, which is in turn analysed using mathematical tools. Topological features encountered in complex networks have been proved to provide the systems they represent with interesting attributes such as robustness and stability, which in ecological systems translates into the ability of communities to resist perturbations of different kinds. A focus of research in community ecology is on understanding the mechanisms by which these complex networks of interactions among species in a community arise. We employ an agent-based approach to model ecological processes operating at the species' interaction level for the study of the emergence of organisation in ecological networks. RESULTS: We have designed protocols of interaction among agents in a multi-agent system based on ecological processes occurring at the interaction level between species in plant-animal mutualistic communities. Interaction models for agents coordination thus engineered facilitate the emergence of network features such as those found in ecological networks of interacting species, in our artificial societies of agents. CONCLUSIONS: Agent based models developed in this way facilitate the automation of the design an execution of simulation experiments that allow for the exploration of diverse behavioural mechanisms believed to be responsible for community organisation in ecological communities. This automated way of conducting experiments empowers the study of ecological networks by exploiting the expressive power of interaction models specification in agent systems.Miguel Lurgi and David Robertso

Bridging the specification protocol gap in argumentation

As multi-agent systems (MAS) have become more mature and systems in general have become more distributed, it is necessary for those who want to build large scale systems to consider, in some computational depth, how agents can communicate in large scale, complex and distributed systems. Currently, some MAS systems have been developed to use an abstract specification language for argumentation. This as a basis for agent communication; to provide effective decision support for agents and yield better agreements. However, as we build complete MAS that involve argumentation, there is a need to produce concrete implementations in which these abstract specifications are realised via protocols coordinating agent behaviour. This creates a gap between standard argument specification and deployment of protocols. This thesis attempts to close this gap by using a combination of automated synthesis and verification methods. More precisely, this thesis proposes a means of moving rapidly from argument specification to protocol implementation using an extension of the Argument Interchange Format (AIF is a generic specification language for argument structure) called a Dialogue Interaction Diagram (DID) as the dialogue game specification language and the Lightweight Coordination Calculus (LCC is an executable specification language used for coordinating agents in open systems) as an implementation language. The main contribution of this research is to provide approaches for enabling developers of dialogue game argumentation systems to use specification languages (in our case AIF/DID) to generate agent protocol systems that are capable of direct implementation on open infrastructures (in our case LCC)

Securing open multi-agent systems governed by electronic institutions

One way to build large-scale autonomous systems is to develop an open multi-agent system using peer-to-peer architectures in which agents are not pre-engineered to work together and in which agents themselves determine the social norms that govern collective behaviour. The social norms and the agent interaction models can be described by Electronic Institutions such as those expressed in the Lightweight Coordination Calculus (LCC), a compact executable specification language based on logic programming and pi-calculus. Open multi-agent systems have experienced growing popularity in the multi-agent community and are expected to have many applications in the near future as large scale distributed systems become more widespread, e.g. in emergency response, electronic commerce and cloud computing. A major practical limitation to such systems is security, because the very openness of such systems opens the doors to adversaries for exploit existing vulnerabilities. This thesis addresses the security of open multi-agent systems governed by electronic institutions. First, the main forms of attack on open multi-agent systems are introduced and classified in the proposed attack taxonomy. Then, various security techniques from the literature are surveyed and analysed. These techniques are categorised as either prevention or detection approaches. Appropriate countermeasures to each class of attack are also suggested. A fundamental limitation of conventional security mechanisms (e.g. access control and encryption) is the inability to prevent information from being propagated. Focusing on information leakage in choreography systems using LCC, we then suggest two frameworks to detect insecure information flows: conceptual modeling of interaction models and language-based information flow analysis. A novel security-typed LCC language is proposed to address the latter approach. Both static (design-time) and dynamic (run-time) security type checking are employed to guarantee no information leakage can occur in annotated LCC interaction models. The proposed security type system is then formally evaluated by proving its properties. A limitation of both conceptual modeling and language-based frameworks is difficulty of formalising realistic policies using annotations. Finally, the proposed security-typed LCC is applied to a cloud computing configuration case study, in which virtual machine migration is managed. The secrecy of LCC interaction models for virtual machine management is analysed and information leaks are discussed