Metaheuristic optimization approach to mobile robot path planning

Ahmed Hussein*, Heba Mostafa, Mohamed Badrel-Din, Osama Sultan, Alaa Khamis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

49 Scopus citations

Abstract

This paper presents a metaheuristic optimization-based approach to mobile robot path planning problem. A comparative study between trajectory-based metaheuristic optimization and population-based metaheuristic optimization is conducted. Breadth-first deterministic search is used to find the optimal solution (ground truth) that is compared to the paths generated by tabu search, simulated annealing and genetic algorithm. The experimental study shows that simulated annealing outperforms the other algorithms in terms of computational time while tabu search gives the shortest path.

Original languageEnglish
Title of host publicationInternational Conference on Engineering and Technology, ICET 2012 - Conference Booklet
DOIs
StatePublished - 2012
Externally publishedYes

Publication series

NameInternational Conference on Engineering and Technology, ICET 2012 - Conference Booklet

Keywords

  • Genetic Algorithm
  • Mobile robots
  • Path Planning
  • Simulated Annealing
  • Stochastic Optimization
  • Tabu Search

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Metaheuristic optimization approach to mobile robot path planning'. Together they form a unique fingerprint.

Cite this