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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.