A Survey on Fault Tolerant Multi Agent System

Abstract

Abstract-A mult i-agent system (MAS) is formed by a number of agents connected together to achieve the desired goals specified by the design. Usually in a mu lti agent system, agents work on behalf of a user to accomplish given goals. In MAS co-ordination, co-operation, negotiation and communication are important aspects to achieve fault tolerance in MAS. The mu lti-agent system is likely to fail in a distributed environment and as an outcome o f such, the resources for MAS may not be available due to the failure of an agent, mach ine crashes, process failure, software failure, communicat ion failure and/or hardware failure. Therefore, many researchers have proposed fault tolerance approaches to overcome the failure in MAS. So we have surveyed these approaches in this paper, whereby our contribution is threefold. Firstly, we have provided taxono my of faults and techniques in MAS. Secondly, we have provided a qualitative comparison of existing fault tolerance approaches. Thirdly, we have provided an evaluation of existing fau lt tolerance techniques. Results show that most of the existing schemes are not very efficient, due to various reasons like high computation costs, costly replication and large co mmunicat ion overheads.

Distributed $\ell _1$-State-and-Fault Estimation for Multiagent Systems

“…Thus, it follows that x 0 + v 1 ≤ x 0 1 . This implies that among all x satisfying Ax 0 = Ax, x 1 does not provide a unique minimum when x = x 0 , which contradicts the fact that x 0 is a unique solution to (2). Therefore, if every T -sparse vector x 0 is a unique solution to (2), the matrix A satisfies T -NSP.…”

“…The above theorem indicates that every T -sparse vector can be reconstructed by solving the 1 -norm optimization problem in (2), if and only if the matrix A satisfies T -NSP. The proof of Theorem 1 follows the same line as [22] and is given in the Appendix.…”

Realtime l1-fault-and-state estimation for multi-agent systems

“…The above theorem indicates that every T -sparse vector can be reconstructed by solving the 1 -norm optimization problem in (2), if and only if the matrix A saisfies T -NSP. The proof of Theorem 1 follows the same line as [13], [14] and is omitted in this paper.…”

“…In recent years, the design of a framework for detecting anomaly or faults has attracted much attention, see e.g. [2]. This is motivated by the fact that multi-agent systems typically consist of many dynamical systems interacting with each other.…”

A Survey: Agent-based Software Technology Under the Eyes of Cyber Security, Security Controls, Attacks and Challenges

“…Due to the benefits of the ABST explained above, it is involved in building a wide spectrum of distributed systems. Resource management in cloud computing [26], fault tolerance [27], distributed network performance management [28], security testing in web-based applications [29], and privacy protection in location-based services [30] are agent-based distributed systems, where agents play a significant role in performing the functionalities of these systems. However, again, the security of mobile agents at the interface remains a critical issue.…”