Proceeding of the 3rd International Conference on Informatics and Technology, 2009

HALF-SWEEP GAUSS-SEIDEL (HSGS) ITERATIVE METHOD FOR ROBOT PATH PLANNING

Azali Saudi and Jumat Sulaiman

School of Science and Technology
Universiti Malaysia Sabah, Jalan Sulaman
88999 Kota Kinabalu, Sabah, Malaysia.
Email: [email protected], [email protected]

ABSTRACT

This paper deals with robot path planning problem which uses harmonic functions to generate path in the
configuration space. Harmonic functions are known to have an advantage as a global potential function in the
potential field based approach for robot path planning. However, an immense amount of computations are required
as the size of the environment get bigger. This paper conducts an experiment to speed up the computation by solving
the harmonic functions with faster solver, Half-Sweep Gauss-Seidel (HSGS) iterative method. The efficiency of this
approach is shown by comparing its performance with the existing standard numerical.

Keywords: Robot Path Planning, Half-Sweep Gauss-Seidel (HSGS) Iterative Method, Laplace’s Equation,
Potential Field Method.

1.0 INTRODUCTION

Harmonic functions are solutions to Laplace’s equation. Harmonic functions offer a complete path planning algorithm
and paths derived from them are generally smooth. When applied to path planning of robots, they have the
advantage over simple potential field based approach, as they exhibit no spurious local minima.

2.0 RELATED WORKS

In [1], Connolly and Gruppen reported that harmonic functions have a number of properties useful in robotic
applications. The use of potential functions for robot path planning, as introduced by Khatib [5], views every obstacle
to be exerting a repelling force on an end effector, while the goal exerts an attractive force. Koditschek [6], using
geometrical arguments, showed that, at least in certain types of domains, there exists potential functions which can
guide the effector from almost any point to a given point. These potential fields for path planning, however, suffer
from the spontaneous creation of local minima.

Connolly et al. [7] and Akishita et al. [8] independently developed a global method using solutions to Laplace’s
equations for path planning to generate a smooth, collision-free path. The potential field is computed in a global
manner, i.e. over the entire region, and the harmonic solutions to Laplace’s equation are used to find the path lines
for a robot to move from the start point to the goal point.

Obstacles are considered as current sources and the goal is considered to be the sink, with the lowest assigned
potential value. This amounts to using Dirichlet boundary conditions. Then, following the current lines, i.e. performing
the steepest descent on the potential field, a succession of points with lower potential values leading to the point with
least potential (goal) is found out.

It is observed by Connolly et al. [4] that this process guarantees a path to the goal without encountering local minima
and successfully avoiding any obstacle. The work in [2] and [3] show that block methods perform much faster than
the standard Jacobi and Gauss-Seidel iterative methods.

Several other methods are also proposed for solving path planning problem. In [16], an algorithm that employs
distance transform method is reported. Jan et al. [17] conducted researches on utilizing geometry maze routing
algorithm. The work by Bhattacharya and Gavrilova [18] uses Voronoi Diagram to solve path planning problem.

3.0 PHYSICAL ANALOGY

Assuming that a real robot vehicle can be reduced to a point moving in a known environment, path planning problem
of the robot can be formulated as a steady-state heat transfer problem. In the heat transfer analogy, the goal is
treated as a sink pulling heat in. The environment boundaries and obstacles are considered as heat sources and are
fixed with constant temperature values. As the result of a heat conduction process, a temperature distribution
develops and the heat flux lines that are flowing to the sink fill the workspace. Such a field can be seen as a
communication medium among the goal, obstacles and robots. The path can be easily found by following the heat
flux.

©Informatics '09, UM 2009 RDT1-34

 Proceeding of the 3rd International Conference on Informatics and Technology, 2009

4.0 HARMONIC FUNCTIONS

A harmonic function on a domain Ω ⊂ R n is a function which satisfies Laplace’s equation,

n 2
∇ 2φ = ∑ ∂∂xφ = 0
i =1
2
i
(1)

where xi is the i-th Cartesian coordinate and n is the dimension. In the case of robot path construction, the boundary
of Ω (denoted by ∂Ω ) consists of the outer boundary of the workspace and the boundaries of all the obstacles as
well as the start point and the goal point, in a configuration space representation. The spontaneous creation of a false
local minimum inside the region Ω is avoided if Laplace’s equation is imposed as a constraint on the functions used,
as the harmonic functions satisfy the min-max principle.

The gradient vector field of harmonic functions has a zero curl, and the function itself obeys the min-max principle.
Hence the only types of critical points which can occur are saddle points. For a path-planning algorithm, an escape
from such critical points can be found by performing a search in the neighbourhood of that point. Moreover, any
perturbation of a path from such points results in a path which is smooth everywhere.

In this paper, present work focus on solving Laplace’s equation in Eq. (1) numerically using point iterative method.
The performance of standard point iterative methods that include Jacobi and Gauss-Seidel (also known as Full-
Sweep Gauss-Seidel (FSGS)) was reported in [2] and [3]. In this study the performance of these standard methods
are compared to the proposed Half-Sweep Gauss-Seidel (HSGS) iterative method.

5.0 CONFIGURATION SPACE

In the framework used in this study, the robot, i.e. its configuration, is represented by a point in the configuration
space, or C-space. The path planning problem is then posed as an obstacle avoidance problem for the point robot
from the start point to the goal point in the C- space. The C-space examples used in this paper have either square or
rectangular outer boundaries, having projections or convolutions inside to act as barriers. Apart from projections of
the boundaries, some obstacles inside the boundary are also considered. The C-space is discretized and the
coordinates and function values associated with each node are computed. The highest temperature is assigned to
the start point whereas the goal point is assigned the lowest. In some cases with Dirichlet conditions, the start point is
not assigned any temperature. The results are processed, for Dirichlet boundary conditions, by assigning different
temperature values to the boundaries.

In this work, solution to the Laplace’s equation were examined with Dirichlet boundary conditions

Φ | ∂Ω = c
where c is constant.

6.0 PATH PLANNING

Once the harmonic function under the boundary conditions is established, the required path can be traced by the
steepest descent method, following the negative gradient from the start point through successive points with lower
temperature till the goal, which is the point with the lowest temperature. The coordinates and the nodal gradients of
temperature obtained from the finite difference analysis can be used to draw the path.

6.1 Formulation of Half-Sweep Gauss-Seidel (HSGS) Iterative Method

In the literature, Jacobi [9] and Gauss-Seidel [7] are the standard choice for solving any linear system. More recently,
Daily and Bevly [11] use analytical solution for arbitrarily shaped obstacles. In this study, we conduct an experiment
with faster numerical solver than in [7] and [9] by employing HSGS iterative method for solving the Laplace’s
equation.

The half-sweep iterative method is introduced by Abdullah [10] via the Explicit Decoupled Group (EDG) iterative
method to solve 2-D Poisson equations. This method is also applied in solving partial differential equations in Ibrahim
& Abdullah [12], Yousif & Evans [13], and Abdullah & Ali [14]. A modified version of this method is also investigated
by Sulaiman et al for solving diffusion equation [15].

©Informatics '09, UM 2009 RDT1-35

 Proceeding of the 3rd International Conference on Informatics and Technology, 2009

To show the effectiveness of HSGS iterative method, let us consider the two-dimensional Laplace equation in Eq. (1)
defined as
∂ 2U ∂ 2U
+ =0 (2)
∂2 x ∂2 y

By using the second-order central difference scheme, we can simplify the five point second-order standard finite
difference approximation equations for problem (2) as generally stated in the following equation
U i −1, j + U i +1, j + U i , j −1 + U i, j +1 − 4U i, j = 0 (3)

The equation in Eq. (3) shown above is the standard Gauss-Seidel iterative method for solving linear system. This
work presents the implementation of HSGS iterative method that involves the ● type of node point only. Obviously,
the implementation of the HSGS iterative method just involves half of the whole inner points as shown in Figure 1
compared with the full-sweep iterative method.

(a) (b)
Fig. 1: (a) All nodes will be considered in FSGS iterative method. (b) Only type ● node points will be considered for
HSGS iterative method.

The HSGS iterative method, which is based on the five point rotated finite difference approximation equation, has
been initiated by Abdullah [21] for solving problem (1). In fact, the main characteristic of such iterative method is to
reduce the computational complexity by considering only half of the total node points. To examine the effectiveness
of the HSGS iterative method, let us consider the type ● node points as

U i −1, j −1 + U i +1, j −1 + U i −1, j +1 + U i +1, j +1 − 4U i , j = 0 (4)

The stencil of rotated 5 points for Eq. (4) is shown in Figure 2.

Fig. 2: The stencil of rotated 5 points for HSGS iterative method.

The iterative process is terminated when there is no change of any node point from one iteration to the next. Thus, a
very high precision of computation is required to avoid flat area in the final solution. Once the temperature values of

©Informatics '09, UM 2009 RDT1-36

 Proceeding of the 3rd International Conference on Informatics and Technology, 2009

all type ● node points are obtained, approximate values of the remaining node points will be obtained directly by
direct methods.

Table 1: Number of iterations required for the three numerical techniques.

Jacobi Full-Sweep Gauss-Seidel Half-Sweep Gauss-Seidel

(FSGS) (HSGS)

Number of iterations 56,188 28,078 14,299

Period in seconds 275.26 131.34 33.48

6.2 Simulation

The experiment considered a static environment that consists of a goal point, three starting points and an L shape
obstacle. Initially, the outer boundaries (walls) and obstacle were fixed with high temperature values. Goal point was
set to very low temperature. All other free spaces were set to zero temperature value including all three start points.
Then, the iteration process is run to compute temperature values numerically at all points in the environment.

(a) (b)

(c) (d)

Fig. 3: (a) Temperature values in the environment. (b) A 3D view of the environment (with paths and obstacles raised
up). (c) Another angle of 3D view of the environment. (d) The configuration space and the generated paths is shown
in 2D view.

©Informatics '09, UM 2009 RDT1-37

 Proceeding of the 3rd International Conference on Informatics and Technology, 2009

In this experiment, the iteration process was run on Intel Core 2 Duo CPU running at 1.83GHz speed with 1GB of
RAM. The iteration process was only terminated when there was no more changes in temperature values, where it
converged to zero error solution. The highest precision of solution was required to avoid flat area that would cause
the path generation algorithm to fail to reach the goal point. Table 1 shows the number of iterations and period in
seconds required to compute all temperature values in the environment for the three numerical techniques. Clearly,
HSGS iterative method proved to be very fast compared to the standard iterative methods.

Once the temperature values were obtained, the path was generated by performing steepest descent search from
start points to goal point. In this experiment, all three paths were successfully generated. The process of generating
the paths was very fast. From the current point, the algorithm simply picked the lowest temperature value from its four
neighbourhood points. This process continues, until the generated path reaches the goal point.

Figure 3 (a) shows the actual temperature values obtained in the experiment. Almost all area is flat due to very small
difference in temperature values, except for the area close to the goal point. In Figure 3 (b) and 3 (c), the values for
obstacle and the generated paths are raised up for visualization purpose. The lowest temperature in Figure 3 (b) and
3 (c) indicates the goal point. The highest temperature values area in L shape indicates an obstacle. Figure 3 (d)
clearly shows the generated paths in 2D view.

The environment shown in Figure 3 represents an area of approximately 100x100 units. In Figure 3 (d), the three
boxes denote the starting points, whereas solid circle denotes goal point, and L shape denotes obstacle. The
somewhat jagged nature of the paths was due to the fact that no interpolation was performed here. Interpolation of
the gradient would provide smoother paths.

7.0 CONCLUSION

The experiment shows that HSGS iterative method proved to be very fast compared to the standard methods, such
as Jacobi and FSGS, in solving Laplace equation numerically. The HSGS iterative method performs 2x faster than
the FSGS and 4x faster than the Jacobi. Fast computation is very critical in the robotics path planning problem, since
it very common for the robot to operate in very large and sparse environment. Furthermore, the non occurrence of
local minima in solving path planning problem via Laplace’s equation is very attractive. Future work will investigate
the performance of more robust numerical method in solving path planning problem for larger scale environment. The
effect of having more obstacles in the environment will also be studied.

REFERENCES

[1] Connolly, C. I., & Gruppen, R. 1993. On the applications of harmonic functions to robotics. Journal of Robotic
Systems, 10(7): 931–946.
[2] Saudi, A. and Sulaiman, J. 2009. Efficient Weighted Block Iterative Method for Robot Path Planning Using
Harmonic Functions. In proc. of the 2nd International Conference on Control, Instrumentation and Mechatronic
Engineering (CIM09), Malacca, Malaysia, June 2-3, 2009.
[3] Saudi, A. and Sulaiman, J. 2009. Block Iterative Method for Robot Path Planning. The 2nd Seminar on
Engineering and Information Technology (SEIT2009), Kota Kinabalu, Malaysia, July 8-9, 2009.
[4] Ibrahim, A.. 1993. The Study of the Iterative Solution Of Boundary Value Problem by the Finite Difference
Methods. PhD Thesis. Universiti Kebangsaan Malaysia.
[5] Khatib, O. 1985. Real time obstacle avoidance for manipulators and mobile robots. IEEE Transactions on
Robotics and Automation 1:500–505.
[6] Koditschek, D. E. 1987. Exact robot navigation by means of potential functions: Some topological
considerations. Proceedings of the IEEE International Conference on Robotics and Automation: 1-6.
[7] Connolly, C. I., Burns, J. B., & Weiss, R. 1990. Path planning using Laplace’s equation. Proceedings of the
IEEE International Conference on Robotics and Automation: 2102–2106.
[8] Akishita, S., Kawamura, S., & Hayashi, K. 1990. Laplace potential for moving obstacle avoidance and
approach of a mobile robot. Japan-USA Symposium on flexible automation, A Pacific rim conference: 139–
142.
[9] Sasaki, S. 1998. A Practical Computational Technique for Mobile Robot Navigation. Proceedings of the IEEE
International Conference on Control Applications: 1323-1327.
[10] Abdullah, A.R.: The Four Point Explicit Decoupled Group (EDG) Method: A Fast Poisson Solver. International
Journal of Computer Mathematics 38, 61–70 (1991).
[11] Daily, R., & Bevly, D.M. 2008. Harmonic Potential Field Path Planning for High Speed Vehicles. In the
proceeding of American Control Conference, Seattle, June 11-13, 4609-4614.
[12] Ibrahim, A., Abdullah, A.R., : Solving the two-dimensional diffusion equation by the four point explicit
decoupled group (EDG) iterative method. International Journal Computer Mathematics, 58 (1995) 253-256.
[13] Yousif, W. S., Evans, D. J. : Explicit De-coupled Group iterative methods and their implementations. Parallel
Algorithms and Applications, 7 (2001) 53-71.
[14] Abdullah, A.R., Ali, N.H.M.: A Comparative Study of Parallel Strategies for the Solution of Elliptic PDE’s.
Parallel Algorithms and Aplications, 10 (1996) 93–103.

©Informatics '09, UM 2009 RDT1-38