Author:
Bóveda Silvia Abalo,Gónzález Andrés Ferreiro,Terrón Lucas Val,Artolazábal José Antonio Rodríguez,Negro José Antonio Rodríguez
Publisher
Springer Nature Switzerland
Reference60 articles.
1. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
2. Karur, K., Sharma, N., Dharmati, C., & Siegel, J. E. (2021). A survey of path planning algorithms for mobile robots. Vehicles, 3(3), 448–468.
3. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100–107.
4. LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report. Iowa State University.
5. Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566–580.