Heuristic search algorithms, including D*, D* Lite, LPA*, LRTA*, RTAA*, and ARA*, are analyzed in different grid environments.The impact of obstacle density and grid size on algorithm performance is assessed.Two types of grid environments are used: randomly generated and personalized.Performance metrics include path cost, memory consumption, and solving time.