By Topic

A Straight Moving Path Planner for Mobile Robots in Static Environments Using Cellular Automata

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

3 Author(s)
Faranak Rahimi Soofiyani ; Tech. & Eng. Dept., Islamic Azad Univ. Sci. & Res. Branch, Tehran, Iran ; Amir Masoud Rahmani ; Mehran Mohsenzadeh

Planning a collision free path for a robot in an environment with lots of obstacles is one of the most important issues in robotics. Path planning using robots draws the most attention when the planning environment is dangerous or inaccessible for human. In this paper a cellular automata based algorithm called SMPP (Straight Moving Path Planner) is presented for robot path planning problem. The advantage of this approach is that it prefers straight moves rather than zigzag steps. It is shown that how SMPP can help us finding a reasonable optimum path from the start point of the robot to the goal position in presence of obstacles. The proposed algorithm is then compared to the previous works done on the basis of cellular automata and the results are presented to validate the approach.

Published in:

Computational Intelligence, Communication Systems and Networks (CICSyN), 2010 Second International Conference on

Date of Conference:

28-30 July 2010