Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Ooshita, Fukuhito"'
Autor:
Bramas, Quentin, Kakugawa, Hirotsugu, Kamei, Sayaka, Lamani, Anissa, Ooshita, Fukuhito, Shibata, Masahiro, Tixeuil, Sébastien
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights on line-shaped networks. In this problem, a group of mobile robots mus
Externí odkaz:
http://arxiv.org/abs/2312.12698
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected times until
Externí odkaz:
http://arxiv.org/abs/2305.11590
We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given a rough knowledge $\psi = \lceil \log n \rceil + O(1)$ on the population size $n$, the proposed protocol lets the population reach
Externí odkaz:
http://arxiv.org/abs/2305.08375
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist $k$ agents with unique identifiers (IDs) in the network, and $f$ of them are weakly Byzantine agents, which behave a
Externí odkaz:
http://arxiv.org/abs/2205.14937
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication gra
Externí odkaz:
http://arxiv.org/abs/2111.05111
We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and luminous robots mean that they have light devices that can emit colors. Fi
Externí odkaz:
http://arxiv.org/abs/2102.06006
We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them to see the positions of the other robots. Most of the investigations o
Externí odkaz:
http://arxiv.org/abs/2101.05421
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of \emph{arbitrary} communicati
Externí odkaz:
http://arxiv.org/abs/2011.08366
In this paper, we present two self-stabilizing algorithms that enable a single (mobile) agent to explore graphs. The agent visits all nodes starting from any configuration, \ie regardless of the initial state of the agent, the initial states of all n
Externí odkaz:
http://arxiv.org/abs/2010.08929
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of $k$ agents with unique identifiers (IDs), and $f$ of them are weakly Byzantine agents, which behave arbitrarily ex
Externí odkaz:
http://arxiv.org/abs/2007.08217