A Global Path Planning Algorithm Based on Bidirectional SVGA

Abstract EN

For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming.

To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (simultaneous visibility graph construction and path optimization by A⁎).

This algorithm does not construct a visibility graph before the path optimization.

However it constructs a visibility graph and searches for an optimal path at the same time.

At each step, a node with the lowest estimation cost is selected to be expanded.

According to the status of this node, different through lines are drawn.

If this line is free-collision, it is added to the visibility graph.

If not, some vertices of obstacles which are passed through by this line are added to the OPEN list for expansion.

In the SVGA process, only a few visible edges which are in relation to the optimal path are drawn and the most visible edges are ignored.

For taking advantage of multicore processors, this algorithm performs SVGA in parallel from both directions.

By SVGA and parallel performance, this algorithm reduces the computing time and space.

Simulation experiment results in different environments show that the proposed algorithm improves the time and space efficiency of path planning.