Advertisement

On Heading Change Measurement: Improvements for Any-Angle Path-Planning

  • Pablo Muñoz
  • María D. R-Moreno
Chapter
Part of the Studies in Computational Intelligence book series (SCI, volume 586)

Abstract

Finding the most efficient and safe path between locations is a ubiquitous problem that occurs in smart phone GPS applications, mobile robotics and even video games. Mobile robots in particular must often operate in any type of terrain. The problem of finding the shortest path on a discretized, continuous terrain has been widely studied, and many applications have been fielded, including planetary exploration missions (i.e. the MER rovers). In this chapter we review some of the most well known path-planning algorithms and we propose a new parameter that can help us to compare them under a different measure: the heading changes and to perform some improvements in any-angle path-planning algorithms. First, we define a heuristic function to guide the process towards the objective, improving the computational cost of the search. Results show that algorithms using this heuristic get better runtime and memory usage than the former ones, with a slightly degradation of other parameters such as path length. And second, we modify an any-angle path-planning algorithm to consider heading changes during the search in order to minimize them. Experiments show that this algorithm obtains smoother paths than the other algorithms tested.

Keywords

Cost Function Path Length Search Algorithm Goal Node Mobile Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

Pablo Muñoz is supported by the European Space Agency (ESA) under the Networking and Partnering Initiative (NPI) Cooperative systems for autonomous exploration missions. This work was supported by the Spanish Ministry of Economy and Competitiveness under the project TIN2014-56494-C4-4-P and the Junta de Comunidades de Castilla-La Mancha project PEII-2014-015-A.

References

  1. 1.
    S. Russell, P. Norvig, Artificial Intelligence: a Modern Approach (Morgan Kaufmann Publishers, 3 edn., 2009)Google Scholar
  2. 2.
    D. Higgins, AI Game Programming Wisdom, chapter 3.3 (Charles River Media, 2002)Google Scholar
  3. 3.
    E. Dijkstra, A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    P. Hart, N. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths. IEEE Transac. Syst. Sci. Cybern. 4, 100–107 (1968)CrossRefGoogle Scholar
  5. 5.
    I. Millington, J. Funge, Artificial Intelligence for Games (Morgan Kaufmann Publishers, 2 edn., 2009)Google Scholar
  6. 6.
    A. Botea, M. Muller, J. Schaeffer, Near optimal hierarchical path-finding. J. Game Dev. 1, 1–22 (2004)Google Scholar
  7. 7.
    D. Ferguson, A. Stentz. Field D*: an interpolation-based path planner and replanner, in Proceedings of the International Symposium on Robotics Research (ISRR) (October 2005)Google Scholar
  8. 8.
    G. Ayorkor, A. Stentz, M. B. Dias, Continuous-field path planning with constrained path-dependent state variables, in ICRA 2008 Workshop on Path Planning on Costmaps (May 2008)Google Scholar
  9. 9.
    A. Nash, K. Daniel, S. Koenig, A. Felner. Theta*: any-angle path planning on grids, in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1177–1183 (2007)Google Scholar
  10. 10.
    K. Daniel, A. Nash, S. Koenig, A. Felner, Theta*: any-angle path planning on grids. J. Artif. Intell. Res. 39, 533–579 (2010)MathSciNetzbMATHGoogle Scholar
  11. 11.
    S. Choi, J.Y. Lee, and W. Yu. Fast any-angle path planning on grid maps with non-collision pruning. In IEEE International Conference on Robotics and Biomimetics, pages 1051–1056, Tianjin, China, December 2010Google Scholar
  12. 12.
    P. Yap, Grid-based path-finding, in Advances in Artificial Intelligence, vol. 2338 of Lecture Notes in Computer Science, pp. 44–55 (Springer, Berlin, 2002)Google Scholar
  13. 13.
    M. Kanehara, S. Kagami, J. Kuffner, S. Thompson, H. Mizoguhi. Path shortening and smoothing of grid-based path planning with consideration of obstacles, in IEEE International Conference on Systems, Man and Cybernetics, ISIC, pp. 991–996 (October 2007)Google Scholar
  14. 14.
    C. E. Thorpe, L.H. Matthies. Path relaxation: path planning for a mobile robot, in OCEANS Conference, pp. 576–581 (September 1984)Google Scholar
  15. 15.
    P. Muñoz, M. D. R-Moreno, Improving efficiency in any-angle path-planning algorithms, in 6th IEEE International Conference on Intelligent Systems (IEEE-IS), pp. 213–218 (Sofia, Bulgaria, September 2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Departamento de AutomáticaUniversidad de AlcaláAlcalá de HenaresSpain

Personalised recommendations