#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1981

2017

- This year (5)
- Last 5 years (52)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1999

Consider a system of multiple mobile robots in which each robot, at infinitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances.… (More)

- Hideki Ando, Yoshinobu Oasa, Ichiro Suzuki, Masafumi Yamashita
- IEEE Trans. Robotics and Automation
- 1999

We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirectional mobile processor that repeatedly: 1) observes the relative positions of those robots that are visible; 2) computes its new position based on the observation using the given algorithm; 3) moves to that… (More)

- Masafumi Yamashita, Tsunehiko Kameda
- IEEE Trans. Parallel Distrib. Syst.
- 1996

In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be… (More)

- Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1992

- Masafumi Yamashita, Tsunehiko Kameda
- IEEE Trans. Parallel Distrib. Syst.
- 1999

We discuss fundamental formation and agreement problems for autonomous, synchronous robots with limited visibility. Each robots is a mobile processor that, at each discrete time instant, observes the relative positions of those robots that are within distance V of itself, computes its new position using the given algorithm, and then moves to that position.… (More)

- Masafumi Yamashita, Tiko Kameda
- PODC
- 1988

A network consists of a set of processors and a set of communication links connecting pairs of processors. ln the past, dozens of papers have been written on the subject of efficient distributed algorithms for various problems about networks, including leader election, spanning tree construction, and topology recognition (i.e., the determination of network… (More)

- Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita
- SIAM J. Comput.
- 1990

The problem of searching for a mobile robber in a simple polygon by a number of searchlights is considered. A searchlight is a stationary point which emits a single ray that cannot penetrate the boundary of the polygon. The direction of the ray can be changed continuously, and a point is detected by a searchlight at a given time if and only if it is on the… (More)

- Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita
- Theor. Comput. Sci.
- 2009

Consider a system of multiple mobile robots in which each robot, at innnitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances. The… (More)