Load volume considerations in the collision free route planning of material handling devices in FMS
Huang, Juifen
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/19144
Description
Title
Load volume considerations in the collision free route planning of material handling devices in FMS
Author(s)
Huang, Juifen
Issue Date
1992
Doctoral Committee Chair(s)
Kapoor, Shiv G.
Palekar, Udatta S.
Department of Study
Industrial and Enterprise Systems Engineering
Discipline
Industrial Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Industrial
Language
eng
Abstract
Material handling is an important component of Flexible Manufacturing Systems (FMSs). Automated Guided Vehicles (AGVs) are commonly employed for this function. Efficient use of AGV systems requires proper routing and scheduling of vehicular traffic. The simultaneous routing of several AGVs to avoid collision is known to be an NP-Hard problem. In this research, we address the problem of optimal and efficient routing of AGVs through a guide path network.
Initially, we assume AGV size and load size are negligible. We present a sequential approach to plan routes for one vehicle at a time. Traffic constraints are put in the form of time windows. The routing of AGVs is formulated as a shortest time path problem in a network with time window constraints. A labeling algorithm is developed to solve this problem in polynomial time.
In the second part of this research, we explicitly consider the volume of AGVs and the volume of the loads to be transported. A configuration space obstacle approach is employed to calculate traffic constraints. A two level decomposition of the route planning problem is used to plan collision free routes. A global navigation step plans a shortest time route between two nodes in the guide path network. The translation of the vehicle on an arc connecting two nodes and rotation at a node joining two arcs are planned at a local level. The routing problem at both levels is formulated as a network model with time window constraints at the local level and with reachability window constraints at the global level. The labeling algorithm developed in the first part is modified to plan both local and global routes.
The algorithms are tested using extensive computer simulations. The simulation results indicate that the algorithms are computationally efficient and can be applied for both point load and volume load vehicle routing problems on uni-directional and bi-directional networks. Practical considerations such as disposition of idle AGVs, dispatching and rerouting are also studied using simulations. Finally, extensions of the algorithms to the case of cooperative material handling systems are discussed.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
