By Topic

Optimal path planning in Rapid Prototyping based on genetic algorithm

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

1 Author(s)
Yang Weidong ; Sch. of Mech. Eng., Hebei Univ. of Technol., Tianjin, China

One of important researches in rapid prototyping (RP) is to optimize the path planning which affects the efficiency and building quality of RP system. But it is very difficult to solve its optimization by traditional methods. Genetic algorithms (GAs) are excellent approaches to solving these complex problems in optimization with difficult constraints. The classic path-planning optimization problem has been shown to be a NP-complete problem. To obtain optimized boundary path result, a genetic algorithm (GA) is developed and implemented. The GA features optimized chromosome code, constrained crossover operator, constrained mutation operator and fitness evaluation function. Finally, experiments of the optimized boundary path based on the GA are conducted with satisfactory results.

Published in:

Control and Decision Conference, 2009. CCDC '09. Chinese

Date of Conference:

17-19 June 2009