Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays

Nishi, Tatsushi; Maeno, Ryota

doi:10.1109/coase.2006.326886

Cited by 4 publications

(3 citation statements)

References 4 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A decomposition method was used in [24] (this paper authors have several published papers using Petri nets decom position methods allowing analysis simplification) to simplify the analysis of augmented Petri nets (Petri nets extended with a type of place called state restriction place). In this paper, a decomposition method was used for automated guided vehicles (AVG) routing optimization.…”

Section: A Supporting Behavioral Analysismentioning

confidence: 99%

Extending a net splitting operation for decomposition of high-level Petri nets

Moutinho

Gomes

2012

IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society

View full text Add to dashboard Cite

This paper presents an extension to a net split ting operation for decomposition of high -level Petri nets, to support distributed implementations of embedded systems. The net splitting operation, selected from the survey of methods summarized in this paper, was originally proposed for low-level Petri nets. The advantages of the selected method are its higher flexibility on the cutting set definition, and the generation of sub-models in interaction with adequate support to implement its communication channels. High -level Petri net classes are extended to support the application of the new net operation, and additional tasks to be performed are identified. Finally, an example is used to illustrate the application of the net operation to a high-level Petri net model.

show abstract

Section: A Supporting Behavioral Analysismentioning

confidence: 99%

Extending a net splitting operation for decomposition of high-level Petri nets

Moutinho

Gomes

2012

IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society

View full text Add to dashboard Cite

show abstract

“…The solution of each subnet is coordinated by the algorithmic procedure. The Petri Net decomposition approach is successfully applied to solve AGVs route planning problems [7], production scheduling problems [8].…”

Section: Introductionmentioning

confidence: 99%

Petri Net decomposition approach for the simultaneous optimization of task assignment and routing with automated guided vehicles

Nishi

Tanaka

Inuiguchi

2008

2008 IEEE International Conference on Automation Science and Engineering

View full text Add to dashboard Cite

In this paper, we propose a simultaneous optimization method for task assignment and routing problems for multiple AGVs by decomposition of Petri Nets. In the proposed method, the Petri Net is decomposed into several subnets for task subproblems and AGV subproblems. Each subproblem is solved by Dijkstra's algorithm. The solution of subproblem for each subnet is repeated until a feasible solution for the original problem is obtained. In this study, a new solution method for subproblems with no final marking is developed. The effectiveness of the proposed method is confirmed by comparing the performance with conventional methods.

show abstract

“…Therefore, DBA algorithm is eliminated in the proposed method for the bi-directional lane. A nearest neighbor (NN) dispatching and the distributed routing method (8) is used as a conventional method. For NN dispatching, each task is assigned to minimize the estimate value of total task completion time without interference between AGVs.…”

Section: Bi-directional Transport Systemmentioning

confidence: 99%

Dynamic Optimization of Simultaneous Dispatching and Conflict-free Routing for Automated Guided Vehicles - Petri Net Decomposition Approach -

Tanaka

Nishi

Inuiguchi

2010

JAMDSM

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an application of Petri Net decomposition approach for the simultaneous optimization of dispatching and conflict-free routing for automated guided vehicles in the dynamic situation where transport requests are given in real time. The objective is to maximize the total throughput of the AGV transport system during the time horizon. In order to solve the dynamic problem, static problems are periodically solved when the transport requests are given to the AGV system. The dispatching and conflict-free routing are simultaneously optimized by the Petri Net decomposition approach. In the proposed method, the Petri Net is decomposed into several subnets for task subproblems and AGV subproblems that can be solved by the shortest path algorithm on the reachability graph. The local solutions for the subnets are coordinated by a penalty function algorithm. To ensure the generation of conflict-free routing, a new deadlock avoidance strategy is incorporated in the optimization algorithm. The effects of simultaneous optimization of dispatching and conflict-free routing are investigated for routing problems in dynamic environments.

show abstract

Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays

Cited by 4 publications

References 4 publications

Extending a net splitting operation for decomposition of high-level Petri nets

Extending a net splitting operation for decomposition of high-level Petri nets

Petri Net decomposition approach for the simultaneous optimization of task assignment and routing with automated guided vehicles

Dynamic Optimization of Simultaneous Dispatching and Conflict-free Routing for Automated Guided Vehicles - Petri Net Decomposition Approach -

Contact Info

Product

Resources

About