Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Aided Systems Theory

EUROCAST 2013: Computer Aided Systems Theory - EUROCAST 2013 pp 39–46Cite as

Comparison of Local Obstacle Avoidance Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8112))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borenstein, J., Koren, Y.: Real-time obstacle avoidance for fast mobile robots in cluttered environments. IEEE Transactions on Systems, Man, and Cybernetics 19, 1179–1187 (1990)

    Article  Google Scholar 

  2. Ulrich, I., Borenstein, J.: Vfh+: Reliable obstacle avoidance for fast mobile robots. In: ICRA, pp. 1572–1577 (1998)

    Google Scholar 

  3. Durham, J.W., Bullo, F.: Smooth nearness-diagram navigation. In: IROS, pp. 690–695 (2008)

    Google Scholar 

  4. Fernandez, J., Sanz, R., Benayas, J.A., Diéguez, A.R.: Improving collision avoidance for mobile robots in partially known environments: the beam curvature method. Robotics and Autonomous Systems 46 (2004)

    Google Scholar 

  5. Simmons, R.: The curvature-velocity method for local obstacle avoidance. In: International Conference on Robotics and Automation (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics, University of Alcalá, Madrid, Spain

    E. Molinos, J. Pozuelo, A. Llamazares & M. Ocaña

  2. System Engineering Department, University of Vigo, Spain

    J. López

Authors
  1. E. Molinos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Pozuelo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Llamazares
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Ocaña
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. López
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidad de Las Palmas de Gran Canaria, Instituto Universitario de Ciencias y Tecnologías Cibernéticas, Campus de Tafira, 35017, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz  & Alexis Quesada-Arencibia  & 

  2. Johannes Kepler Universität Linz, Altenbergerstrasse 69, 4040, Linz, Austria

    Franz Pichler

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molinos, E., Pozuelo, J., Llamazares, A., Ocaña, M., López, J. (2013). Comparison of Local Obstacle Avoidance Algorithms. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53862-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53862-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53861-2

  • Online ISBN: 978-3-642-53862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation