In this study, we concisely investigate two phases in the hybrid A-star algorithm for non-
holonomic robots: the forward search phase and analytic expansion phase. The forward …

There are various path planning methods for mobile robots and one of them is A-star
algorithm. It serves fairly well for looking the path accurately. Unfortunately, the conventional …

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 …

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 …

With the development of automation technologies, autonomous robots are increasingly used
in many important applications. However, precise self-navigation and accurate path …

In terms of mobile robot path planning, the traditional A* algorithm has the following
problems: a long searching time, an excessive number of redundant nodes, and too many …

In this letter, we present a novel approach to efficiently generate collision-free optimal
trajectories for multiple non-holonomic mobile robots in obstacle-rich environments. Our …

* Corresponding author's e-mail: jiangxx@ ybu. edu. cn abstract: A-star algorithm is a kind of
simple path planning algorithm without solving the calculus, which has a high application …

Determining a feasible path for nonholonomic mobile manipulators operating in congested
environments is challenging. Sampling-based methods, especially bi-directional tree search …

There has been a heated issue in the field of robotics about how to plan the shortest path of
a map with obstacles. This papers mainly analysis the issues about the path planned are not …