基于人工智能搜索技术的工业机械臂轨迹规划计算效率分析

N. Anjum, M. K. Amjad, Y. Ayaz
{"title":"基于人工智能搜索技术的工业机械臂轨迹规划计算效率分析","authors":"N. Anjum, M. K. Amjad, Y. Ayaz","doi":"10.1109/ICRAI47710.2019.8967374","DOIUrl":null,"url":null,"abstract":"this paper presents implementation and analysis of computational efficiency of artificial intelligence based search techniques for motion planning of a two degree of freedom revolute-revolute industrial manipulator (2-DOF RR). Depth First Search (DFS), Breadth First Search (BFS), Uniform Cost Search (UCS) and A* Search have been implemented in MATLAB environment for trajectory planning of manipulator from an initial position to final position. A comparative analysis for utilization of computational resources by these search techniques is then presented based on sizes of their frontier and explored sets. Simulation results show that A* is faster and its memory usage is 4 to 9 times less as compared to DFS, BFS, and UCS in trajectory planning on industrial manipulator.","PeriodicalId":429384,"journal":{"name":"2019 International Conference on Robotics and Automation in Industry (ICRAI)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Computational Efficiency of Artificial Intelligence based Search Techniques in Trajectory Planning of Industrial Manipulator\",\"authors\":\"N. Anjum, M. K. Amjad, Y. Ayaz\",\"doi\":\"10.1109/ICRAI47710.2019.8967374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"this paper presents implementation and analysis of computational efficiency of artificial intelligence based search techniques for motion planning of a two degree of freedom revolute-revolute industrial manipulator (2-DOF RR). Depth First Search (DFS), Breadth First Search (BFS), Uniform Cost Search (UCS) and A* Search have been implemented in MATLAB environment for trajectory planning of manipulator from an initial position to final position. A comparative analysis for utilization of computational resources by these search techniques is then presented based on sizes of their frontier and explored sets. Simulation results show that A* is faster and its memory usage is 4 to 9 times less as compared to DFS, BFS, and UCS in trajectory planning on industrial manipulator.\",\"PeriodicalId\":429384,\"journal\":{\"name\":\"2019 International Conference on Robotics and Automation in Industry (ICRAI)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Robotics and Automation in Industry (ICRAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRAI47710.2019.8967374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Robotics and Automation in Industry (ICRAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAI47710.2019.8967374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了基于人工智能的二自由度工业机械臂运动规划搜索技术的实现和计算效率分析。在MATLAB环境下实现了深度优先搜索(DFS)、宽度优先搜索(BFS)、均匀代价搜索(UCS)和A*搜索,实现了机械手从初始位置到最终位置的轨迹规划。然后,根据边界集和探索集的大小,对这些搜索技术的计算资源利用率进行了比较分析。仿真结果表明,在工业机械臂的轨迹规划中,A*算法比DFS、BFS和UCS算法速度更快,内存占用比DFS、BFS和UCS算法少4 ~ 9倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Computational Efficiency of Artificial Intelligence based Search Techniques in Trajectory Planning of Industrial Manipulator
this paper presents implementation and analysis of computational efficiency of artificial intelligence based search techniques for motion planning of a two degree of freedom revolute-revolute industrial manipulator (2-DOF RR). Depth First Search (DFS), Breadth First Search (BFS), Uniform Cost Search (UCS) and A* Search have been implemented in MATLAB environment for trajectory planning of manipulator from an initial position to final position. A comparative analysis for utilization of computational resources by these search techniques is then presented based on sizes of their frontier and explored sets. Simulation results show that A* is faster and its memory usage is 4 to 9 times less as compared to DFS, BFS, and UCS in trajectory planning on industrial manipulator.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信