Planning Cooperative Motion for Distributed Mobile  Agents

Kikuo Fujimura; Karansher Singh

doi:10.20965/jrm.1996.p0075

single-rb.php

« previous

JRM Vol.8 No.1 pp. 75-80

doi: 10.20965/jrm.1996.p0075

(1996)

Paper:

Views over last 60 days: 286

Planning Cooperative Motion for Distributed Mobile Agents

Kikuo Fujimura and Karansher Singh

Department of Computer and Information Science, Ohio State University, 2015 Neil Avenue, Columbus, OH 43210 USA

Received:

January 16, 1996

Accepted:

January 25, 1996

Published:

February 20, 1996

Keywords:

Mobile robots, Distributed problem solving, Terrain acquisition.

Abstract

The problem of planning the motion is investigated for distributed multiple mobile agents. A method is proposed for a few heterogeneous mobile agents (robots) of different sizes and moving capabilities to coordinate their motions in a distributed manner in order to achieve a map-making task. The agents are assumed to have sufficient memory for storing the map and to be able to communicate with each other. Our approach makes use of an occupancy grid and a map is to be completed to a specified resolution. The algorithm is described, and computer simulation of the algorithm is reported.

Cite this article as:

K. Fujimura and K. Singh, “Planning Cooperative Motion for Distributed Mobile Agents,” J. Robot. Mechatron., Vol.8, No.1, pp. 75-80, 1996.

Data files:

This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.