EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Research on path planning of mobile robots based on improved A * algorithm

Xing Fu, Zucheng Huang, Gongxue Zhang, Weijun Wang, Jian Wang

PeerJ Computer Science · 25.02.2025 · 11 · e2691

DOI: 10.7717/peerj-cs.2691 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 25.02.2025. Verfasst von Xing Fu und 4 weiteren Autor:innen. Beteiligte Einrichtung: Robot and Intelligent Equipment Center, Guangzhou Institute of Advanced Technology, Guangzhou, Guangdong, China. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key Research and Development Program of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To address the issues of low search efficiency, excessive node expansion, and the presence of redundant nodes in the traditional A* algorithm, this article proposes an improved A* algorithm for mobile robot path planning. Firstly, a multi-neighborhood hybrid search method is introduced, optimizing the traditional eight-neighborhood and twenty-four-neighborhood into a new sixteen-neighborhood. The choice between eight-neighborhood search and sixteen-neighborhood search is determined based on the presence of obstacles in the eight-neighborhood around the current node, effectively enhancing the search efficiency of the algorithm and reducing the number of nodes expanded during the search process. Subsequently, unnecessary nodes are eliminated based on the positional relationship between the current node and the target node, according to neighborhood direction search rules, further decreasing the number of expanded nodes. Additionally, improvements to the bidirectional search mechanism along with the incorporation of dynamic weight coefficients further enhance the search efficiency of the algorithm. Furthermore, a strategy for extracting key nodes is employed to effectively remove useless turn points, thus resolving the issue of redundant nodes. Finally, simulation experiments demonstrate that the proposed improved A* algorithm outperforms the traditional A* algorithm in terms of search speed, number of expanded nodes, and path length, validating the effectiveness of the proposed method.

Schlagwörter

Stichwörter der Autor:innen

A* algorithmBidirectional searchHybrid searchNode deletionPath planning

Autor:innen und Institutionen

  • Robot and Intelligent Equipment Center, Guangzhou Institute of Advanced Technology, Guangzhou, Guangdong, China.
  • College of Mechanical and Electrical Engineering, Shaanxi University of Science and Technology, Xi'an, Shaanxi, China.

Förderung

  • National Key Research and Development Program of China

Zitieren

APA

Fu, X., Huang, Z., Zhang, G., Wang, W., & Wang, J. (2025). Research on path planning of mobile robots based on improved A * algorithm. PeerJ Computer Science, 11, e2691. https://doi.org/10.7717/peerj-cs.2691

Vancouver

Fu X, Huang Z, Zhang G, Wang W, Wang J. Research on path planning of mobile robots based on improved A * algorithm. PeerJ Computer Science. 2025;11:e2691. doi:10.7717/peerj-cs.2691

BibTeX
@article{Fu2025,
  author = {Fu, Xing and Huang, Zucheng and Zhang, Gongxue and Wang, Weijun and Wang, Jian},
  title = {Research on path planning of mobile robots based on improved A * algorithm},
  journal = {PeerJ Computer Science},
  year = {2025},
  volume = {11},
  pages = {e2691},
  doi = {10.7717/peerj-cs.2691}
}
Kostenlos starten →