Path Planning Based on Astar Algorithm in Mobile Robot

Authors

  • Zhenyang Peng

DOI:

https://doi.org/10.54097/xhm8tf22

Keywords:

Robot arm mobile platform, Astar algorithm, path planning.

Abstract

The food processing industry is one of the fundamental industries in our daily lives. In recent years, with the development of industrial robot technology, its application in food processing has become increasingly widespread, and the position of robots in industrial production has become higher and higher. At present, many factories choose to use robots to complete some assembly line work, while fully automated factories are widely used due to their high efficiency, reduced energy loss, and irreplaceable accuracy and sustained efficiency that cannot be replaced by manual labor. This trend is gradually increasing with the development of local path planning and other core robot technologies.In this context, we have decided to design a robotic arm mobile platform that can be applied to bakeries. For the fermentation process of bread, we use the mobile robot platform to complete the tasks of picking dough, placing it on the work loss line, and transferring it to the finished product placement point in a constant temperature environment. We even use the robotic arm to ensure that the bread is placed on the shelf from a high-temperature oven in a sterile environment before transportation, thereby saving labor costs, improving work efficiency, and ensuring the hygiene of the production environment. In addition, it is necessary to maintain the collection of surrounding obstacle information in complex indoor environments and improve the information processing ability of the obtained information, in order to plan the shortest path based on the layout of the bakery. In order to improve the efficiency of factory work, this work simulated the application scenario of a bakery and used Astar algorithm for path planning, aiming to ensure that the mobile platform of the robotic arm can complete its work while minimizing unnecessary consumption, collisions, and labor costs.

Downloads

Download data is not yet available.

References

Shen Keyu, You Zhiyu, Liu Yongxin, Huang Tao. Mobile robot path planning based on improved A* algorithm. Southwest University for Nationalities, School of Electrical Engineering, Key Laboratory of State Ethnic Affairs Commission. Computer Application Research. 2023. 40(1):75-79.

Liu Zhijun, Su Liang, Wu Shaoxiong. Development of Local Planning Method for Obstacle Avoidance Paths Based on A* Algorithm. Bus Technology and Research. 2023. 3:6-9.

Wang Haiyao, a Tianyang. Robot Path Planning Based on Improved A* Algorithm and DWA Algorithm. Electronic production. 2023, 21:48-51.

Yu Tengwei, Liu Changli, Research on Obstacle Avoidance Strategies for Mobile Robots in Dynamic Environments [J] Journal of Chongqing Jiaotong University (Natural Science Journal) 2021, 9:131-136.

Steven M. LaValle. Rapidly-Exploring Random Trees: A New Tool for Path Planning. Iowa State University, Computer Science Department. 1998.

Chen Qiulian, Jiang Huanyu, Zheng Yijun. A Review of Rapid Extended Random Tree Algorithms for Robot Path Planning. Computer Engineering and Applications. 2019, 16:10-17

James J. Kuffner, Steven M. LaValle. RRT-Connect: An Efficient Approach to Single-Query Path Planning. 2000 IEEE International Conference on Robotics and Automation, ICRA 2000.

Wang Bin, Nie Jianjun, Li Haiyang, Jie Xiaolin, Yan Hongzhen. Optimizing A* and Dynamic Window Method for Mobile Robot Path Planning. Computer Integrated Manufacturing Systems. 2022, 4 4:1743-1753

Xianmengyu Design of a logistics distribution path optimization algorithm based on Dijkstra [J]. Electronic Design Engineering, 2023, 31(2):20-24.

Design of Agricultural Robot Path Planning System Based on Improved A * Algorithm by Cheng Yonghong and Wang Meng in ournal of agricultural mechanization research. 2023, (3): 83-86.

Downloads

Published

28-05-2024

How to Cite

Peng, Z. (2024). Path Planning Based on Astar Algorithm in Mobile Robot. Highlights in Science, Engineering and Technology, 97, 314-320. https://doi.org/10.54097/xhm8tf22