Autonomous decentralized route planning method and its application to a dynamic route planning

Masakazu Ando, Tatsushi Nishi, Masami Konishi, Jun Imai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

For most of the transportation system in semiconductor fabricating bay, the requests for transportation are given in every few seconds. It is necessary to determine the allocation of the transportation requests to AGVs and the route planning of AGVs without collision and deadlock in a dynamic environment. In this paper, we propose an autonomous decentralized route planning method for dynamic route planning. In the proposed system, each AGV individually derives the route for itself by repeating the generation of the route for each AGV and the wireless communication with other AGVs. Each AGV has a function of optimizing the route for itself. However, it is desirable that a rescheduling is executed locally as much as possible. From that viewpoint, we propose a rescheduling algorithm for dynamic environment. From the numerical experiments, it has been demonstrated that the proposed method can reduce 80 percent of the computation time compared with the conventional autonomous decentralized method without lowering the performance level. Moreover, the proposed method has been implemented on a parallel experimental system and it has been demonstrated that each robot can successively travel without deadlock and collision among AGVs.

Original languageEnglish
Title of host publicationProceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages718-723
Number of pages6
Volume2
ISBN (Print)0780378660
DOIs
Publication statusPublished - 2003
Event2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2003 - Kobe, Japan
Duration: Jul 16 2003Jul 20 2003

Other

Other2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2003
CountryJapan
CityKobe
Period7/16/037/20/03

Fingerprint

Route Planning
Decentralized
Rescheduling
Planning
Deadlock
Dynamic Environment
Collision
Wireless Communication
Robots
Semiconductor materials
Percent
Semiconductors
Robot
Communication
Numerical Experiment
Necessary
Experiments

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Ando, M., Nishi, T., Konishi, M., & Imai, J. (2003). Autonomous decentralized route planning method and its application to a dynamic route planning. In Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA (Vol. 2, pp. 718-723). [1222269] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CIRA.2003.1222269

Autonomous decentralized route planning method and its application to a dynamic route planning. / Ando, Masakazu; Nishi, Tatsushi; Konishi, Masami; Imai, Jun.

Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2 Institute of Electrical and Electronics Engineers Inc., 2003. p. 718-723 1222269.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ando, M, Nishi, T, Konishi, M & Imai, J 2003, Autonomous decentralized route planning method and its application to a dynamic route planning. in Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. vol. 2, 1222269, Institute of Electrical and Electronics Engineers Inc., pp. 718-723, 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2003, Kobe, Japan, 7/16/03. https://doi.org/10.1109/CIRA.2003.1222269
Ando M, Nishi T, Konishi M, Imai J. Autonomous decentralized route planning method and its application to a dynamic route planning. In Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2. Institute of Electrical and Electronics Engineers Inc. 2003. p. 718-723. 1222269 https://doi.org/10.1109/CIRA.2003.1222269
Ando, Masakazu ; Nishi, Tatsushi ; Konishi, Masami ; Imai, Jun. / Autonomous decentralized route planning method and its application to a dynamic route planning. Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA. Vol. 2 Institute of Electrical and Electronics Engineers Inc., 2003. pp. 718-723
@inproceedings{55f8c0f6e01445139c140bb8908afd27,
title = "Autonomous decentralized route planning method and its application to a dynamic route planning",
abstract = "For most of the transportation system in semiconductor fabricating bay, the requests for transportation are given in every few seconds. It is necessary to determine the allocation of the transportation requests to AGVs and the route planning of AGVs without collision and deadlock in a dynamic environment. In this paper, we propose an autonomous decentralized route planning method for dynamic route planning. In the proposed system, each AGV individually derives the route for itself by repeating the generation of the route for each AGV and the wireless communication with other AGVs. Each AGV has a function of optimizing the route for itself. However, it is desirable that a rescheduling is executed locally as much as possible. From that viewpoint, we propose a rescheduling algorithm for dynamic environment. From the numerical experiments, it has been demonstrated that the proposed method can reduce 80 percent of the computation time compared with the conventional autonomous decentralized method without lowering the performance level. Moreover, the proposed method has been implemented on a parallel experimental system and it has been demonstrated that each robot can successively travel without deadlock and collision among AGVs.",
author = "Masakazu Ando and Tatsushi Nishi and Masami Konishi and Jun Imai",
year = "2003",
doi = "10.1109/CIRA.2003.1222269",
language = "English",
isbn = "0780378660",
volume = "2",
pages = "718--723",
booktitle = "Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Autonomous decentralized route planning method and its application to a dynamic route planning

AU - Ando, Masakazu

AU - Nishi, Tatsushi

AU - Konishi, Masami

AU - Imai, Jun

PY - 2003

Y1 - 2003

N2 - For most of the transportation system in semiconductor fabricating bay, the requests for transportation are given in every few seconds. It is necessary to determine the allocation of the transportation requests to AGVs and the route planning of AGVs without collision and deadlock in a dynamic environment. In this paper, we propose an autonomous decentralized route planning method for dynamic route planning. In the proposed system, each AGV individually derives the route for itself by repeating the generation of the route for each AGV and the wireless communication with other AGVs. Each AGV has a function of optimizing the route for itself. However, it is desirable that a rescheduling is executed locally as much as possible. From that viewpoint, we propose a rescheduling algorithm for dynamic environment. From the numerical experiments, it has been demonstrated that the proposed method can reduce 80 percent of the computation time compared with the conventional autonomous decentralized method without lowering the performance level. Moreover, the proposed method has been implemented on a parallel experimental system and it has been demonstrated that each robot can successively travel without deadlock and collision among AGVs.

AB - For most of the transportation system in semiconductor fabricating bay, the requests for transportation are given in every few seconds. It is necessary to determine the allocation of the transportation requests to AGVs and the route planning of AGVs without collision and deadlock in a dynamic environment. In this paper, we propose an autonomous decentralized route planning method for dynamic route planning. In the proposed system, each AGV individually derives the route for itself by repeating the generation of the route for each AGV and the wireless communication with other AGVs. Each AGV has a function of optimizing the route for itself. However, it is desirable that a rescheduling is executed locally as much as possible. From that viewpoint, we propose a rescheduling algorithm for dynamic environment. From the numerical experiments, it has been demonstrated that the proposed method can reduce 80 percent of the computation time compared with the conventional autonomous decentralized method without lowering the performance level. Moreover, the proposed method has been implemented on a parallel experimental system and it has been demonstrated that each robot can successively travel without deadlock and collision among AGVs.

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

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

U2 - 10.1109/CIRA.2003.1222269

DO - 10.1109/CIRA.2003.1222269

M3 - Conference contribution

AN - SCOPUS:84942597073

SN - 0780378660

VL - 2

SP - 718

EP - 723

BT - Proceedings of IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA

PB - Institute of Electrical and Electronics Engineers Inc.

ER -