By Topic

Mobile Robot Path Planning with Complex Constraints Based on the Second-Order Oscillating Particle Swarm Optimization 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

3 Author(s)
Qianzhi Ma ; Coll. of Comput. Sci., Shaanxi Normal Univ., Xi''an, China ; Xiujuan Lei ; Qun Zhang

According to the low efficiency of particle swarm optimization algorithm applied in mobile robot path planning with complex constraints, a novel boundary constraints handling mechanism was put forward through analyzing the type of constraints. In addition, the path planning method based on second-order oscillating particle swarm optimization (SOPSO) was proposed to improve the properties of solutions, in which the searching ability of particles was enhanced by controlling the process of oscillating convergence and asymptotic convergence. A comparison of the results was made by simple PSO, standard PSO, chaotic particle swarm optimization (CPSO) and SOPSO, which showed that SOPSO has the highest efficiency and accuracy. SOPSO is much more suitable for solving this kind of problem.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:5 )

Date of Conference:

March 31 2009-April 2 2009