Abstract
We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.
Translated title of the contribution | A New Dynamic Routing Algorithm for Multiple AGV Systems: Nonstop Preferential Detour Algorithm |
---|---|
Original language | Korean |
Pages (from-to) | 795-802 |
Journal | Journal of Institute of Control, Robotics and Systems |
Volume | 8 |
Issue number | 9 |
Publication status | Published - Sept 2002 |
Externally published | Yes |