Grasshopper optimization algorithm based path planning for autonomous mobile robot

نویسندگان

چکیده

Autonomous mobile robots have become very popular and essential in our life, especially industry. One of the crucial activities robot is planning path from a start point to target point, avoiding obstacles environment. Recently, received more attention, many methodologies been proposed. Path studies shown effectiveness swarm intelligence complex known or unknown environments. This paper presents global method based on grasshopper optimization algorithm (GOA) static improved using bias factor increase efficiency improve resulting path. The this further enhanced an version multinomial logistic regression (MLR). algorithms were evaluated three different large environments varying complexities. GOA has compared with ant colony (ACO) same experiments superiority terms time convergence cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

Cellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots

This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...

متن کامل

Memetic Algorithm Based Path Planning for a Mobile Robot

In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memetic algorithm. What is new in this work is a novel representation of solutions for evolutionary algorithms that is efficient, simple and also compatible with memetic algorithm. The new representation makes it possible ...

متن کامل

Path Planning for Autonomous Mobile Robot using Potential Field

The popularity of autonomous mobile robots have been rapidly increasing due to their new emerging application areas, from room cleaning, tourist guidance to space explorations. However, the development of a satisfactory control algorithm that will enable the autonomous mobile robots to navigate safely especially in dynamic environments is still an open research problem. In this paper, a newly p...

متن کامل

Mobile Robot Dynamic Path Planning Based on Genetic Algorithm

In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Electrical Engineering and Informatics

سال: 2022

ISSN: ['2302-9285']

DOI: https://doi.org/10.11591/eei.v11i6.4098