The advancement of technology has led to a growing demand for autonomy across various sectors. A key aspect of achieving autonomous navigation through intricate environments is path planning, initially confined to 2D spaces but rapidly evolving to address the complexities of 3D environments. Despite the widespread adoption of RRT-based planners, their inherent lack of optimality has encouraged researchers to find refinements. This paper transposes an existing algorithm developed for 2D environments to 3D, leveraging a heuristic to optimize the generated paths in terms of path length, memory consumed, and execution time. Along with this scalability to 3D scenarios, a modification was introduced that trades off some execution time for a substantial improvement in path length. The results obtained from a series of simulated experimental tests prove the efficacy of the proposed method in 3D environments, demonstrating reduced memory consumption and execution time compared to conventional approaches.