Conference Paper

Consensus-based distributed intrusion detection for multi-robot systems.

Interdepartmental Res. Center "E. Piaggio", Univ. di Pisa, Pisa;
DOI: 10.1109/ROBOT.2008.4543196 Conference: 2008 IEEE International Conference on Robotics and Automation, ICRA 2008, May 19-23, 2008, Pasadena, California, USA
Source: DBLP

ABSTRACT This paper addresses a security problem in robotic multi-agent systems, where agents are supposed to cooperate according to a shared protocol. A distributed Intrusion Detection System (IDS) is proposed here, that detects possible non-cooperative agents. Previous work by the authors showed how single monitors embedded on-board the agents can detect non- cooperative behavior, using only locally available information. In this paper, we allow such monitors to share the collected information in order to overcome their sensing limitation. In this perspective, we show how an agreement on the type of behavior of a target-robot may be reached by the monitors, through execution of a suitable consensus algorithm. After formulating a consensus problem over non-scalar quantities, and with a generic update function, we provide conditions for the consensus convergence and an upper bound to its transient duration. Effectiveness of the proposed solution is finally shown through simulation of a case study.

0 Bookmarks
 · 
151 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The paper presents a decentralized observer for a class of multi-agent systems. The proposed observer allows each robot of the team to estimate the overall system state provided that the communication network is connected and that the motion control law is Lipschitz. In case of perfect measurements the observer error is proved to be exponentially convergent to zero, while global uniform ultimately boundeness is proved for the case of bounded non-vanishing noise on the state measurements. The approach is validated via numerical simulations considering, as a case study, the decentralized control of the centroid and the formation of a team of robots.
    IEEE International Conference on Information and Automation; 08/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Trust and reputation are concepts that have been traditionally studied in domains such as electronic markets, e-commerce, game theory and bibliomet- rics, among others. More recently, researchers started to investigate the benefits of using these concepts in multi-robot domains: when one robot has to decide if it should cooperate with another one to accomplish a task, should the trust in the other be taken into account? This paper proposes the use of a trust model to define when one agent can take an action that depends on other agents of his team. To implement this idea, a Heuristic Multiagent Rein- forcement Learning algorithm is modified to take into account the trust in the other agents, before se- lecting an action that depends on them. Simulations were made in a robot soccer domain, which extends a very well known one proposed by Littman by ex- panding its size, the number of agents and by us- ing heterogeneous agents. Based on the results it is possible to show the performance of a team of agents can be improved even when using very sim- ple trust models.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose a distributed real-time fault detection, isolation and mitigation framework for multiagent systems performing cooperative tasks. Various system models and detection schemes with respect to communication and sensing are considered. Two communication protocols for fault detection are introduced first and proved to be effective. Then a scheme based on limited relative state measurements is developed. Furthermore, we propose fault isolation and mitigation steps to guarantee the accomplishment of a global objective. All schemes are distributed in the sense that at each step of the fault detection, isolation and mitigation every agent only uses locally available information. One key feature of the framework is the significant reduction of required computational resource when compared with the fault detection and isolation schemes based on unknown input observers. Later we show that the proposed framework can be applied to the consensus and other cooperative formation problems. Several computer simulations are presented to demonstrate the efficiency of the framework.
    American Control Conference (ACC), 2012; 06/2012

Full-text (2 Sources)

Download
154 Downloads
Available from
Jun 4, 2014