In this work we propose a distributed algorithm to solve the discrete-time average consensus
problem on strongly connected weighted digraphs (SCWDs). The key idea is to couple the …

Train-movement situation recognition is used in safety analyses to discern whether trains
are running according to preset mechanisms. When a train deviates from the preset …

In this work we propose a decentralized algorithm for balancing a strongly connected
weighted digraph. This algorithm relies on the decentralized estimation of the left …

Abstract The Theory of Belief Functions is a formal framework for reasoning with uncertainty
that is well suited for representing unreliable information and weak states of knowledge. In …

We study the problem of feature-based map merging in robot networks. Along its operation,
each robot observes the environment and builds and maintains a local map …

We present a formal model of multiagent systems to analyze the relations of power and
dependence underlying group behaviors such as cooperation. Inspired by the work of …

Motivated by the strong influence network rigidity has on collaborative systems, in this paper,
we consider the problem of partitioning a multiagent network into two sub-teams, a …

The Theory of Belief Functions is a formal framework for reasoning with uncertainty that is
well suited for representing unreliable information and weak states of knowledge. In a …

Data fusion provides a means for combining pieces of information from various sources and
sensors. This chapter presents a data fusion methodology for interdependent critical …

This paper describes a distributed approach for data fusion and information sharing based
on evidence theory and the transferable belief model. Evidence theory aggregates data …