• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Asia Simulation Conference/International Conference on System Simulation and Scientific Computing >Modeling and Optimizing Conveying Path for Autonomous Conveying Robot
【24h】

Modeling and Optimizing Conveying Path for Autonomous Conveying Robot

机译：自主输送机器人的建模与优化输送路径

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then planning an optimal conveying path for the ACR is important to the actual application. The concept, application and path planning problems of autonomous conveying robot are generalized, and its mathematic model is also introduced. Besides, it is transformed to TSP problem and simulated annealing algorithm is adopted to get the optimal path. Moreover, some strategies are used to modify the standard SA algorithm and the converging speed is improved. A good conveying path planning example is given. Simulation results show that the proposed method is an effective approach to solve this problem and the operating efficiency is greatly improved.
机译：随着机器人技术的快速发展，自主输送机器人已广泛应用于工业和服务领域。因此，寻找符合时间和空间高效算法，然后规划ACR的最佳输送路径对实际应用很重要。自主输送机器人的概念，应用和路径规划问题是概括的，并且还介绍了其数学模型。此外，它被转换为TSP问题，采用模拟退火算法来获得最佳路径。此外，某些策略用于修改标准SA算法，并提高了会聚速度。给出了一个好的传送路径规划例。仿真结果表明，该方法是解决这个问题的有效方法，其运行效率大大提高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号