查詢結果分析
來源資料
相關文獻
- A Petri Net Model for Traffic Control in a Network Automated Guided Vehicle System
- Modeling a FMS with Colored Timed Object-Oriented Petri Nets
- 利用無線通訊傳輸於交通控制及先進運輸資訊系統上之研究
- 東西向快速公路交控系統計畫
- 捷運系統行車控制中心
- Integration of Scheduling and Control in a Job Shop
- 應用SES模式於西濱快速公路交通控制改善之研究
- 高(快)速公路交通控制系統與隧道機電系統之整合
- 偵測器應用分析暨車流資訊自我校估方法建立之整合研究
- 都市整合交通控制與管理系統
頁籤選單縮合
| 題 名 | A Petri Net Model for Traffic Control in a Network Automated Guided Vehicle System=網路式無人搬運車系統交通控制之斐氏圖模式 |
|---|---|
| 作 者 | 楊能舒; | 書刊名 | 國立雲林技術學院學報 |
| 卷 期 | 4 1995.06[民84.06] |
| 頁 次 | 頁59-66 |
| 分類號 | 448.94 |
| 關鍵詞 | 網路式無人搬運車系統; 交通控制; 斐氏圖; Network AGV; Traffic control; Petri net; |
| 語 文 | 英文(English) |
| 中文摘要 | 無人搬運車系統依其佈置可分為傳統的網路式及近來發展之區域式。在網路式無 人搬運車系統中之每一部搬運車可藉其交通網路而抵達任一工作站,因此其優點是具備彈性 。但是網路式無人搬運車系統最大的困難在其複雜的交通控制,也因此促使近來區域式無人 搬運車系統的發展,區域式系統僅用一部搬運車在每個迴圈內以服務座落在迴圈路徑邊之若 干工作站,因此基本上並無所謂交通控制的問題。然而其缺點在不具彈性而且搬運車及工作 站的稼動率皆低。本文介紹一斐氏圖模式以應用在網路式無人搬運車系統,藉此其交通控制 變為可行,而且交通控制問題之核心,亦即堵塞及互鎖現象,變成可以偵測並可避免。其運 行方式如下:首先無人搬運車系統之路徑結構以斐式圖表之,再以延展樹演算法求得每一部 搬運車的激發系列,亦是其到達目的地行走路徑,其間堵塞現象可藉本文所發展的定義予以 偵測並避免。而在本文所發展的交通控制模式中互鎖現象並無發生的可能。 |
| 英文摘要 | Automated guided vehicle systems (AGVS) can be classified, according to its layout, as traditional Network AGVSs and lately developed Tandem AGVSs. A vehicle in a Network AGVS can go through the transportation network and arrive at any station, therefore flexibility is the advantage of such a system. However, the major difficulty associated with a Network AGVS is the complexity of traffic control which also facilitates the development of Tandem AGVS lately. A Tandem AGVS uses a vehicle in a loop to serve the work stations along the path, and basically traffic control problem does not exist. However, the loss of a Tandem AGVS includes low flexibility and utilization of both vehicles and work stations. This peper introduce a Petri Net model in a Network AGVS, and the traffic control become scheduleable. Additionally, congestion and gridlocking which are the core of the traffic control can be detected and then avoided. It works as follows: the path structure of a Network AGVS is modeled as a Petri Net. Then reachability tree is applied to solve the firing sequence of each vehicle which is also the shortest path to destination. During the development of the shortest path to destination, a traffic congestion can be detected and avoided by a constraint defined in this paper, and gridlocking also becomes nonexistent in the traffic control structured by a Petri Net model in this paper. |
本系統中英文摘要資訊取自各篇刊載內容。