Dynamic Routing Approach to Dispatcher Design for Automated Conveyor System
Liang, G. R.
|關鍵字:||輸送機系統;動態繞送演算法;鏈結狀態法;遞移封閉性;Conveyor System;Dynamic Routing Algorithm;Link state Method;Transitive Closure|
Conveyor system is analog to computer network. For the conveyor system, materials are carried by pallets, and pallets are driven by conveyors. In contrast, data are capsulated by packets, and packets are routed within the computer network. Because of their similarity, the successful dynamic routing algorithms used in the computer network are proposed for solving the pallet-routing problem in the conveyor system. For example, the famous link state method is treated as an all-pair shortest path problem. Then its variant implementations are studied such as adjacent matrix, predecessor matrix, transitive closure, etc. All the implementations for a given conveyor system at NCTU are executed by a real-time expert system named G2. Also their performances are observed as expected.
|Appears in Collections:||Thesis|