Related papers: Time-optimal Loosely-stabilizing Leader Election i…
From a mathematical point of view self-organization can be described as patterns to which certain dynamical systems modeling social dynamics tend spontaneously to be attracted. In this paper we explore situations beyond self-organization,…
We study the time needed for deterministic leader election in the ${\cal LOCAL}$ model, where in every round a node can exchange any messages with its neighbors and perform any local computations. The topology of the network is unknown and…
This paper studies the problem of selecting a minimum-size set of input nodes to guarantee stability of a networked system in the presence of uncertainties and time delays. Current approaches to input selection in networked dynamical…
We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of…
We consider the time and energy complexities of randomized leader election in a multiple-access channel, where the number of devices $n\geq 2$ is unknown. It is well-known that for polynomial-time randomized leader election algorithms with…
We present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithm consists in two stages of stabilizing…
We study the fixation time of the identity of the leader, i.e., the most massive component, in the general setting of Aldous's multiplicative coalescent [4, 5], which in an asymptotic sense describes the evolution of the component sizes of…
The problem of total-order (uniform reliable) broadcast is fundamental in fault-tolerant distributed computing since it abstracts a broad set of problems requiring processes to uniformly deliver messages in the same order in which they were…
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the…
We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the $n$ nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e., the initial…
In population protocols, the underlying distributed network consists of $n$ nodes (or agents), denoted by $V$, and a scheduler that continuously selects uniformly random pairs of nodes to interact. When two nodes interact, their states are…
This paper considers a localized data-driven consensus problem for leader-follower multi-agent systems with unknown discrete-time agent dynamics, where each follower computes its local control gain using only their locally collected state…
Understanding how information can efficiently spread in distributed systems under noisy communications is a fundamental question in both biological research and artificial system design. When agents are able to control whom they interact…
For nearly two decades, population protocols have been extensively studied, yielding efficient solutions for central problems in distributed computing, including leader election, and majority computation, a predicate type in Presburger…
We formalize synthesis of shared control protocols with correctness guarantees for temporal logic specifications. More specifically, we introduce a modeling formalism in which both a human and an autonomy protocol can issue commands to a…
We fully characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of $n$ finite state agents in which a malicious scheduler selects an…
In this paper, a set-membership filtering-based leader-follower synchronization protocol for discrete-time linear multi-agent systems is proposed wherein the aim is to make the agents synchronize with a leader. The agents, governed by…
In this paper we present a framework for leader election in multi-hop radio networks which yield randomized leader election algorithms taking $O(\text{broadcasting time})$ in expectation, and another which yields algorithms taking fixed…
This paper studies the problem of stabilizing a self-triggered control system with quantized output. Employing a standard observer-based state feedback control law, a self-triggering mechanism that dictates the next sampling time based on…
By introducing a predictive mechanism with small-world connections, we propose a new motion protocol for self-driven flocks. The small-world connections are implemented by randomly adding long-range interactions from the leader to a few…