期刊文献+

改进平滑A*算法的多AGV路径规划 被引量:14

Multi-AGV Path Planning Based on Improved Smooth A*Algorithm
在线阅读 下载PDF
导出
摘要 科技的进步促使拥有众多优势的自动导引车(Automated Guided Vehicle,AGV)逐步替代人工搬运,随之产生的多AGV路径规划、协调问题也应运而生。针对上述问题,依据AGV行驶特征,构建笛卡尔坐标系环境,以传统A*算法为基础模型,通过引入3轴-2象限、路线转向数来剔除无效备选点,平滑行驶路径;以系统总工作时长最小为目标制定冲突判断标准与协调策略,实现系统运行效率最佳的目标。通过实例分析,改进A*算法单AGV线路最多可减少10.9%搜索点数和350%转向数;以时间最小为目标的协调策略能够有效避免因主观因素制定的优先度而导致系统陷入局部最优的现象。 Advances in science and technology have prompted Automated Guided Vehicle(AGV)with many advantages to gradually replace manual handling,but the multi-AGV path planning and coordination problems have arisen at the historic moment.Aiming at the above problems,according to the driving characteristics of AGV,a Cartesian coordinate system environment is constructed,and the traditional A*algorithm is used as the basic model.By introducing 3 axes and 2 quadrants,the number of route turnings is used to eliminate invalid alternative points,and the driving path is smoothed.Minimize the time to formulate conflict judgment standards and coordination strategies for the goal to achieve the best system operating efficiency.Through example analysis,the improved A*algorithm single AGV line can reduce the maximum number of search points by 10.9%and the number of turns by 350%;the coordination strategy with the minimum time as the goal can effectively avoid the system from falling into a local optimal phenomenon due to the priority established by subjective factors.
作者 胡蔚旻 靳文舟 HU Weimin;JIN Wenzhou(School of Civil Engineering and Transportation,South China University of Technology,Guangzhou 510461,China)
出处 《计算机工程与应用》 CSCD 北大核心 2020年第16期204-210,共7页 Computer Engineering and Applications
基金 国家自然科学基金(No.61473122)。
关键词 自动导引车 改进A*算法 路径规划 冲突协调 Automated Guided Vehicle(AGV) improved A*algorithm path planning conflict coordination
  • 相关文献

参考文献7

二级参考文献50

  • 1卢晓军,李焱,贺汉根.一种基于自由空间法的虚拟人行走规划方法[J].计算机工程与科学,2005,27(8):60-61. 被引量:8
  • 2Hu Y R,Yang S X,Xu L Z,et al.A knowledge based genetic algo- rithm for path planning in unstructured mobile robot environments. Proceedings of the IEEE International Conference on Rabotics and Automation . 2004
  • 3Borenstein J,Koren Y.Real-time obstacle for fast mobile robots. IEEE Transactions on System,Man,and Cybernetics . 1989
  • 4Fox D,Burgard W,Thrun S.The dynamic window approach to colli- sion avoidance. IEEE Journal of Robotics and Automation . 1997
  • 5Kim Y J,Kim D H,Kim J H.Evolutionary programming-based uni-vec- tor filed method for fast mobile robot navigation. Proceedings of SEAL‘98 . 1999
  • 6Koren Y,Borenstein J.Potential Field Methods and Their Inherent Limitations for Mobile Robot Navigation. . 1991
  • 7Dissanayake G,,Newman P,Clark S, et al.A solution to the simultaneous localization and map building(SLAM) problem[ J]. Transactions on Robotics and Automation . 2001
  • 8Montemerlo M,Thrun S.Simultaneous localization and mapping with unknown data association using FastSLAM. Proceedings of the IEEE International Conference on Robotics and Automation . 2003
  • 9王海峰.基于模糊推理系统的新型并联机器人路径规划算法[J].机械与电子,2008,26(1):51-54. 被引量:2
  • 10刘一松,魏宁,孙亚民.基于栅格法的虚拟人快速路径规划[J].计算机工程与设计,2008,29(5):1229-1230. 被引量:8

共引文献334

同被引文献172

引证文献14

二级引证文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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