Cart (Loading....) | Create Account
Close category search window

An improved genetic algorithm for mobile robotic path planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhou Yongnian ; Shanghai Inst. of Appl. Phys., Shanghai, China ; Zheng Lifang ; Li Yongping

Proposed an improved genetic algorithm based on rough sets reduction theory, optimized the genetic operators, and overcame the weakness of the traditional genetic algorithm, such as huge number of initial population and slow velocity of optimization and convergence. The experiments both in simple and complex environment have been carried on. The simulation result indicated that the method can reduce the scale of the population, minimize the searching scope, and improve the velocity of the convergence and optimization for the mobile robotic path planning.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.