More, the navigation planning procedure covers the environments structure and the propagate distances through free space from the source position. For any starting point within the environment representing the initial position of the mobile robot, the shortest path to the goal is traced. The algorithm described here therefore is to develop a method for navigation planning by using simple and computationally efficient-way to solve path planning problem in an unknown environment without consuming time, lose energy, un-safety of the robot architecture. The shortest path is obtained without collision. This proposed method has an advantage of adaptivity such that the algorithm works perfectly even if an environment is unknown.