https://scholars.lib.ntu.edu.tw/handle/123456789/116456
標題: | Planning and scheduling in a flexible manufacturing system using a dynamic routing method for automated guided vehicles | 作者: | Liu, Pei-Sen LI-CHEN FU |
公開日期: | 1989 | 起(迄)頁: | 1584-1589 | 來源出版物: | Proceedings - IEEE International Conference on Robotics and Automation | 會議論文: | 1989 IEEE International Conference on Robotics and Automation, ICRA 1989 | 摘要: | 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. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/2007041910032173 http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032173/1/00100204.pdf https://www.scopus.com/inward/record.uri?eid=2-s2.0-0024866826&partnerID=40&md5=7da051bcab9476ae2dd60f7845356ced |
ISSN: | 10504729 | 其他識別: | N/A | DOI: | 10.1109/ROBOT.1989.100204 | SDG/關鍵字: | 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 |
顯示於: | 資訊工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
00100204.pdf | 452.42 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。