Article Details

Title · Authors · Abstract · Keywords · DOI · References

A Grid Map Pathfinding Method Based on Domestic Robot

LI Gentang

(Zhuhai Amicro Semiconductor Co., Ltd., Zhuhai 519075, China)

Section:Computer Technology · 2025, Vol. 9, No. 12 · Pages:97-100,109 · 2096-4706(2025)12-0097-05 · CLC number:TP242.6;TP301.6 · Document code:A · DOI:10.19850/j.cnki.2096-4706.2025.12.019

Abstract

In a complex home environment, when domestic robots perform cleaning tasks, they usually need to move between various positions, and various obstacles can be encountered during the process. In order to effectively reduce the contact between the robot and these obstacles and enable it to reach the predetermined target position smoothly, a pathfinding method based on a grid map is proposed. This method adjusts the original weight of reference grids near obstacles by adding an additional weight, so that the weighted value of these reference grids is significantly higher than that of other adjacent reference grids, so as to guide the domestic robot to move towards reference grids with lower weight. This strategy not only effectively maintains the safe distance between the robot and the obstacle, but also reduces the risk of collision and improves the traffic efficiency of the robot.

Keywords

sweeping robot; grid map; path planning

References

  1. [1] Panos Lulidas Real world algorithms [M]. Translated by Wang Gang Beijing: Machinery Industry Press, 2020
  2. [2] Zhou Peide Computational Geometry: Algorithm Analysis and Design: 2nd Edition [M]. Beijing: Tsinghua University Press, 2005
  3. [3] HART P E,NILSSON N J,RAPHAEL B. A Formal Basis for the Heuristic Determination of Minimum Cost Paths [J].IEEE Transactions on Systems Science and Cybernetics,1968,4(2):100-107.
  4. [4] Alonzo Kelly Mobile Robotics (Mathematical Fundamentals, Model Building, and Implementation Methods) [M]. Translated by Wang Wei, Cui Weina, et al Beijing: Machinery Industry Press, 2020
  5. [5] Colin. A Star Algorithm Detailed Explanation (in my opinion, the most detailed and easy to understand version) [EB/OL]. [2022-12-20] https://blog.csdn.net/hitwhylz/article/details/23089415.
  6. [6] Shen Keyu, You Zhiyu, Liu Yongxin, et al. Path Planning for Mobile Robots Based on Improved A~* Algorithm [J]. Computer Application Research, 2023, 40 (1): 75-79
  7. [7] Song Xiaoru, Ren Yiyue, Gao Song, et al. Overview of Path Planning for Mobile Robots [J]. Computer Measurement and Control, 2019, 27 (4): 1-5+17
  8. [8] Wang Hongbin, Hao Ce, Zhang Ping, et al. Path Planning of Mobile Robots Based on A * Algorithm and Artificial Potential Field Method [J]. China Mechanical Engineering, 2019, 30 (20): 2489-2496
  9. [9] Fu Lixia, Ren Yujie, Zhang Yong, et al. Path Planning for Mobile Robots Based on Improved Smooth A * Algorithm [J]. Computer Simulation, 2020, 37 (8): 271-276
  10. [10] Wei Yan, Jin Fang, Dong Kaifeng, et al. Improved Global Path Planning A * Algorithm Based on Node Optimization [J]. Computer Measurement and Control, 2023 (6): 143-148

About the authors

Li Gentang (1978-), male, Han ethnicity, born in Zhuzhou, Hunan Province, is a mid-level engineer (senior programmer) with a master's degree. His research direction is robot technology research and development.