Gathering in 1-Interval Connected Graphs

08/17/2020
by   Othon Michail, et al.
0

We examine the problem of gathering k ≥ 2 agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected (1-interval connectivity) [KLO10]. The agents are identical and without explicit communication capabilities, and are initially positioned at different nodes of the graph. The problem is for the agents to gather at the same node, not fixed in advance. We first show that the problem becomes impossible to solve if the graph has a cycle. In light of this, we study a relaxed version of this problem, called weak gathering. We show that only in unicyclic graphs weak gathering is solvable, and we provide a deterministic algorithm for this problem that runs in polynomial number of rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2017

Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities

We consider the task of rendezvous in networks modeled as undirected gra...
research
03/11/2019

Reachability and Coverage Planning for Connected Agents: Extended Version

Motivated by the increasing appeal of robots in information-gathering mi...
research
06/23/2020

The Bike Sharing Problem

Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent tr...
research
02/28/2022

Guarding Polygons with Holes

We study the Cooperative Guarding problem for polygons with holes in a m...
research
05/12/2020

Guarding a Polygon Without Losing Touch

We study the classical Art Gallery Problem first proposed by Klee in 197...
research
11/01/2022

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs

We investigated the computational power of a single mobile agent in an n...
research
07/06/2021

Exploring a Dynamic Ring without Landmark

Consider a group of autonomous mobile computational entities, called age...

Please sign up or login with your details

Forgot password? Click here to reset