{"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}
引用次数: 0
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.