Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
An Optimization Method for Routing Problems for Multiple AGVs by Decomposition of Petri Nets
Ryota MAENOTatsushi NISHIMasami KONISHI
Author information
JOURNALS FREE ACCESS

2006 Volume 19 Issue 11 Pages 426-434

Details
Abstract

In this paper, we propose a decomposition and coordination method for routing problems for multiple automated guided vehicles (AGVs) using Petri Nets. An extended Petri Net model is created to represent concurrent motion of multiple AGVs. The routing problem to minimize total transportatin time is formulated by the proposed Petri Net. The optimization model for the Petri Net is decomposed into several subproblems which can be solved by Dijkstra's algorithm in polynomial order. The effectiveness of the proposed method is evaluated by several numerical examples.

Information related to the author
© The Institute of Systems, Control and Information Engineers
Previous article Next article
feedback
Top