Zobrazeno 1 - 10
of 573
pro vyhledávání: '"Flocchini, P."'
In this paper we investigate the problem of searching for a black hole in a dynamic graph by a set of scattered agents (i.e., the agents start from arbitrary locations of the graph). The black hole is a node that silently destroys any agent visiting
Externí odkaz:
http://arxiv.org/abs/2404.15132
Research on distributed computing by a team of identical mobile computational entities, called robots, operating in a Euclidean space in $\mathit{Look}$-$\mathit{Compute}$-$\mathit{Move}$ ($\mathit{LCM}$) cycles, has recently focused on better unders
Externí odkaz:
http://arxiv.org/abs/2311.03328
A periodic temporal graph $\mathcal{G}=(G_0, G_1, \dots, G_{p-1})^*$ is an infinite periodic sequence of graphs $G_i=(V,E_i)$ where $G=(V,\cup_i E_i)$ is called the footprint. Recently, the arena where the Cops and Robber game is played has been exte
Externí odkaz:
http://arxiv.org/abs/2310.13616
Autor:
Buchin, Kevin, Flocchini, Paola, Kostitsyna, Irina, Peters, Tom, Santoro, Nicola, Wada, Koichi
We consider distributed systems of identical autonomous computational entities, called robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) cycles. The algorithmic capabilities of these systems have been extensively invest
Externí odkaz:
http://arxiv.org/abs/2203.06546
A mobile robot system consists of anonymous mobile robots, each of which autonomously performs sensing, computation, and movement according to a common algorithm, so that the robots collectively achieve a given task. There are two main models of time
Externí odkaz:
http://arxiv.org/abs/2006.03249
In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hole BH, a harmful site that destroys all incoming agents without leaving
Externí odkaz:
http://arxiv.org/abs/2005.07453
Autor:
Di Luna, Giuseppe Antonio, Flocchini, Paola, Santoro, Nicola, Viglietta, Giovanni, Yamauchi, Yukiko
We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-state machines that operate and move on an hexagonal tasselation of the pl
Externí odkaz:
http://arxiv.org/abs/2002.03384
Autor:
Das, Shantanu, Di Luna, Giuseppe A., Flocchini, Paola, Santoro, Nicola, Viglietta, Giovanni, Yamashita, Masafumi
We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous, oblivious, dis-oriented, and without any communication capabilities, o
Externí odkaz:
http://arxiv.org/abs/1911.05239
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward its destina
Externí odkaz:
http://arxiv.org/abs/1709.08800