Abstract
There are several algorithms to avoid local obstacles for mobile robots. Usually, these algorithms use only the information provided by range sensors. The goal of this paper is to compare some of these algorithms, from classic to modern ones, in order to evaluate the strengths and weakness of each one. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Molinos, E., Pozuelo, J., Llamazares, A., Ocaña, M., & López, J. (2013). Comparison of local obstacle avoidance algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8112 LNCS, pp. 39–46). Springer Verlag. https://doi.org/10.1007/978-3-642-53862-9_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
