Research on path planning of mobile robots based on improved A<i>*</i> algorithm.
Ontology highlight
ABSTRACT: 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 c
SUBMITTER: Fu X
PROVIDER: S-EPMC11888910 | biostudies-literature | 2025
REPOSITORIES: biostudies-literature
ACCESS DATA