1. Choset, H., Lynch, K. M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L. E., et al. (2005). Principles of robot motion: Theory, algorithms, and implementation. Cambridge: MIT Press.
2. LaValle, S. (2006). Planning algorithms. Cambridge: Cambridge University Press.
3. Ivanov, M., Lindner, L., Sergiyenko, O., Rodríguez-Quiñonez, J. C., Flores-Fuentes, W., & Rivas-Lopez, M. (2019). Mobile robot path planning using continuous laser scanning (pp. 338–372). Hershey: IGI Global.
4. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968, July). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100–107.
5. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. Available:
http://dx.doi.org/10.1007/BF01386390