At present, autonomous mobile robots are widely used in industrial and commercial fields.
However, although the global path searched by existing mobile robot path planning …

To address the problems of the traditional A∗ algorithm in solving paths with many
expansion nodes, high memory overhead, low operation efficiency, and many path corners …

In order to shorten searching time and reduce the quantity of redundant nodes in path
planning, an improved A* algorithm was proposed. In the novel algorithm, compared with …

Aiming at the needs of global optimal path planning and real-time obstacle avoidance for
mobile robots, a path planning method based on the fusion of an improved A* algorithm and …

Path planning is one of the most popular researches on mobile robots, and it is the key
technology to realize autonomous navigation of robots. Aiming at the problem that the …

In the past few decades, many results have been achieved in the research of mobile robot
path planning, and they have been applied in simple scenarios, such as factory AGV, bank …

This paper proposes a hybrid path planning algorithm incorporating a global and local
search mechanism for mobile robot. The global path planning is based on Voronoi graph to …

The characteristics of the path in length, smoothness, and safety are critical to the behavior
of autonomous mobile robots. However, in searching-based global path planning, the …

While the A* algorithm has been widely investigated and applied in path planning problems,
it has outstanding issues such as long calculation time, large turning angles, and the …

Addressing the issues of excessive redundant nodes, non-smooth paths, and low search
efficiency in the path planning process of the traditional A* algorithm, this paper proposes an …