11 citations · 16 across the 8 of their papers we have counts for
11 papers
The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions
Yonghwan Kim, Yuichi Sudo
Given a graph , let () be a set of vertices. Two vertices are \emph{mutually visible} if there exists a shortest path in between them that does not co…
Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
Consider that there are agents in a simple, connected, and undirected graph with nodes and edges. The goal of the dispersion problem is to move these …
Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
An autonomous mobile robot system is a distributed system consisting of mobile computational entities (called robots) that autonomously and repeatedly perform three operations: Loo…
Partial gathering of mobile agents in dynamic rings
Masahiro Shibata, Yuichi Sudo, Junya Nakamura +1
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 part…
Gathering Despite Defected View
Yonghwan Kim, Masahiro Shibata, Yuichi Sudo +3
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 c…
Reeb flows without simple global surfaces of section
Juno Kim, Yonghwan Kim, Otto van Koert
We construct, for any given positive integer , Reeb flows on contact integral homology 3-spheres which do not admit global surfaces of section with fewer than boundary compo…
A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations
Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama +1
A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault to…
Gathering of seven autonomous mobile robots on triangular grids
Masahiro Shibata, Masaki Ohyabu, Yuichi Sudo +3
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 con…
Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
Programmable matter (PM) is a form of matter capable of dynamically altering its physical properties, such as shape or density, through programmable means. From a robotics perspect…
Self-Stabilizing Construction of a Minimal Weakly -Reachable Directed Acyclic Graph
Junya Nakamura, Masahiro Shibata, Yuichi Sudo +1
We propose a self-stabilizing algorithm to construct a minimal weakly -reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networ…
The Power of Global Knowledge on Self-stabilizing Population Protocols
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
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…