By Topic

Using Particle Swarm Optimization for Robot Path Planning in Dynamic Environments with Moving Obstacles and Target

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
$33 $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

2 Author(s)
Amin Zargar Nasrollahy ; Comput. Eng. Dept., Islamic Azad Univ., Qazvin, Iran ; Hamid Haj Seyyed Javadi

Robot path planning in known and dynamic environments is feasible for mobile robots and its main purpose is to find a collision free path for a robot from an initial position to a goal position in an environment with obstacles. In this paper the goal position is assumed to be moving over the time. Also our environment includes moving obstacles as well as static ones. We present a new approach for path planning mobile robots using Particle Swarm Optimization in order to minimize total path planning time while avoiding the local optimums. Simulation is used to validate and illustrate the approach.

Published in:

Computer Modeling and Simulation, 2009. EMS '09. Third UKSim European Symposium on

Date of Conference:

25-27 Nov. 2009