Static indoor pathfinding with explicit group two-parameter over relaxation iterative technique

A solution to Laplace’s equation referred to as harmonic potential fields is commonly employed in robot pathfinding as an indication for robot navigation in an identifiable environment. The simulations computation of these harmonic functions frequently requires a high-performance computer. In the quest to address the pathfinding problem, the article presents a technique called Block Two-Parameter Over-Relaxation, otherwise known as Explicit Group Two-Parameter Over-Relaxation (EGTOR). The simulations of robot pathfinding were executed in a static known enclosed environment to validate the competency of EGTOR. Multiple tests are provided to assess the effectiveness of the suggested technique. Different departure and goal positions, in particular, are used to assess the paths generated by the simulations. The outcomes demonstrate the advantages of the proposed technique. In the context of iteration number, EGTOR improves by around 4.4% when compared to EGAOR and 17.1% in comparison with EGSOR. While as to computational timing, EGTOR outperforms EGAOR and EGSOR by 6.3% and 14.5%, respectively. The study concludes that the suggested method in computing harmonic functions is appealing and attainable for solving path planning problems.