International Research Journal of Innovations in Engineering and Technology - IRJIET International Open Access, Monthly, Peer Reviewed, Reputed Journal ISSN (online): 2581-3048

Impact Factor (2025): 6.9

DOI Prefix: 10.47001/IRJIET

Combining Algorithm Classes for Navigation Tasks of Mobile Robots

Zlata JelacicAssistant Professor, Faculty of Mechanical Engineering, University of Sarajevo, Bosnia and Herzegovina

Vol 3 No 11 (2019): Volume 3, Issue 11, November 2019 | Pages: 19-25

International Research Journal of Innovations in Engineering and Technology

OPEN ACCESS | Research Article | Published Date: 14-11-2019

doi Logo

pdf iconFull Text PDF
Abstract

A motion planner for mobile robots is commonly built out of a number of different algorithms that solve the two steps of motion planning: representing the robot and its environment and searching a path through the represented environment. However, the available literature on motion planning lacks a generic methodology to arrive at a combination of representations and search algorithm classes for a practical application. This paper presents a recipe to select appropriate algorithm classes that solve both steps of motion planning and to select a suitable approach to combine those algorithm classes. The recipe is verified by comparing its outcome to the motion planners that has been successfully applied on robots in practice.

Keywords

service robots, motion planning, mobile robots, algorithm classes, representation classes


Citation of this Article

Zlata Jela?i?, “Combining Algorithm Classes for Navigation Tasks of Mobile Robots” Published in International Research Journal of Innovations in Engineering and Technology (IRJIET), Volume 3, Issue 11, pp 19-25, November 2019.

Licence Copyright (c) 2026 International Research Journal of Innovations in Engineering and Technology creative common licence This work is licensed under Creative common Attribution Non Commercial 4.0 Internation Licence
References
  1. Hwang Y, Ahuja N (1992) Gross motion planning - a survey. ACM Computing Surveys 24(3):219-291.
  2. Latombe J (1990) Robot motion planning. Springer.
  3. Choset H (2005) Principles of robot motion: theory, algorithms, and implementation. MIT Press.
  4. LaValle S (2006) Planning algorithms. Cambridge University Press.
  5. Kant K, Zucker SW (1986) Toward efficient trajectory planning: The path-velocity decomposition. International Journal of Robotics Research 5(3):72-89.
  6. Brock O, Khatib O (1999) High-speed navigation using the global dynamic window approach. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol 1, pp 341-346.
  7. Goerzen C, Kong Z, Mettler B (2010) A survey of motion planning algorithms from the perspective of autonomous UAV guidance. Journal of Intelligent & Robotic Systems 57(1-4):65-100.
  8. Canny JF (1988) Complexity of robot motion planning. MIT press.
  9. Ferguson D, Likhachev M, Stentz A (2005) A guide to heuristic-based path planning. In: Workshop on Planning under Uncertainty for Autonomous Systems at International Conference on Automated Planning and Scheduling.
  10. Giesbrecht J (2004) Global path planning for unmanned ground vehicles. Tech. Rep.DRDC`Suffield TM 2004-272, Defence R&D Canada – Suffield.
  11. Laumond JP, Nissoux C (2000) Visibility-based probabilistic roadmaps for motion planning. Advanced Robotics 14(6):477-493.
  12. Dadkhah N, Mettler B (2012) Survey of motion planning literature in the presence of uncertainty: considerations for UAV guidance. Journal of Intelligent & Robotic Systems pp 1-14.
  13. Thrun S, Bennewitz M, Burgard W, Cremers AB, Dellaert F, Fox D, Hahnel D, Rosenberg C, Roy N, Schulte J, et al (1999) MINERVA: A second-generation museum tour-guide robot. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol 3.
  14. Stachniss C, Burgard W (2002) An integrated approach to goal-directed obstacle avoidance under dynamic constraints for dynamic environments. In: IEEE/RSJ Int. Conf. on Intell. Robots and Systems, vol 1, pp 508-513.
  15. Hsu D, Kindel R, Latombe JC, Rock S (2002) Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research 21(3):233-255.
  16. van den Berg J, Ferguson D, Kuffner J (2006) Anytime path planning and replanning in dynamic environments. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp 2366-2371.
  17. Dolgov D, Thrun S, Montemerlo M, Diebel J (2008) Practical search techniques in path planning for autonomous driving. Ann Arbor 1001.
  18. Marder-Eppstein E, Berger E, Foote T, Gerkey B, Konolige K (2010) The office marathon: Robust navigation in an indoor office environment. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp 300-307.
  19. Donald B, Xavier P, Canny J, Reif J (1993) Kinodynamic motion planning. Journal of the Association for Computing Machinery 40(5):1048-1066.
  20. Pivtoraiko M, Knepper RA, Kelly A (2009) Differentially constrained mobile robot motion planning in state lattices. Journal of Field Robotics 26(3):308-333.
  21. Fraichard T (1998) Trajectory planning in a dynamic workspace: a `state-time space' approach. Advanced Robotics 13(1):75-94.
  22. Ratliff N, Zucker M, Bagnell J, Srinivasa S (2009) CHOMP: Gradient optimization techniques for efficient motion planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp 489-494.
  23. Kalakrishnan M, Chitta S, Theodorou E, Pastor P, Schaal S (2011) STOMP: Stochastic trajectory optimization for motion planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp 4569-4574.
  24. Zhang H, Butzke J, Likhachev M (2012) Combining global and local planning with guarantees on completeness. In: IEEE International Conference on Robotics and Automation, pp 4500 -4506.
  25. Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research 5(1):90.
  26. Fiorini P, Shiller Z (1998) Motion planning in dynamic environments using velocity obstacles. International Journal of Robotics Research 17(7):760-772.
  27. Fox D (2001) KLD-sampling: Adaptive particle filters and mobile robot localization. Advances in Neural Information Processing Systems 14(1):26-32.
  28. Ogren P, Leonard NE (2005) A convergent dynamic window approach to obstacle avoidance. IEEE Transactions on Robotics 21(2):188-195.
  29. Minguez J, Montano L (2000) Nearness diagram navigation (ND): a new real time collision avoidance approach. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, vol 3, pp 2094-2100.
  30. Minguez J, Montesano L, Montano L (2004) An architecture for sensor-based navigation in realistic dynamic and troublesome scenarios. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, vol 3, pp 2750-2756, Maravall.
  31. Philippsen R, Kolski S, Macek K, Jensen B (2008) Mobile robot planning in dynamic environments and on growable costmaps. In: Workshop on Planning with Cost Maps at the IEEE International Conference on Robotics and Automation.
  32. Quinlan S, Khatib O (1993) Elastic bands: connecting path planning and control. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol 2, pp 802-807.
  33. Zavlangas P, Tzafestas S (2002a) Integration of topological and metric maps for indoor mobile robot path planning and navigation. Methods and applications of artificial intelligence pp746-746.
  34. Urmson C, Anhalt J, Bagnell D, Baker C, Bittner R, Clark M, Dolan J, Duggins D, Galatali T, Geyer C, et al (2008) Autonomous driving in urban environments: Boss and the urban challenge. Journal of Field Robotics 25(8):425-466.
  35. Martinez-Barbera H, Herrero-Perez D (2010) Autonomous navigation of an automated guided vehicle in industrial environments. Robotics and Computer-Integrated Manufacturing 26(4):296-311.

Copyright @ 2026 IRJIET. All Right Reserved.

Licensed underCreative Commons Attribution 4.0 International License.