CASIA OpenIR  > 综合信息系统研究中心
Path planning and intelligent scheduling of multi-AGV systems in workshop
Chengbao,Liu1,2; Jie,Tan1; Hongsheng,Zhao1; Yaning, Li1; Xiwei,Bai1
2017-09
会议名称2017 36th Chinese Control Conference (CCC)
会议日期26-28 July 2017
会议地点Dalian, China
出版者IEEE
摘要

With the continuous development of intelligent logistics, the application of Automated Guided Vehicles (AGVs) increasingly becomes popular in many industrial fields. However, there are a series of problems in multi-AGV systems, such as resource allocation, conflict and deadlock. It is difficult to plan the shortest path for each AGV without conflict and collision in multi-AGV systems. In this paper, a multi-AGV scheduling system in workshop is established by using the unidirectional directed graph method and the A* algorithm for path planning of AGVs. In addition, the system is realized by programming and a simulation experiment of 20 AGVs is set up. Finally, the simulation results show that the system can effectively solve the conflict problem of AGVs, and is stable and high real-time. The system is easily extended to their similar multi-AGV scheduling systems, and has a great application value.

收录类别EI
文献类型会议论文
条目标识符http://ir.ia.ac.cn/handle/173211/23546
专题综合信息系统研究中心
通讯作者Chengbao,Liu
作者单位1.Institute of Automation, Chinese Academy of Sciences
2.University of Chinese Academy of Sciences
第一作者单位中国科学院自动化研究所
通讯作者单位中国科学院自动化研究所
推荐引用方式
GB/T 7714
Chengbao,Liu,Jie,Tan,Hongsheng,Zhao,et al. Path planning and intelligent scheduling of multi-AGV systems in workshop[C]:IEEE,2017.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Path planning and in(422KB)会议论文 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chengbao,Liu]的文章
[Jie,Tan]的文章
[Hongsheng,Zhao]的文章
百度学术
百度学术中相似的文章
[Chengbao,Liu]的文章
[Jie,Tan]的文章
[Hongsheng,Zhao]的文章
必应学术
必应学术中相似的文章
[Chengbao,Liu]的文章
[Jie,Tan]的文章
[Hongsheng,Zhao]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Path planning and intelligent scheduling of multi-AGV systems in workshop.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。