In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft real-time constraints. We first develop a classification of unexpected events into Opportunities, Barriers and Potential Causes of Failure, and outline the interaction required to support the allocation of tasks for these events. We then propose a hybrid architecture to provide for agent autonomy in the system, employing a central coordinating agent. Certain agents in the community operate autonomously, while others remain under the control of the coordinating agent. The coordinator is able to determine which agents should form teams to address unexpected events in a timely manner, and to oversee those agents as they perform their tasks. The proposed architecture avoids the overhead of negotiation amongst agent teams for the assignment of tasks, a benefit when operating under limited time and resource constraints. It also avoids the bottleneck of having one coordinating agent making all decisions before work can proceed in the community, by allowing some agents to work independently. We illustrate the potential usefulness of the framework by describing an implementation of a simulator loosely based on that used for the RoboCup Rescue Simulation League contest. The implementation provides a set of simulated computers, each running a simple soft real-time operating system. On top of this basic simulation we implement the model described above and test it against two different search-and-rescue scenarios. From our experiments, we observe that our architecture is able to operate in dynamic and real-time environments, and can handle, in an appropriate and timely manner, any unexpected events that occur. We also comment on the value of our proposed approach for designing adjustable autonomy multi-agent systems and for specific environments such as robotics, where reducing the overall level of communication within the system is crucial.

Controlling systems with multiple robots is quickly becoming the next large hurdle that must be overcome for groups of robots to successfully function as a team. An agent oriented approach for this problem is presented in this thesis. By using an agent oriented method, the robots can act independently yet still work together. To be able to establish communities of robots, a basic agent oriented control system for each robot must first be implemented. This thesis introduces a novel method to create Physical Robot Agents, promoting a separation of cognitive and reactive behaviours into a two layer system. These layers are further abstracted into key subsections that are required for the Physical Robot Agents to function. To test this architecture, experiments are performed with physical robots to determine the feasibility of this approach. <br /><br /> A real-time implementation of a Physical Robot Agent would greatly expand its field of use. The speed of internal communication is analyzed to validate the application of this architecture to real-time tasks. <br /><br /> It is concluded that the Physical Robot Agents are well suited for multiple robot systems and that real-time applications are feasible.

Thesis is to Introduce an Intelligent cross platform architecture with Multi-agent system in order to equip the simulation Models with agents, having intelligent behavior, reactive and pro-active nature and rational in decision making.

A simple asset pricing model with two types of adaptively learning traders, fundamentalists and technical analysts, is studied. Fractions of these trader types, which are both boundedly rational, change over time according to evolutionary learning, with technical analysts conditioning their forecasting rule upon deviations from a benchmark fundamental. Volatility clustering arises endogenously in this model. Two mechanisms are proposed as an explanation. The first is coexistence of a stable steady state and a stable limit cycle, which arise as a consequence of a so-called Chenciner bifurcation of the system. The second is intermittency and associated bifurcation routes to strange attractors. Both phenomena are persistent and occur generically in nonlinear multi-agent evolutionary systems. (author's abstract) / Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"

Controlling systems with multiple robots is quickly becoming the next large hurdle that must be overcome for groups of robots to successfully function as a team. An agent oriented approach for this problem is presented in this thesis. By using an agent oriented method, the robots can act independently yet still work together. To be able to establish communities of robots, a basic agent oriented control system for each robot must first be implemented. This thesis introduces a novel method to create Physical Robot Agents, promoting a separation of cognitive and reactive behaviours into a two layer system. These layers are further abstracted into key subsections that are required for the Physical Robot Agents to function. To test this architecture, experiments are performed with physical robots to determine the feasibility of this approach. <br /><br /> A real-time implementation of a Physical Robot Agent would greatly expand its field of use. The speed of internal communication is analyzed to validate the application of this architecture to real-time tasks. <br /><br /> It is concluded that the Physical Robot Agents are well suited for multiple robot systems and that real-time applications are feasible.

In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft real-time constraints. We first develop a classification of unexpected events into Opportunities, Barriers and Potential Causes of Failure, and outline the interaction required to support the allocation of tasks for these events. We then propose a hybrid architecture to provide for agent autonomy in the system, employing a central coordinating agent. Certain agents in the community operate autonomously, while others remain under the control of the coordinating agent. The coordinator is able to determine which agents should form teams to address unexpected events in a timely manner, and to oversee those agents as they perform their tasks. The proposed architecture avoids the overhead of negotiation amongst agent teams for the assignment of tasks, a benefit when operating under limited time and resource constraints. It also avoids the bottleneck of having one coordinating agent making all decisions before work can proceed in the community, by allowing some agents to work independently. We illustrate the potential usefulness of the framework by describing an implementation of a simulator loosely based on that used for the RoboCup Rescue Simulation League contest. The implementation provides a set of simulated computers, each running a simple soft real-time operating system. On top of this basic simulation we implement the model described above and test it against two different search-and-rescue scenarios. From our experiments, we observe that our architecture is able to operate in dynamic and real-time environments, and can handle, in an appropriate and timely manner, any unexpected events that occur. We also comment on the value of our proposed approach for designing adjustable autonomy multi-agent systems and for specific environments such as robotics, where reducing the overall level of communication within the system is crucial.

Multi-agent systems represent a group of agents that cooperate to solve common tasks in a dynamic environment. Multi-agent control systems have been widely studied in the past few years. The control of multi-agent systems relates to synthesizing control schemes for systems which are inherently distributed and composed of multiple interacting entities. Because of the wide applications of multi-agent theories in large and complex control systems, it is necessary to develop a framework to simplify the process of developing control schemes for multi-agent systems. <br /><br /> In this study, a framework is proposed for the distributed control and coordination of multi-agent systems. In the proposed framework, the control of multi-agent systems is regarded as achieving decentralized control and coordination of agents. Each agent is modeled as a Coordinated Hybrid Agent (CHA) which is composed of an intelligent coordination layer and a hybrid control layer. The intelligent coordination layer takes the coordination input, plant input and workspace input. After processing the coordination primitives, the intelligent coordination layer outputs the desired action to the hybrid layer. In the proposed framework, we describe the coordination mechanism in a domain-independent way, as simple abstract primitives in a coordination rule base for certain dependency relationships between the activities of different agents. The intelligent coordination layer deals with the planning, coordination, decision-making and computation of the agent. The hybrid control layer of the proposed framework takes the output of the intelligent coordination layer and generates discrete and continuous control signals to control the overall process. In order to verify the feasibility of the proposed framework, experiments for both heterogeneous and homogeneous Multi-Agent Systems (MASs) are implemented. In addition, the stability of systems modeled using the proposed framework is also analyzed. The conditions for asymptotic stability and exponential stability of a CHA system are given. <br /><br /> In order to optimize a Multi-Agent System (MAS), a hybrid approach is proposed to address the optimization problem for a MAS modeled using the CHA framework. Both the event-driven dynamics and time-driven dynamics are included for the formulation of the optimization problem. A generic formula is given for the optimization of the framework. A direct identification algorithm is also discussed to solve the optimization problem.

This thesis relates to the usage of trust modelling in multi-agent systems - environments in which there are interacting software agents representing various users (for example, buyers and sellers exchanging products and services in an electronic marketplace). In such applications, trust modelling may be crucial to allow one group of agents (in the e-commerce scenario, buyers) to make effective decisions about which other agents (i.e., sellers) are the most appropriate partners. A number of existing multi-agent trust models have been proposed in the literature to help buyers accurately select the most trustworthy sellers. Our contribution is to propose several modifications that can be applied to existing probabilistic multi-agent trust models. First, we examine how the accuracy of the model can be improved by limiting the network to a portion of the population consisting of the most trustworthy agents, such that the less trustworthy contributions of the remaining agents can be ignored. In particular, we explore how this can be accomplished by either setting a maximum size for a buyer's advisor network or setting a minimum trustworthiness threshold for agents to be accepted into that advisor network, and develop methods for appropriately selecting the values to limit the network size. We demonstrate that for two models, both the Personalized Trust Model (PTM) developed by Zhang as well as TRAVOS, these approaches will yield significant improvements to the accuracy of the trust model, as opposed to using an unrestricted advisor network. Our final proposed modification is to use an advisor referral system in combination with one of the network-limiting approaches. This would ensure that if a particular agent within the advisor network had not met a specified level of experience with the seller under consideration, it could be replaced by another agent that had greater experience with that seller, which should in turn allow for a more accurate modelling of the seller's trustworthiness. We present a particular approach for replacing advisors, and show that this will yield additional improvements in trust-modelling accuracy with both PTM and TRAVOS, especially if the limiting step were such that it would yield a very small advisor network. We believe that these techniques will be very useful for trust researchers seeking to improve the accuracy of their own trust models, and to that end we explain how other researchers could apply these modifications themselves, in order to identify the optimal parameters for their usage. We discuss as well the value of our proposals for identifying an "optimal" size for a social network, and the use of referral systems, for researchers in other areas of artificial intelligence.

In this thesis, we discuss models for multi-agent dynamical systems. We study the tracking/migration problem for flocks and a theoretical framework for design and analysis of flocking algorithm is presented. The interactions between agents in the systems are denoted by potential functions that act as distance functions, hence, the design of proper potential functions are crucial in modelling and analyzing the flocking problem for multi-agent dynamical systems. Constructions for both non-smooth potential functions and smooth potential functions with finite cut-off are investigated in detail. The main contributions of this thesis are to extend the literature of continuous flocking models with impulsive control and delay. Lyapunov function techniques and techniques for stability of continuous and impulsive switching system are used, we study the asymptotic stability of the equilibrium of our models with impulsive control and discovery that by applying impulsive control to Olfati-Saber's continuous model, we can remove the damping term and improve the performance by avoiding the deficiency caused by time delay in velocity sensing. Additionally, we discuss both free-flocking and constrained-flocking algorithm for multi-agent dynamical system, we extend literature results by applying velocity feedbacks which are given by the dynamical obstacles in the environment to our impulsive control and successfully lead to flocking with obstacle avoidance capability in a more energy-efficient way. Simulations are given to support our results, some conclusions are made and future directions are given.

With the convenience and development of digital signature and network technologies, several companies are beginning to transmit documents and messages over networks.This is expected to reduce costs and improve the efficiency of the working process. Based on the typical digital signature technique over public key infrastructure, each company can apply for its own certificate from the certificate authority to enable people to verify whether a message is signed by the company through the public key within the certificate. Generally, a general manager is responsible for signing a message to be published. However, the general manager is not always available; hence, the proxy signature scheme can be an efficient solution to this problem. In the typical proxy signature scheme, the delegator will delegate a proxy agent with the power of signing. The proxy agent can sign and produce the signature of the company on behalf of the general manager. A malicious proxy agent involved in the signing process may cause substantial damage to the company because of misbehaviors, such as signature forgery. Therefore, we propose a provably secure multi-agent designated proxy re-signature scheme. In the proposed scheme, the general manager designates several agents as delegatees. Each delegatee signs the message and send her/his signature to the proxy. The proxy can re-sign the message to form the signature of the company only when the proxy has obtained signatures from all delegatees. In addition, security definitions and formal proofs are provided in our scheme.