Route planning method of multiple mobile robots for transportation task based on collision prospect

Makiko Yahagi, Kazuo Nakazawa

Research output: Contribution to journalArticle

Abstract

Multiple robot system with decentralized control attracts attention and is expected to play an important role in transportation systems in factories and warehouses. In transportation systems, it is necessary to plan a route that minimizes the transportation time with less collision and deadlock. The goal of this study is to calculate appropriate routes with reducing communication load and computational load. In this paper, we proposed to combine prior route planning and local avoidance. In order to reduce computational load, each robot predict probability of collision with other robots by comparing present and destination position. A route with less collision is calculated by reflecting the overlap of route which has probability of collision into dijkstra method. The proposed method is evaluated through the computer simulation and the experiment using real robots.

Original languageEnglish
Pages (from-to)3307-3313
Number of pages7
JournalNihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume75
Issue number760
Publication statusPublished - 2009 Dec

Fingerprint

Mobile robots
Robots
Planning
Decentralized control
Warehouses
Industrial plants
Communication
Computer simulation
Experiments

Keywords

  • Distributed coordination
  • Multi-agent
  • Planning

ASJC Scopus subject areas

  • Mechanical Engineering
  • Mechanics of Materials
  • Industrial and Manufacturing Engineering

Cite this

@article{73a238ed8e8e4f9aa13bdfb7235e6844,
title = "Route planning method of multiple mobile robots for transportation task based on collision prospect",
abstract = "Multiple robot system with decentralized control attracts attention and is expected to play an important role in transportation systems in factories and warehouses. In transportation systems, it is necessary to plan a route that minimizes the transportation time with less collision and deadlock. The goal of this study is to calculate appropriate routes with reducing communication load and computational load. In this paper, we proposed to combine prior route planning and local avoidance. In order to reduce computational load, each robot predict probability of collision with other robots by comparing present and destination position. A route with less collision is calculated by reflecting the overlap of route which has probability of collision into dijkstra method. The proposed method is evaluated through the computer simulation and the experiment using real robots.",
keywords = "Distributed coordination, Multi-agent, Planning",
author = "Makiko Yahagi and Kazuo Nakazawa",
year = "2009",
month = "12",
language = "English",
volume = "75",
pages = "3307--3313",
journal = "Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C",
issn = "0387-5024",
publisher = "Japan Society of Mechanical Engineers",
number = "760",

}

TY - JOUR

T1 - Route planning method of multiple mobile robots for transportation task based on collision prospect

AU - Yahagi, Makiko

AU - Nakazawa, Kazuo

PY - 2009/12

Y1 - 2009/12

N2 - Multiple robot system with decentralized control attracts attention and is expected to play an important role in transportation systems in factories and warehouses. In transportation systems, it is necessary to plan a route that minimizes the transportation time with less collision and deadlock. The goal of this study is to calculate appropriate routes with reducing communication load and computational load. In this paper, we proposed to combine prior route planning and local avoidance. In order to reduce computational load, each robot predict probability of collision with other robots by comparing present and destination position. A route with less collision is calculated by reflecting the overlap of route which has probability of collision into dijkstra method. The proposed method is evaluated through the computer simulation and the experiment using real robots.

AB - Multiple robot system with decentralized control attracts attention and is expected to play an important role in transportation systems in factories and warehouses. In transportation systems, it is necessary to plan a route that minimizes the transportation time with less collision and deadlock. The goal of this study is to calculate appropriate routes with reducing communication load and computational load. In this paper, we proposed to combine prior route planning and local avoidance. In order to reduce computational load, each robot predict probability of collision with other robots by comparing present and destination position. A route with less collision is calculated by reflecting the overlap of route which has probability of collision into dijkstra method. The proposed method is evaluated through the computer simulation and the experiment using real robots.

KW - Distributed coordination

KW - Multi-agent

KW - Planning

UR - http://www.scopus.com/inward/record.url?scp=77949484171&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949484171&partnerID=8YFLogxK

M3 - Article

VL - 75

SP - 3307

EP - 3313

JO - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

JF - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

SN - 0387-5024

IS - 760

ER -