Petri net decomposition approach for bi-objective conflict-free routing for AGV systems

Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuhiko Matsumura

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

2 Citations (Scopus)

Abstract

In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multi-objective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest
Pages820-825
Number of pages6
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Anchorage, AK, United States
Duration: Oct 9 2011Oct 12 2011

Publication series

NameConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)1062-922X

Conference

Conference2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011
CountryUnited States
CityAnchorage, AK
Period10/9/1110/12/11

Keywords

  • AGV routing
  • conflict-free routing
  • decomposition
  • multi-objective optimization
  • Petri Net

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Petri net decomposition approach for bi-objective conflict-free routing for AGV systems'. Together they form a unique fingerprint.

Cite this