Petri Net decomposition for deadlock avoidance routing for bi-directional AGV systems

Tatsushi Nishi, Yuki Tanaka, Yukinori Isoya

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

3 Citations (Scopus)

Abstract

In this paper, we propose a Petri Net decomposition approach for dynamic dispatching and routing for bi-directional AGV systems. For dynamic dispatching and routing, the static problem to determine an optimal firing sequence problem for Petri Net is solved repeatedly. A Petri Net decomposition approach is applied to solve the optimal firing sequence problem efficiently. In the decomposition algorithm, the entire Petri Net is decomposed into task subnets and AGV subnets. The penalty function algorithm is used to coordinate the solution of each subnet. A deadlock avoidance policy for bi-directional lane is used to ensure the generation of conOict-free routing. Computational results show the effectiveness of the proposed Petri Net decomposition approach with deadlock avoidance policy for dynamic situations.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010
Pages2453-2458
Number of pages6
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 - Istanbul, Turkey
Duration: Oct 10 2010Oct 13 2010

Publication series

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

Conference

Conference2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010
CountryTurkey
CityIstanbul
Period10/10/1010/13/10

Keywords

  • AGV routing
  • Deadlock avoidance
  • Decomposition
  • Optimization
  • Petri nets

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 for deadlock avoidance routing for bi-directional AGV systems'. Together they form a unique fingerprint.

  • Cite this

    Nishi, T., Tanaka, Y., & Isoya, Y. (2010). Petri Net decomposition for deadlock avoidance routing for bi-directional AGV systems. In 2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 (pp. 2453-2458). [5641942] (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). https://doi.org/10.1109/ICSMC.2010.5641942