We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Shortest Routing of Bidirectional Automated Guided Vehicles Avoiding Deadlock and Blocking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
NaiQi Wu ; Dept. of Ind. Eng., Guangdong Univ. of Technol., Guangzhou ; MengChu Zhou

It is a great challenge to effectively manage automated manufacturing systems in which automated guided vehicles (AGVs) are adopted to handle materials, because of such features as prior unknown AGV requests and changing AGV initial positions. This paper aims to find the shortest time routes, while both deadlock and blocking in AGV systems are avoided. It first finds the shortest routes based on a guide path layout, and then performs rerouting, whenever necessary, to avoid deadlock and blocking according to a deadlock avoidance policy, previously developed by the authors. The proposed approach can offer better solutions than existing methods. For some cases, it can find a solution, while the existing ones cannot

Published in:

Mechatronics, IEEE/ASME Transactions on  (Volume:12 ,  Issue: 1 )