Cooperative Monitoring to Diagnose Multiagent Plans

Diagnosing the execution of a Multiagent Plan (MAP) means identifying and explaining action failures (i.e., actions that did not reach their expected effects). Current approaches to MAP diagnosis are substantially centralized, and assume that action failures are inde-pendent of each other. In this paper, the diagnosis of MAPs, executed in a dynamic and partially observable environment, is addressed in a fully distributed and asynchronous way; in addition, action failures are no longer assumed as independent of each other. The paper presents a novel methodology, named Cooperative Weak-Committed Moni-toring (CWCM), enabling agents to cooperate while monitoring their own actions. Coop-eration helps the agents to cope with very scarcely observable environments: what an agent cannot observe directly can be acquired from other agents. CWCM exploits nondetermin-istic action models to carry out two main tasks: detecting action failures and building trajectory-sets (i.e., structures representing the knowledge an agent has about the environ-ment in the recent past). Relying on trajectory-sets, each agent is able to explain its own action failures in terms of exogenous events that have occurred during the execution of the actions themselves. To cope with dependent failures, CWCM is coupled with a diagnostic engine that distinguishes between primary and secondary action failures. An experimental analysis demonstrates that the CWCM methodology, together with the proposed diagnostic inferences, are effective in identifying and explaining action failures even in scenarios where the system observability is significantly reduced. 1

A More General Theory of Diagnosis from First Principles

Model-based diagnosis has been an active research topic in different communities including artificial intelligence, formal methods, and control. This has led to a set of disparate approaches addressing different classes of systems and seeking different forms of diagnoses. In this paper, we resolve such disparities by generalising Reiter's theory to be agnostic to the types of systems and diagnoses considered. This more general theory of diagnosis from first principles defines the minimal diagnosis as the set of preferred diagnosis candidates in a search space of hypotheses. Computing the minimal diagnosis is achieved by exploring the space of diagnosis hypotheses, testing sets of hypotheses for consistency with the system's model and the observation, and generating conflicts that rule out successors and other portions of the search space. Under relatively mild assumptions, our algorithms correctly compute the set of preferred diagnosis candidates. The main difficulty here is that the search space is no longer a powerset as in Reiter's theory, and that, as consequence, many of the implicit properties (such as finiteness of the search space) no longer hold. The notion of conflict also needs to be generalised and we present such a more general notion. We present two implementations of these algorithms, using test solvers based on satisfiability and heuristic search, respectively, which we evaluate on instances from two real world discrete event problems. Despite the greater generality of our theory, these implementations surpass the special purpose algorithms designed for discrete event systems, and enable solving instances that were out of reach of existing diagnosis approaches

A Framework for Coordinated Control of Multi-Agent Systems

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. 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. 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

Modeling and verification of reconfigurable discrete event control systems

Most modern technological systems rely on complicated control technologies, computer technologies, and networked communication technologies. Their dynamic behavior is intricate due to the concurrence and conflict of various signals. Such complex systems are studied as discrete event control systems (DECSs), while the detailed continuous variable processes are abstracted. Dynamic reconfigurable systems are the trend of all future technological systems, such as flight control systems, vehicle electronic systems, and manufacturing systems. In order to meet control requirements continuously, such a dynamic reconfigurable system is able to actively adjust its configuration at runtime by modifying ist components, connections among components and data, while changes are detected in the internal/external execution environment. Model based design methodologies attract wide attention since they can detect system defect earlier, increase system reliability, and decrease time and cost on system development. An accurate, compact, and easy formal model to be analyzed is the first step of model based design methods. Formal verification is an expected effective method to completely check if a designed system meets all requirements and to improve the system design scheme. Considering the potential benefits of Timed Net Condition/Event Systems (TNCESs) in modeling and analyzing reconfigurable systems, this dissertation deals with formal modeling and verification of reconfigurable discrete event control systems (RDECSs) based on them.Die meisten modernen technologischen Systeme benötigen aufwändige Steuerungs-, Rechner- und Kommunikationstechnologien. Aufgrund von Nebenläufigkeit und Konflikten ergibt sich ein kompliziertes dynamisches Verhalten. Derartige komplexe Systeme werden dadurch untersucht, dass man sie als ereignisdiskrete Steuerungssysteme (Discrete Event Control Systems, DECSs) betrachtet und dabei die detaillierten unterlagerten kontinuierlichen Prozesse abstrahiert. Um die Anforderungen an die Steuerung durchgängig erfüllen zu können adaptieren sich dynamische rekonfigurierbare Systeme zur Laufzeit durch Modifikation ihrer Komponenten, deren Verbindungen untereinander und der gespeicherten Daten, sobald Änderungen in der internen oder externen Umgebung festgestellt werden. Beispiele für dynamische Rekonfigurierbare Systeme finden sich in der Luftfahrt, im Automobilbereich aber auch in Fertigungssystemen. Modellbasierte Entwicklungsmethoden erfreuen sich zunehmender Beliebtheit, da sie es erlauben Fehler früher im Entwicklungsprozess aufzudecken und damit zu höherer Systemverfügbarkeit bei verkürzter Entwicklungszeit führen. Ein formales Modell des Systems bildet hierbei den ersten wichtigen Schritt. Durch formale Verifikation kann dieses Modell effektiv und vollständig überprüft und ggf. verbessert werden. Eine geeignete Modellform hierfür sind Timed Net Condition/Event Systems (TNCESs). Die vorliegende Dissertation befasst sich mit der Anwendung von TNCES zur Modellierung und Verifikation rekonfigurierbarer ereignisdiskreter Steuerungssysteme (RDECSs)

Multi-Agent Systems

A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. Agent systems are open and extensible systems that allow for the deployment of autonomous and proactive software components. Multi-agent systems have been brought up and used in several application domains

Agent based modeling of power distribution systems

The electric power system is a very vast network and becoming more complex each day. The traditional vertically monopolistic structure has been deregulated and replaced by gencos, transcos and, discos; increasing the power system intricacy. During the past few decades there has been remarkable development in software and hardware technologies for the analysis and design activities in power system planning, operation, and control. However, much still depends on the judgment of human experts. A single fault in power system can lead to multiple faults and can collapse the whole system. Power System needs a more decentralized control mechanism for solving these problems. One novel solution would be Multi-agent Systems. A Multi-agent system is a collection of agents, which perceives the system changes and acts on the system in order to achieve its goals. Recent technology developments in the area of Multi-agent systems making it a viable solution for today\u27s complicated power network.;A Multi-agent system model is developed for fault detection and reconfiguration in this thesis work. These models are developed based on graph theory tree models and mathematical models. A set of objective functions are specified in the mathematical model for the restoration of the network.;The agent platform for the fault detection is developed by Java Agent Development Framework. The restoration algorithm is programmed in MATLAB and applied to the distribution system modeled in the commercial software, Distributed Engineering Workstation and Power World Simulator. The test system in this thesis is, a distribution system developed by Southern California Edison called Circuit of the Future.;The Multi-agent system can detect the fault precisely and reconfigures the circuit using the reconfiguration algorithm. The reconfiguration will happen in a way that it always try to supply all the critical loads in the network. When there are multiple solutions available for reconfiguration, the one with good voltage profile and less power loss is selected as the solution. The algorithm makes use of shunt compensation and priority based load shedding in order to control the voltage across the network. Agents make use of learning to speed up the reconfiguration process

A belief-desire-intention architechture with a logic-based planner for agents in stochastic domains

This dissertation investigates high-level decision making for agents that are both goal and utility driven. We develop a partially observable Markov decision process (POMDP) planner which is an extension of an agent programming language called DTGolog, itself an extension of the Golog language. Golog is based on a logic for reasoning about action—the situation calculus. A POMDP planner on its own cannot cope well with dynamically changing environments and complicated goals. This is exactly a strength of the belief-desire-intention (BDI) model: BDI theory has been developed to design agents that can select goals intelligently, dynamically abandon and adopt new goals, and yet commit to intentions for achieving goals. The contribution of this research is twofold: (1) developing a relational POMDP planner for cognitive robotics, (2) specifying a preliminary BDI architecture that can deal with stochasticity in action and perception, by employing the planner.ComputingM. Sc. (Computer Science