期刊文献+

基于拟阵理论的AGVS避碰问题研究

New research on conflict-free of AGVS based on Matroids
下载PDF
导出
摘要 针对AGVS(自动导引小车系统)中由于2辆以上AGV(自动导引小车)竞争同一资源(通道或缓冲区)所引起的碰撞问题,提出了一种基于拟阵的方法,仿真实验表明该方法完全可以解决这一问题,同时可以使系统因此而产生的误时最小化。 In order to solve the conflict problem happened when two or more AGVs compete the same resource (lane or buffer), time window technology based on Matroids is proposed. Simulation results have proved that the method is effective and can minimize delay time due to conflict problem of AGVS.
作者 孙亮 朱摩西
出处 《起重运输机械》 北大核心 2005年第12期43-46,共4页 Hoisting and Conveying Machinery
关键词 AGVS 拟阵 避碰问题 AGVS Matroids conflict- free problem
  • 相关文献

参考文献3

  • 1Kim. CW, Tanchoco. JMA. conflict- free shortest time bi - directional AGV routing [J] . International journal of Production Reasearch, 1991, 29 (12): 2377-2391.
  • 2Samia Maza, Pierre Castagna. Robust conflict- free AGV routing in bi - directional network [ C ] . Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001 (2): 761-764.
  • 3Samia Maza, Pierre Castagna. Robust conflict- free routing of bi- directional automated guided vehicles. Systems [C], 2002 IEEE International Conference on Man and Cybernetics, 2002 (10): 6-12.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部