Doubly Stochastic Pairwise Interactions for Agreement and Alignment

12/26/2020
by   Thomas Dagès, et al.
0

Random pairwise encounters often occur in large populations, or groups of mobile agents, and various types of local interactions that happen at encounters account for emergent global phenomena. In particular, in the fields of swarm robotics, sociobiology, and social dynamics, several types of local pairwise interactions were proposed and analysed leading to spatial gathering or clustering and agreement in teams of robotic agents coordinated motion, in animal herds, or in human societies. We here propose a very simple stochastic interaction at encounters that leads to agreement or geometric alignment in swarms of simple agents, and analyse the process of converging to consensus. Consider a group of agents whose "states" evolve in time by pairwise interactions: the state of an agent is either a real value (a randomly initialised position within an interval) or a vector that is either unconstrained (e.g. the location of the agent in the plane) or constrained to have unit length (e.g. the direction of the agent's motion). The interactions are doubly stochastic, in the sense that, at discrete time steps, pairs of agents are randomly selected and their new states are independently and uniformly set at random in (local) domains or intervals defined by the states of the interacting pair. We show that such processes lead, in finite expected time (measured by the number of interactions that occurred) to agreement in case of unconstrained states and alignment when the states are unit vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2018

Almost logarithmic-time space optimal leader election in population protocols

The model of population protocols refers to a large collection of simple...
research
09/18/2017

MAX-consensus in open multi-agent systems with gossip interactions

We study the problem of distributed maximum computation in an open multi...
research
02/01/2019

Probabilistic Gathering Of Agents With Simple Sensors

We present a novel probabilistic gathering algorithms for agents that ca...
research
12/09/2020

A Discrete Model of Collective Marching on Rings

We study the collective motion of autonomous mobile agents on a ringlike...
research
09/15/2017

Open Multi-Agent Systems: Gossiping with Random Arrivals and Departures

We consider open multi-agent systems. Unlike the systems usually studied...
research
07/13/2023

A Local-Time Semantics for Negotiations

Negotiations, introduced by Esparza et al., are a model for concurrent s...
research
10/01/2020

Herding stochastic autonomous agents via local control rules and online global target selection strategies

In this Letter we propose a simple yet effective set of local control ru...

Please sign up or login with your details

Forgot password? Click here to reset