Robot Path Planning Using Grasshopper Optimization Algorithm

Authors

  • Tohid Yousefi Dokuz Eylül University
  • Özlem Aktaş Dokuz Eylül University

DOI:

https://doi.org/10.59287/as-proceedings.449

Keywords:

Grasshopper Optimization Algorithm, Meta-heuristic algorithms, Optimization, Particle Swam Optimization, Robot Path Planning

Abstract

In the world of mobile robots, figuring out the best path is a big deal. Robots use specific plans to move from one point to another. The main aim of path planning is to find safe moves for the robot in places full of obstacles. These moves create a smooth, collision-free path from where the robot starts to its target. There are many ways to solve this path problem, but they're not perfect yet. Recently, researchers have turned to smart methods, called meta-heuristic methods, to solve these problems. In our study, we tried out the particle swarm optimization algorithm (PSO) and the grasshopper optimization algorithm (GOA). Looking at the results, we found that PSO had a best cost value of 7.5558, and GOA had a best cost value of 7.5421. This shows how good the grasshopper optimization algorithm is at path planning and how effective these meta-heuristic methods can be.

Author Biographies

Tohid Yousefi, Dokuz Eylül University

Computer Engineering, Graduate School of Natural and Applied Sciences, Turkey

Özlem Aktaş, Dokuz Eylül University

Computer Engineering Department, Engineering Faculty, Turkey

Downloads

Published

2023-12-11

How to Cite

Yousefi, T., & Aktaş, Özlem. (2023). Robot Path Planning Using Grasshopper Optimization Algorithm. AS-Proceedings, 1(6), 105–112. https://doi.org/10.59287/as-proceedings.449