Automatic Pathfinding of the Robotic Arm by A* Algorithm on 2-Dimension in MATLAB Simulink

Authors

  • Changrui Cai

DOI:

https://doi.org/10.54097/hset.v63i.10886

Keywords:

MATLAB, Simulink, A* algorithm, robotics, auto pathfinding.

Abstract

This project will give people who are new to A* algorithm a general idea about how robotic arms works in Simulink by applying the A*algorithm. Since A*algorithm combined advantage of two effective algorithm, this project decides to choose it as the main algorithm of the robot arms. In this project, the research question is whether a 2-joint robot arm passes through a single obstacle in 2D space to reach its destination and it selects the shortest path. The answer will be found by applying the A* algorithm on the robot arm. By analyzing the GHF values and trajectory graphs generated by MATLAB and Simulink. It has been confirmed that the A* algorithm works on the robot arm. Finally, success rate was calculated to be 81.7%, confirming that the 2-joint robot arm could pass through a single obstacle in 2D space to reach its destination and it selects the shortest path. The result of this project ca be more convincing if it run in 3-dimension.

Downloads

Download data is not yet available.

References

J. Zhao, C. Wang, and B. Xie, “Human-like motion planning of robotic arms based on human arm motion patterns,” Robotica, vol. 41, no. 1, 259–276, Sep. 2022.

D. Wahyuningsih and E. Syahreza, “Shortest Path Search Futsal Field Location with Dijkstra Algorithm,” IJCCS (Indonesian Journal of Computing and Cybernetics Systems), vol. 12, no. 2, 161.

Y. Zhang and M. Chen, “Performance evaluation of Software-Defined Network (SDN) controllers using Dijkstra’s algorithm,” Wireless Networks, Aug. 2022.

C. Frăsinaru and M. Răschip, “Greedy Best-First Search for the Optimal-Size Sorting Network Problem,” Procedia Computer Science, vol. 159, 447–454, 2019.

G. Tang, C. Tang, C. Claramunt, X. Hu, and P. Zhou, “Geometric A-Star Algorithm: An Improved A-Star Algorithm for AGV Path Planning in a Port Environment,” IEEE Access, vol. 9, 59196–59210, 2021.

A. Candra, M. A. Budiman, and R. I. Pohan, “Application of A-Star Algorithm on Pathfinding Game,” Journal of Physics: Conference Series, vol. 1898, no. 1, 012047, Jun. 2021.

P. O. N. Saian, Suyoto, and Pranowo, “Optimized A-Star algorithm in hexagon-based environment using parallel bidirectional search,” 2016 8th International Conference on Information Technology and Electrical Engineering (ICITEE), Oct. 2016.

A. Patel, “Introduction to A*”, Stanford.edu, 2019. http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html

F. Duchoň et al., “Path Planning with Modified a Star Algorithm for a Mobile Robot,” Procedia Engineering, vol. 96, 59–69, 2014.

L. Liu et al., “Global Dynamic Path Planning Fusion Algorithm Combining Jump-A* Algorithm and Dynamic Window Approach,” IEEE Access, vol. 9, 19632–19638, 2021.

N. K. Kang, H. J. Son, and S.-H. Lee, “Modified A-star algorithm for modular plant land transportation,” Journal of Mechanical Science and Technology, vol. 32, no. 12, 5563–5571, Dec. 2018.

Downloads

Published

08-08-2023