DC 欄位 | 值 | 語言 |
dc.contributor | Dept. of Comput. & Inf. Eng., National Taiwan Univ. | en |
dc.contributor.author | Liu, Pei-Sen | en_US |
dc.contributor.author | LI-CHEN FU | en_US |
dc.creator | Liu, Pei-Sen; Fu, Li-Chen | - |
dc.date | 1989-05 | en |
dc.date.accessioned | 2007-04-19T03:15:23Z | - |
dc.date.accessioned | 2018-07-05T01:12:59Z | - |
dc.date.available | 2007-04-19T03:15:23Z | - |
dc.date.available | 2018-07-05T01:12:59Z | - |
dc.date.issued | 1989 | - |
dc.identifier | N/A | en |
dc.identifier.issn | 10504729 | - |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/2007041910032173 | - |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032173/1/00100204.pdf | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0024866826&partnerID=40&md5=7da051bcab9476ae2dd60f7845356ced | - |
dc.description.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. | - |
dc.format | application/pdf | en |
dc.format.extent | 463276 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | en-US | en |
dc.language.iso | en_US | - |
dc.relation | Robotics and Automation, 1989. Proceedings., 1989 IEEE International Conference on | en |
dc.relation.ispartof | Proceedings - IEEE International Conference on Robotics and Automation | - |
dc.subject.other | 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 | - |
dc.title | Planning and scheduling in a flexible manufacturing system using a dynamic routing method for automated guided vehicles | - |
dc.type | conference paper | en |
dc.relation.conference | 1989 IEEE International Conference on Robotics and Automation, ICRA 1989 | - |
dc.identifier.doi | 10.1109/ROBOT.1989.100204 | en |
dc.identifier.scopus | 2-s2.0-0024866826 | - |
item.fulltext | with fulltext | - |
item.grantfulltext | open | - |
dc.relation.pages | 1584-1589 | - |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032173/1/00100204.pdf | - |
item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
item.openairetype | conference paper | - |
item.languageiso639-1 | en_US | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.fulltext | with fulltext | - |
crisitem.author.dept | Electrical Engineering | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Center for Artificial Intelligence and Advanced Robotics | - |
crisitem.author.orcid | 0000-0002-6947-7646 | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | Others: University-Level Research Centers | - |
顯示於: | 資訊工程學系
|