| 一个规划AGV行走方案的新算法 |
| |
| 引用本文： | 潘明寒. 一个规划AGV行走方案的新算法[J]. 潍坊学院学报, 2006, 6(6): 15-18 |
| |
| 作者姓名： | 潘明寒 |
| |
| 作者单位： | 潍坊学院,山东,潍坊,261061 |
| |
| 摘 要： | 针对AGVS(自动导引小车系统)柔性问题的研究现状,提出了一个AGV行走方案规划的新算法,处理因生产任务临时调整而引起的AGV路线调整,给出了该方法可行性的严格证明。该算法在路线调整操作中简单易行便于实施。
|
| 关 键 词： | AGV AGVS 柔性可行性 避撞 |
| 文章编号： | 1671-4288（2006）06-0015-04 |
| 收稿时间： | 2005-10-24 |
| 修稿时间： | 2005-10-24 |
The New Algorithm of Assassinate Plan of AGV |
| |
| PAN Ming-han. The New Algorithm of Assassinate Plan of AGV[J]. Journal of Weifang University, 2006, 6(6): 15-18 |
| |
| Authors: | PAN Ming-han |
| |
| Affiliation: | Wei fang University ,Wei fang 261061 ,China |
| |
| Abstract: | In order to solve the evaluation problem of AGV feasibility,a new algorithm of assassinate plan of AGV had been given in the article.It will Be used in adjust AGV assassinate path causing by provisional change of production tasks.And the effectiveness of this method was also proved in this paper.The Algorithm is proved that is efficient and feasible. |
| |
| Keywords: | AGV AGVS flexibility evaluate conflict-free |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
