1B3 SIMULTANEOUS DISPATCHING AND CONFLICT-FREE ROUTING FOR AUTOMATED GUIDED VEHICLES USING PETRI NET DECOMPOSITION APPROACH

概要

論文の詳細を見る
For rapid growth of transportation systems for semiconductor fabrication bay, it is required to generate a conflict-free route planning for multiple AGVs efficiently to minimize total traveling time. To reduce computational efforts, we propose a Petri Net decomposition approach for dispatching and routing problems for multiple AGVs. In the proposed method, the Petri Net is decomposed into several subnets for task subproblems and AGV subproblems that can be solved by shortest path algorithm. The local solutions for the subnets are integrated by the novel optimization algorithm where the subproblem for each subnet is repeatedly solved until a feasible solution for the original problem is obtained. Deadlock avoidance and blocking avoidance policies are conducted to ensure the generation of feasible solutions. The effectiveness of the proposed method is confirmed for routing problems in dynamic situations.
2009-07-04