Abstract
With the extensive developments in autonomous vehicles (AV) and the increase of interest in artificial intelligence (AI), path planning is becoming a focal area of research. However, path planning is an NP-hard problem and its execution time and complexity are major concerns when searching for optimal solutions. Thus, the optimal trade-off between the shortest path and computing resources must be found. This paper introduces a path planning algorithm, tide path planning (TPP), which is inspired by the natural tide phenomenon. The idea of the gravitational attraction between the Earth and the Moon is adopted to avoid searching blocked routes and to find a shortest path. Benchmarking the performance of the proposed algorithm against rival path planning algorithms, such as A*, breadth-first search (BFS), Dijkstra, and genetic algorithms (GA), revealed that the proposed TPP algorithm succeeded in finding a shortest path while visiting the least number of cells and showed the fastest execution time under different settings of environment size and obstacle ratios.