Zobrazeno 1 - 10
of 691
pro vyhledávání: '"SHIBATA, Masahiro"'
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
Consider that there are $k\le n$ agents in a simple, connected, and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. The goal of the dispersion problem is to move these $k$ agents to mutually distinct nodes. Agents can communicate only when t
Externí odkaz:
http://arxiv.org/abs/2310.04376
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic bidirectional ring networks. When k agents are distributed in the network, the partial gathering problem requires, for a given positive integer g (< k),
Externí odkaz:
http://arxiv.org/abs/2212.03457
Autor:
Kim, Yonghwan, Shibata, Masahiro, Sudo, Yuichi, Nakamura, Junya, Katayama, Yoshiaki, Masuzawa, Toshimitsu
An autonomous mobile robot system consisting of many mobile computational entities (called robots) attracts much attention of researchers, and to clarify the relation between the capabilities of robots and solvability of the problems is an emerging i
Externí odkaz:
http://arxiv.org/abs/2208.08159
Autor:
Shibata, Masahiro, Ohyabu, Masaki, Sudo, Yuichi, Nakamura, Junya, Kim, Yonghwan, Katayama, Yoshiaki
In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes (nodes where a
Externí odkaz:
http://arxiv.org/abs/2103.08172
Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We focus on ce
Externí odkaz:
http://arxiv.org/abs/2102.05592
Publikováno v:
Journal of Information Processing, Vol. 29 (Feb. 2021), 115-123
With the prevalence of cloud computing and contents delivery networking, OpenFlow-based centrally-managed networks with flexible and dynamic traffic engineering are demanded. To maintain a high quality of service of the network, detecting and locatin
Externí odkaz:
http://arxiv.org/abs/2010.04494
Publikováno v:
Proceedings of the 39th International Symposium on Reliable Distributed Systems (SRDS), 2020, 1-10
We propose a self-stabilizing algorithm to construct a minimal weakly $\mathcal{ST}$-reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networks. Given an arbitrary, simple, connected, and undirected graph $G=(V,
Externí odkaz:
http://arxiv.org/abs/2009.03585
In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allows us to design a self-stabilizing protocol for such problems. In this pape
Externí odkaz:
http://arxiv.org/abs/2003.07491
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.