Distributed Consensus on Boolean Information

Baccio

IFAC Proceedings Volumes

et al. 2011

Self Cite

Logical consensus is an approach to distributed decision making which is based on the availability of a network of agents with incomplete system knowledge. The method requires the construction of a Boolean map which defines a dynamic system allowing the entire network to consent on a unique, global decision. Previous work by the authors proved the method to be viable for applications such as intrusion detection within a structured environment, when the agent's communication topology is known in advance. The current work aims at providing a fully distributed protocol, requiring no a priori knowledge of each agent's communication neighbors. The protocol allows the construction of a robust Boolean map that is able to tolerate incorrect information spread by some agents, due to spontaneous failure or malicious intents. Effectiveness of the proposed method is shown through an implementation on a low-cost platform

Section: Distributed Synthesis Of a Robust Consensus Map: The Self-routing Robustmentioning

confidence: 97%

Robust Network Agreement on Logical Information

Baccio

IFAC Proceedings Volumes

et al. 2011

Self Cite

“…This is achieved by extending the notions of convergence, local convergence, and contraction, already given in the binary domain [14], [15], to algebras of sets, taken with the union, intersection, and complement operations. The work presented here builds upon earlier results by the authors [16], where global convergence of Set-Valued Boolean Dynamic Systems (SVBDS) 2 was studied, and it provides also results on local convergence in terms of properties of binary matrices for which analysis [14], [15] and synthesis [8] results are available. These new results are mainly, but not only, contained in the following theorems: Theorem 4.1 of Section IV, Lemma 5.1, Theorem 5.2, Theorem 5.2, and Theorem 5.4 of Section V. By doing this, we believe that the present work is a step toward the definition of a unified framework for the convergence analysis of systems involving iterative maps based on Boolean algebras, and for the design of Boolean iterative systems producing consensus in such domains.…”

Section: X(t + 1) = Ax(t) + Bu(t)mentioning

confidence: 98%

“…The following Proposition 3.1-3.5 are based on results that were first presented in the conference paper [16].…”

Section: Set-valued Boolean Dynamic Systems-global Convergencementioning

confidence: 99%

Convergence Analysis of Distributed Set-Valued Information Systems

Dubbini

IEEE Trans. Automat. Contr.

et al. 2016

Self Cite

Abstract-This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not represented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the network is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distributed geographic information system, leading to successful information reconstruction from partial and corrupted data, is used to illustrate the applications of the proposed methods.Index Terms-Binary encoding, boolean dynamic systems, consensus algorithms, convergence, cooperative systems, distributed information systems, set-valued dynamic maps.

“…Therein, the objective is attained through use of a set-valued consensus algorithm, where local agents exchange data representing free and occupied regions of the environment. Whereas these problems have been separately addressed in different manners, we proposed in [11] the notion of Boolean consensus systems as a unifying framework for achieving consensus on Boolean information (not only including binary data). In fact, what really prevents, in our opinion, a wide exploitation of the multi-agent paradigm is the lack of a systematic approach to the design of a generic consensus algorithm that is applicable in a vast number of scenarios.…”

Section: Introductionmentioning

confidence: 99%

A self-routing protocol for distributed consensus on logical information

2010 IEEE/RSJ International Conference on Intelligent Robots and Systems

Baccio

et al. 2010

In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction of a logical linear consensus system that is globally stable in a fully distributed way. The effectiveness of the proposed method is showed through the real implementation of a wireless sensor network as a framework for the surveillance of an urban area.