The following paper addresses the problem of applying existing path planning methods targeting rough terrains. Most path planning methods for mobile robots divide the environment in two areas—free and occupied —and restrict the path to lie within the free space. The presented solution addresses the problem of path planning on rough terrains, where the local shape of the environment are used to both constrain and optimize the resulting path. Finding both the feasibility and the cost of the robot crossing the terrain at a given point is cast as an optimization problem. Intuitively, this problem models dropping the robot at a given location (x,y) and determining the minimal potential energy pose (attitude angles and the distance of the centre of mass to the ground). We then applied two path planning methods for computing a feasible path to a given goal: Fast Marching Method (FMM) and Rapidly exploring Random Tree (RRT). Processing the whole mapped area, determining the cost of every cell