Two-stage algorithm for path planning problem with obstacle avoidance

Doğan M., Gasilov N.

ICINCO 2009 - 6th International Conference on Informatics in Control, Automation and Robotics, Milan, Italy, 2 - 05 July 2009, vol.2 RA, pp.165-170 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 2 RA
  • City: Milan
  • Country: Italy
  • Page Numbers: pp.165-170
  • Keywords: Dijkstra's algorithm, Graph theory, Obstacle avoidance, Path planning
  • Istanbul Technical University Affiliated: No


The path-planning problem is considered for mobile robot inside environment with motionless circular obstacles in different sizes. The robot is expected to reach a given target by following the shortest path and avoiding the obstacles. The two-stage algorithm is proposed to solve the problem numerically. In the first stage a line-arc based path is found by using geometric techniques. This path cannot be minimal. However, its length can be used to restrict search space to an ellipse, which contains the minimal path. Thus, the reduced search space makes the next stage more efficient and endurable for real-time applications. In the second stage of the algorithm, by discretization of the restricted elliptic region the problem results in finding the shortest path in a graph and is solved by using the Dijkstra's algorithm. The proposed two-stage algorithm is verified with numerical simulations. The results show that the proposed algorithm is successful for obtaining an optimal solution. The applicability of the proposed algorithm is validated by practical experiment.