期刊文献+

钢卷库中桥式起重机路径规划的研究 被引量:4

Research on path planning of bridge crane in steel coil warehouse
下载PDF
导出
摘要 随着库房管理系统和桥式起重机自动化运行技术研究和发展,实现钢卷库智能化吊装成为可能。吊装的路径规划是迫切需要解决的问题。目前路径规划多应用于二维平面,桥式起重机吊装在三维空间内展开。文中根据钢卷库中钢卷的位置,对桥式起重机吊运过程进行多方案路径规划,方案一起升高度小于钢卷高度,方案二起升高度大于钢卷高度,采用蚁群算法分别规划出各方案的轨迹路线,再以吊运时间、驱动机构的有效能为评价标准优选出最佳轨迹路线。经案例分析,证明了路径规划方法的合理性与可行性。为钢卷库中桥式起重机实现智能节能高效运行提供了一种方法。 With the research and development of warehouse management system and automatic operation technology of bridge crane,it is possible to realize intelligent hoisting of steel coil warehouse.The urgent problem to be solved at present is to plan the hoisting path.Currently,path planning is mostly applied to two-dimensional plane,while bridge crane hoisting is carried out in three-dimensional space.In this paper,according to the position of steel coils in the steel coil warehouse,several paths are planned for the lifting process of the bridge crane through several schemes.The lifting height in scheme 1 is less than the height of steel coil,and that in scheme 2 is greater than the height of steel coil.The ant colony algorithm is used to plan the routes of each scheme respectively,and then the lifting time and the effective energy of the driving mechanism are used as evaluation criteria to select the best track route.Case analysis proves the rationality and feasibility of the path planning method.It provides a method for the intelligent,energy-saving and efficient operation of the bridge crane in the steel coil warehouse.
作者 陈敬涛 李文都 温日正 米雨 李超 Chen Jingtao;Li Wendu;Wen Rizheng;Mi Yu;Li Chao
出处 《起重运输机械》 2021年第S01期63-65,共3页 Hoisting and Conveying Machinery
关键词 桥式起重机 钢卷库 路径规划 研究 bridge crane steel coil warehouse path planning research
  • 相关文献

参考文献4

二级参考文献37

  • 1胡小兵,黄席樾.基于蚁群算法的三维空间机器人路径规划[J].重庆大学学报(自然科学版),2004,27(8):132-135. 被引量:22
  • 2Oommen B, lyengar S, Rao N S V, et al. Robot Navigation in Unknown Terrains Using Learned Visibility Graphs[J]. IEEE Journal of Robotics and Automation, 1987, 3(6): 672-681.
  • 3Choset H, Burdick J. Sensor Based Planning, Part I: The Generalized Voronoi Graph[C]//Proc. of IEEE International Conference on Robotics and Automation. [S. 1.]: IEEE Press, 1995: 1643-1648.
  • 4Parsons D, Canny J F. A Motion Planner for Multiple Mobile Robots[C]//Proc. of IEEE Intemational Conference on Robotics and Automation. [S. 1.]: IEEE Press, 1990: 8-13.
  • 5Liu Yunhui, Arimoto S. Computation of the Tangent Graph of Polygonal Obstacles by Moving-line Processing[J]. IEEE Transactions on Robotics and Automation, 1994, 10(6): 823-830.
  • 6Papadatos A. Research on Motion Planning of AutonomousMobile Robot[D]. Monterey, USA: Naval Postgraduate School, 1996.
  • 7Stentz A. The Focussed D* Algorithm for Real-time Re- planning[C]//Proc, of the 14th International Joint Conference on Artificial Intelligence. San Francisco, USA: ACM Press, 1995: 1652-1659.
  • 8Daniel K, Nash A, Koenig S, et al. Theta*: Any-angle Path Planning on Grids[J]. Journal of Artificial Intelligence Research, 2010, 39(1): 533-579.
  • 9Bote A, Mtiller M, Schaeffer J. Near Optimal Hierarchical Path-finding[J]. Journal of Game Development, 2004, 1(1): 7-28.
  • 10Lozano P T, Wesley M A. An Algorithm for Planning Collision-flee Paths Among Polyhedral Obstacles[J]. Communications of the ACM, 1979, 22(10): 560-570.

共引文献66

同被引文献26

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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