Pathfinding for Mobile Robot Navigation by Exerting the Quarter-Sweep Modified Accelerated Overrelaxation (QSMAOR) Iterative Approach via the Laplacian Operator

Algorithm 1

Begin

 Step 1: Mapping the configuration spaces (known grid space containing the goal

         position, obstacles, and walls, which are based upon [15]).

 Step 2: Formulation and modelling the finite difference method of proposed iterative

        schemes.

 Step 3: Algorithm of the proposed iterative schemes.

 Step 4: Numerical solution.

 Step 5: Evaluation and analysis.

End