{"title":"Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays","authors":"T. Nishi, R. Maeno","doi":"10.1109/COASE.2006.326886","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a decomposition and optimization method for Petri nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri net. The optimization model 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","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2006.326886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper, we propose a decomposition and optimization method for Petri nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri net. The optimization model 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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
