The problem of path planning for a mobile robot has been studied extensively in recent literature. Much of the work in this area is devoted to the study of path planning for an earth-bound robot in two dimensions. In this paper, we explore the problem for a robot that can fly in three dimensional space or crawl on 3D surfaces or use a combination of both. We assume that the obstacles can be modeled as polyhedral objects.