TWO-STAGE ALGORITHM FOR PATH PLANNING PROBLEM WITH OBSTACLE AVOIDANCE

Mustafa Dogan, Nizami Gasilov

Abstract

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.

References

  1. Connoly, C. I., Burns, J. B., and Weiss, R., 1991. Path planning using Laplace's equation. Proc. IEEE Int. Conf. Robot. Automat., vol. 1, pp. 2102-2106.
  2. Rimon, E., and Koditschek, D. E., 1992. Exact robot navigation using artificial potential functions. IEEE Transactions on Robotics and Automation, vol. 8, pp. 501-518.
  3. Kavraki, L. E., Kolountzakis, M. L., and Latombe, J. C., 1998. Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Robotics and Automation, vol. 14, no. 1, pp. 166-171
  4. Kavraki, L. E., Svestka, P., Latombe, J. C., and Overmars, M. H., 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, vol. 12, no. 4, 566-580.
  5. Helgason, R. V., Kennington, J. L., and Lewis, K. R., 2001. Cruise missile mission planning: a heuristic algorithm for automatic path generation, Journal of Heuristics, Kluwer Academic Publishers, vol. 7, pp. 473-494.
  6. Liu, Y. H., and Arimoto, S., 1992. Path planning using a tangent graph for mobile robots among polygonal and curved obstacles. Int. J. Robot. Res., vol. 11, no. 4, pp. 376-382.
  7. Dreyfus, S., 1965. Dynamic Programming and the Calculus of Variations. New York, London: Academic.
  8. Moskalenko, A. I., 1967. Bellman equations for optimal processes with constraints on the phase coordinates. Autom. Remote Cont. (Translation of Avtomatika i Telemekhanika), vol. 4, pp. 1853-1864.
  9. Sundar, S., and Shiller, Z., 1997. Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation. IEEE Transactions on Robotics and Automation, vol. 13, no. 2, pp. 305-310.
  10. Anderson, J. A., 2004. Discrete Mathematics with Combinatorics, 2nd Ed. Prentice Hall.
  11. Dechter, R., and Pearl, J., 1985. Generalized best-first search strategies and the optimality of A*. Journal of the ACM, vol. 32, pp. 505 - 536.
  12. Hart, P. E., Nilsson, N. J., and Raphael, B., 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, vol. SSC-4, no. 2, pp. 100-107.
  13. Hart, P. E., Nilsson, N. J., and Raphael, B., 1972. Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newsletter, no. 37, pp. 28-29.
  14. Nilsson, N. J., 1980. Principles of artificial intelligence. Palo Alto: Tioga.
  15. Bruce, J. R., and Veloso, M. M., 2006. Safe multi-robot navigation within dynamic constraints. Proceedings of the IEEE, vol. 94, no. 7, pp. 1398-1411.
  16. Chuang, J.-H., 1998. Potential-based modeling of threedimensional workspace for obstacle avoidance. IEEE Transactions on Robotics and Automation, vol. 14, no. 5, pp. 778-785.
  17. Chuang, J.-H., and Ahuja, N., 1998. An analytically tractable potential field model of free space and its application in obstacle avoidance. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, vol. 28, no. 5, pp. 729-736.
  18. Ren, J., McIsaac, K. A., and Patel, R. V., 2006. Modified Newton's method applied to potential field-based navigation for mobile robots. IEEE Transactions on Robotics, vol. 22, no. 2, pp. 384-391.
  19. Cowan, N. J., 2007. Navigation functions on cross product spaces. IEEE Transactions on Automatic Control, vol. 52, no. 7, pp. 1297-1302.
Download


Paper Citation


in Harvard Style

Dogan M. and Gasilov N. (2009). TWO-STAGE ALGORITHM FOR PATH PLANNING PROBLEM WITH OBSTACLE AVOIDANCE . In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-674-000-9, pages 165-170. DOI: 10.5220/0002185001650170


in Bibtex Style

@conference{icinco09,
author={Mustafa Dogan and Nizami Gasilov},
title={TWO-STAGE ALGORITHM FOR PATH PLANNING PROBLEM WITH OBSTACLE AVOIDANCE},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2009},
pages={165-170},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002185001650170},
isbn={978-989-674-000-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - TWO-STAGE ALGORITHM FOR PATH PLANNING PROBLEM WITH OBSTACLE AVOIDANCE
SN - 978-989-674-000-9
AU - Dogan M.
AU - Gasilov N.
PY - 2009
SP - 165
EP - 170
DO - 10.5220/0002185001650170