Article detail · 2016 · article
A Hybrid Genetic Algorithm for Mobile Robot Shortest Path Problem
Data source split
- YÖKSİSYÖKSİS article record
- YÖKSİS venueInternational Journal of Intelligent Systems andApplications in Engineering
- Catalog match (ISSN)International Journal of Intelligent Systems and Applications in Engineering (discontinued)
- OpenAlexOpenAlex enrichment (abstract, citations, topics)
Abstract
This paper proposes an algorithm to solve the problem of shortest path planning for a mobile robot in a static environment with obstacles. The proposed algorithm is a Hybrid Genetic Algorithm (HGA) which includes Genetic and Dijkstra Algorithms together. The Genetic Algorithm (GA) is preferred since the structure of robot path planning problem is very convenient to apply genetic algorithm’s coding and operators such as permutation coding, crossover and mutation. GA provides diversification while searching possible global solutions, but Dijkstra Algorithm (DA) makes more and more intensification in local solutions. The simulation results show that the mobile robot can plan a set of optimized path with an efficient algorithm.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
7citationsOpenAlex · cited_by_count (cache / database)
1 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).