Paper
12 October 2020 An improved genetic algorithm for mobile robot path planning in grid environment
Author Affiliations +
Proceedings Volume 11574, International Symposium on Artificial Intelligence and Robotics 2020; 115740K (2020) https://doi.org/10.1117/12.2576111
Event: International Symposium on Artificial Intelligence and Robotics (ISAIR), 2020, Kitakyushu, Japan
Abstract
This paper proposes an improved genetic algorithm to study the path planning of mobile robot in grid environment. First, rasterize the motion plane of the robot, use serial number coding method and design a heuristic median insertion method to establish the initial population, ensure that the planned initial paths are all feasible paths, thereby speeding up the convergence of the algorithm. Then assign different weights to the path length, path security, and path energy consumption and combine them to generate a multi-objective fitness function. Finally, improve some genetic operations to maintain the population diversity of the algorithm in the later period, and avoid the algorithm from falling into avoid premature. Simulation experiments show that the proposed algorithm can quickly plan a feasible path in the grid environment. The path is not only shorter in length, but also more stable. At the same time, the running speed of the algorithm is 45.7% higher than other improved algorithms.
© (2020) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qianqian Hu and Kairong Li "An improved genetic algorithm for mobile robot path planning in grid environment", Proc. SPIE 11574, International Symposium on Artificial Intelligence and Robotics 2020, 115740K (12 October 2020); https://doi.org/10.1117/12.2576111
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Mobile robots

Algorithm development

Nickel

Genetics

Detection and tracking algorithms

Safety

RELATED CONTENT


Back to Top