Planning and scheduling in a flexible manufacturing system using a dynamic routing method for automated guided vehicles
Resource
Robotics and Automation, 1989. Proceedings., 1989 IEEE International Conference on
Journal
Proceedings - IEEE International Conference on Robotics and Automation
Pages
1584-1589
Date Issued
1989
Date
1989-05
Author(s)
Liu, Pei-Sen
DOI
N/A
Abstract
A approach that can dynamically solve the planning and scheduling problem in a flexible manufacturing system (FMS) is presented. This problem is formulated as the determination of an optimal routing assignment of p automated guided vehicles among m workstations in order to accomplish N tasks in an FMS. A useful task representation called workgraph is introduced to facilitate the latter computation; then the A* search algorithm, the minimax criterion, and source heuristic rules are used to solve this routing assignment problem dynamically. The approach obtains a near-optimal solution in moderate computation time, and, in addition, solves some dynamic situations so as to make the FMS more flexible.
Event(s)
1989 IEEE International Conference on Robotics and Automation, ICRA 1989
SDGs
Other Subjects
Industrial Plants--Flexible Manufacturing Systems; Mathematical programming, Dynamic; Systems science and cybernetics--Heuristic programming; Vehicles--Navigation systems; Automated Guided Vehicles; Dynamic Routing; Minimax Criterion; Robots, Industrial
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00100204.pdf
Size
452.42 KB
Format
Adobe PDF
Checksum
(MD5):980d624ded9f8a29c3f7a26db2ddfd44