Abstract
Automated guided vehicle (AGV) systems are important for material handling in automated manufacturing systems (AMS). However, it is a great challenge to effectively manage them due to some of their features, e.g., the number of AGVs being fixed, prior unknown requests, and changing AGV initial positions. This paper aims to find the shortest time routing while both deadlock and blocking in them are avoided. We first find the shortest routing based on a layout of an AGV system, and then perform rerouting whenever necessary to avoid deadlock and blocking according to a deadlock avoidance policy previously developed by the authors. The algorithms are presented and illustrated through examples.
Original language | English (US) |
---|---|
Pages (from-to) | 1428-1433 |
Number of pages | 6 |
Journal | Proceedings - IEEE International Conference on Robotics and Automation |
Volume | 1 |
State | Published - 2003 |
Event | 2003 IEEE International Conference on Robotics and Automation - Taipei, Taiwan, Province of China Duration: Sep 14 2003 → Sep 19 2003 |
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Artificial Intelligence
- Electrical and Electronic Engineering