Petri net decomposition approach for dispatching and conflict-free routing of bidirectional automated guided vehicle systems

Tatsushi Nishi, Yuki Tanaka

Research output: Contribution to journalArticlepeer-review

61 Citations (Scopus)

Abstract

In this paper, we address a Petri net decomposition approach for simultaneous dispatching and conflict-free routing for bidirectional automated guided vehicle (AGV) systems in dynamic environments. To solve the dynamic problem, static problems for finding near-optimal dispatching and conflict-free routing are solved each time when transportation requests are given. The static problem is converted to an optimal firing sequence problem for a timed Petri net. A Petri net decomposition approach is applied to solve the problem efficiently. In the algorithm, the entire Petri net is decomposed into task and AGV subnets. The penalty function method is used to derive a solution for all subnets. A deadlock avoidance method is embedded in the proposed methodology to ensure the feasibility and the quality of the solution. Computational results show that the proposed method with a deadlock avoidance algorithm efficiently maximizes the throughput for dynamic situations.

Original languageEnglish
Article number6156466
Pages (from-to)1230-1243
Number of pages14
JournalIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Volume42
Issue number5
DOIs
Publication statusPublished - 2012
Externally publishedYes

Keywords

  • Automated guided vehicles (AGVs)
  • conflict-free routing
  • deadlock avoidance
  • decomposition
  • optimization
  • Petri nets

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Petri net decomposition approach for dispatching and conflict-free routing of bidirectional automated guided vehicle systems'. Together they form a unique fingerprint.

Cite this