Aiming at the problems of premature convergence and long time-consuming in traditional path planning of mobile robots, a bidirectional path planning method based on an improved genetic algorithm was designed. Firstly, an environment map is established, and the physical space is abstracted into an abstract space that can be processed by the path planning algorithm by using the grid method. Then, simulated annealing algorithm is used to improve the population selectivity and diversity; and indicators such as path tortuosity are added to the fitness function, and two-way search rules are added and set. Improve the smoothness of the path of the mobile robot, making it easier to drive. And using matlab for simulation verification, the results show that compared with the classical genetic algorithm, the improved algorithm is more efficient in mobile robot path planning.
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.