Relative Content

Tag Archive for algorithmgraph-theorycomputational-geometrypath-finding

Are there effective any-angle pathfinding algorithms for infinite weighted grids?

I am developing a game that involves pathfinding on terrain where different surfaces have different movement costs (e.g., snow, mud, etc.). I need an any-angle pathfinding algorithm that works efficiently on an infinite weighted grid with these varying terrain costs. The goal is to find the shortest path that accounts for the weights of each type of terrain.