Related papers: Detecting Separation in Robotic and Sensor Network…

This paper addresses distributed average tracking for a group of physical double-integrator agents under an undirected graph with reduced requirement on velocity measurements. The idea is that multiple agents track the average of multiple…

In this paper, we consider a multi-agent resilient consensus problem, where some of the nodes may behave maliciously. The approach is to equip all nodes with a scheme to detect neighboring nodes when they behave in an abnormal fashion. To…

In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily…

This paper studies the problem of determining the sensor locations in a large sensor network using relative distance (range) measurements only. Our work follows from a seminal paper by Khan et al. [1] where a distributed algorithm, known as…

This paper deals with distributed algorithms for monitoring the topology of a dynamic group of mobile wireless sensor networks. We propose two major extensions of a distributed static group consensus algorithm and an experimental…

Single fault sequential change point problems have become important in modeling for various phenomena in large distributed systems, such as sensor networks. But such systems in many situations present multiple interacting faults. For…

Stabilizing large networks of nonlinear agents is challenging; decomposition and distributed analysis of these networks are crucial for computational tractability and information security. Vidyasagar's Network Dissipativity Theorem enables…

Heterogeneity characterises real-world networks, where nodes show a broad range of different topological features. However, nodes also tend to organise into communities -- subsets of nodes that are sparsely inter-connected but are densely…

A novel strategy aimed at cooperatively differentiating a signal among multiple interacting agents is introduced, where none of the agents needs to know which agent is the leader, i.e. the one producing the signal to be differentiated.…

This thesis is concerned with distributed control and coordination of networks consisting of multiple, potentially mobile, agents. This is motivated mainly by the emergence of large scale networks characterized by the lack of centralized…

This paper studies distributed resource allocation problem in multi-agent systems, where all the agents cooperatively minimize the sum of their cost functions with global resource constraints over stochastic communication networks. This…

We propose a distributed Bayesian quickest change detection algorithm for sensor networks, based on a random gossip inter-sensor communication structure. Without a control or fusion center, each sensor executes its local change detection…

We present a new framework for the crucial challenge of self-organization of a large sensor network. The basic scenario can be described as follows: Given a large swarm of immobile sensor nodes that have been scattered in a polygonal…

Network dismantling is a relevant research area in network science, gathering attention both from a theoretical and an operational point of view. Here, we propose a general framework for dismantling that prioritizes the removal of nodes…

The problem of distributed identification of linear stochastic system with unknown coefficients over time-varying networks is considered. For estimating the unknown coefficients, each agent in the network can only access the input and the…

Identifying disturbances in network-coupled dynamical systems without knowledge of the disturbances or underlying dynamics is a problem with a wide range of applications. For example, one might want to know which nodes in the network are…

This paper investigates the issue of cooperative activity detection for grant-free random access in the sixth-generation (6G) cell-free wireless networks with sourced and unsourced paradigms. First, we propose a cooperative framework for…

A distributed adaptive algorithm to estimate a time-varying signal, measured by a wireless sensor network, is designed and analyzed. One of the major features of the algorithm is that no central coordination among the nodes needs to be…

We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. We propose a…

We consider a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication range. After having been distributed randomly in a given…