Petri Net Decomposition Approach to Optimization of Route Planning Problems for AGV Systems

In this paper, we propose a Petri Net (PN) decomposition approach to the optimization of route planning problems for automated guided vehicles (AGVs) in semiconductor fabrication bays. An augmented PN is developed to model the concurrent dynamics for multiple AGVs. The route planning problem to mini...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automation science and engineering Jg. 7; H. 3; S. 523 - 537
Hauptverfasser: Nishi, Tatsushi, Maeno, Ryota
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway, NJ IEEE 01.07.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
AGVS
Algorithms
Applied sciences
Automated guided vehicles
Automated storage retrieval systems
Cities and towns
Constraint optimization
Decision theory. Utility theory
Decomposition
Design optimization
discrete-event systems
Dynamics
Electronics
Exact sciences and technology
Fabrication
Flexible manufacturing systems
Mathematical models
Mathematical programming
Microelectronic fabrication (materials and surfaces technology)
Operational research and scientific management
Operational research. Management science
Optimization
Penalty function
Petri nets (PNs)
Polynomials
Route planning
route planning problem
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Semiconductor research
Semiconductors
shortest-path algorithm
System recovery
Transportation
Vehicle dynamics
Guided vehicle
Transportation system
decomposition
Polynomial method
Automated guided vehicle
Statistical simulation
Modeling
Optimization
Penalty function
Minimum time
Microelectronic fabrication
Petri nets (PNs)
Dynamic programming
Dynamic model
Mathematical programming
Petri net
Large scale system
Discrete event system
Production system
Partition
Travel time
discrete-event systems
Automated guided vehicles
Shortest path
route planning problem
Computational complexity
Polynomial time
Computation time
shortest-path algorithm
Objective function
Planning
Collision avoidance
ISSN:1545-5955, 1558-3783
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a Petri Net (PN) decomposition approach to the optimization of route planning problems for automated guided vehicles (AGVs) in semiconductor fabrication bays. An augmented PN is developed to model the concurrent dynamics for multiple AGVs. The route planning problem to minimize the total transportation time is formulated as an optimal transition firing sequence problem for the PN. The PN is decomposed into several subnets such that the subnets are made independent by removing the original shared places and creating its own set of resource places for each subnet with the appropriate connections. The partial solution derived at each subnet is not usually making a feasible solution for the entire PN. The penalty function algorithm is used to integrate the solutions derived at the decomposed subnets. The optimal solution for each subnet is repeatedly generated by using the shortest-path algorithm in polynomial time with a penalty function embedded in the objective function. The effectiveness of the proposed method is demonstrated for a practical-sized route planning problem in semiconductor fabrication bay from computational experiments.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1545-5955
1558-3783
DOI:10.1109/TASE.2010.2043096