自動搬送台車の経路決定法 : 第1報, 経路決定アルゴリズム

This study considers a routing control algorithm of automated guided vehicles (AGVs) in a large scale FMS. When requests for traveling occur, the problem is to determine a route for each of the vehicles with no interferences and with a small idle time. Three methods are proposed in this study for determining the route of the vehicle which receives the traveling request. The remaining routes and waiting times for other vehicles are fixed in the fixed method 1, while only the remaining routes are fixed in the method 2. In the revising method, routes for all vehicles are revised. An algorithm used to solve the problem presented in this study consists of procedures for finding the k-th shortest route for each vehicle, finding a combination of routes for vehicles and determining the waiting times at the node points to avoid the interference.