The K-Framed Quadtrees Approach for Path Planning Through a Known Environment

One of the most important tasks for a mobile robot is to navigate in an environment. The path planning is required to design the trajectory that generates useful motions from the original to the desired position. There are several methodologies to perform the path planning. In this paper, a new method of approximate cells decomposition, called K-Framed Quadtrees is present, to which the algorithm A\(\star \) is applied to determine trajectories between two points. To validate the new approach, we made a comparative analysis between the present method, the grid decomposition, quadtree decomposition and framed quadtree decomposition. Results and implementation specifications of the four methods are presented.