single-rb.php

JRM Vol.9 No.5 pp. 380-386
doi: 10.20965/jrm.1997.p0380
(1997)

Paper:

Environment Recognition and Path Planning by Multiple Mobile Robots

Toshiyuki Kumaki*, Masahito Nakajima** and Masayoshi Kakikura*

*Tokyo Denki University, 2-2 Nishikicho, Kanda, Chiyoda-ku, Tokyo 101, Japan

**National Center for Science Information Systems, 3-29-1 Otuka, Bunkyo-ku, Tokyo 112, Japan

Received:
March 28, 1997
Accepted:
May 9, 1997
Published:
October 20, 1997
Keywords:
Path planning, Multiple coordination, Unknown environments
Abstract
This article, concerned with a part of the research on distributed coordination work by multiple robots, discusses an algorithm for creating maps of unknown environments which are searched for and observed by multiple mobile robots, and on the results of a simulation experiment using this algorithm. This algorithm comprises a moving method, an observation method, and a task planning method which are intended to help the multiple mobile robots carry out an efficient search of unknown environments.
Cite this article as:
T. Kumaki, M. Nakajima, and M. Kakikura, “Environment Recognition and Path Planning by Multiple Mobile Robots,” J. Robot. Mechatron., Vol.9 No.5, pp. 380-386, 1997.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Nov. 04, 2024