Localization and navigation are the two most important tasks for mobile robots. We want to know where we are, and we need to be able to make a plan for how to reach a goal destination. Of course these two problems are not isolated from each other, but rather closely linked. If a robot does not know its exact position at the start of a planned trajectory, it will encounter problems in reaching the destination.
After a variety of algorithmic approaches were proposed in the past for localization, navigation, and mapping, probabilistic methods that minimize uncertainty are now applied to the whole problem complex at once (e.g. SLAM, simultaneous localization and mapping).
In this Chapter, we will look at navigation algorithms that operate with or without maps. A navigation algorithm without a map (e.g. DistBug) is often used in a continuously changing environment or if a path has to be traveled only once and therefore does not necessarily have to be optimal. If a map is provided, then algorithms like Dijkstra or A* can be applied to find the shortest path offline before the robot starts driving. Navigation algorithms without maps operate in direct interaction with the robot’s sensors while driving. Navigation algorithms with maps require a nodal distance graph that has to be either provided or needs to be extracted from the environment (e.g. Quadtree method).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
16.12 References
Arbib, M., House, D. Depth and Detours: An Essay on Visually Guided Be-havior, in M. Arbib, A. Hanson (Eds.), Vision, Brain and Cooperative Computation, MIT Press, Cambridge MA, 1987, pp. 129-163 (35)
Arkin, R. Behavior-Based Robotics, MIT Press, Cambridge MA, 1998
Bicchi, A., Casalino, G., Santilli, C. Planning Shortest Bounded-Curvature Paths, Journal of Intelligent and Robotic Systems, vol. 16, no. 4, Aug. 1996, pp. 387-405 (9)
Borenstein, J., Everett, H., Feng, L. Navigating Mobile Robots: Sensors and Techniques, AK Peters, Wellesley MA, 1998
Choset H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kav-Raki, L., Thrun, S. Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press, Cambridge MA, 2005
Craig, J. Introduction to Robotics - Mechanics and Control, 2nd Ed., Addison-Wesley, Reading MA, 1989
Delaunay, B. Sur la sphère vide, Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk, vol. 7, 1934, pp. 793-800 (8)
Dijkstra, E. A note on two problems in connexion with graphs, Numerische Mathematik, Springer-Verlag, Heidelberg, vol. 1, pp. 269-271 (3), 1959
Dirichlet, G. Ăœber die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen, Journal fĂ¼r die Reine und Angewandte Mathematik, vol. 40, 1850, pp. 209-227 (19)
Hart, P., Nilsson, N., Raphael, B. A Formal Basis for the Heuristic Deter-mination of Minimum Cost Paths, IEEE Transactions on Systems Sci-ence and Cybernetics, vol. SSC-4, no. 2, 1968, pp. 100-107 (8)
Hopcroft, J., Schwartz, J., Sharir, M. Planning, geometry, and complexity of robot motion, Ablex Publishing, Norwood NJ, 1987
Kamon, I., Rivlin, E. Sensory-Based Motion Planning with Global Proofs, IEEE Transactions on Robotics and Automation, vol. 13, no. 6, Dec. 1997, pp. 814-822 (9)
Koren, Y., Borenstein, J. Potential Field Methods and Their Inherent Limi-tations for Mobile Robot Navigation, Proceedings of the IEEE Conference on Robotics and Automation, Sacramento CA, April 1991, pp. 1398-1404 (7)
Lengyel, J., Reichert, M., Donald, B., Greenberg, D. Real-time robot mo-tion planning using rasterizing computer graphics hardware, Proceed-ings of ACM SIGGRAPH 90, Computer Graphics vol. 24, no. 4, 1990, 327-335 (9)
Lumelsky, V., Stepanov, A. Dynamic Path Planning for a Mobile Automaton with Limited Information on the Environment, IEEE Transactions on Automatic Control, vol. 31, Nov. 1986, pp. 1058-1063 (6)
Ng, J., Bräunl, T. Performance Comparison of Bug Navigation Algorithms, Journal of Intelligent and Robotic Systems, Springer-Verlag, no. 50, 2007, pp. 73-84 (12)
Puttkamer, E. Von. Autonome Mobile Roboter, Lecture notes, Univ. Kaisers-lautern, Fachbereich Informatik, 2000
Voronoi, G. Nouvelles applications des paramètres continus Ă la thĂ©orie des formes quadratiques, Journal fĂ¼r die Reine und Angewandte Mathe-matik, vol. 133, 1907, pp. 97-178 (82)
Yahja, A., Stentz, A., Singh, S., Brummit, B. Framed-Quadtree Path Plan-ning for Mobile Robots Operating in Sparse Environments, IEEE Conference on Robotics and Automation (ICRA), Leuven Belgium, May 1998, pp. (6)
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Localization and Navigation. In: Embedded Robotics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70534-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-70534-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70533-8
Online ISBN: 978-3-540-70534-5
eBook Packages: Computer ScienceComputer Science (R0)