This paper investigates reducing unnecessary node expansion in A path planning through machine-learning-guided predictive search corridors. While A guarantees optimal paths with an admissible heuristic, its computational cost increases as graph size and search complexity grow.