By Topic

Information merging technology and its application in robot 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

5 Author(s)
Kai Zhao ; Northwestern Polytech. Univ., Xi''an, China ; Sheng-jin Li ; Gang Lu ; Guang-Wei Zhou
more authors

For solving the problems that random objects are feature point and obstacles, this paper presents an efficient approach for Path Planning of Robot based on Simultaneous Localization and Mapping (SLAM) algorithm.Low-cost ultrasonic sensors as the design scheme of distance measuring is adopted. Aiming to obtain the probability of grid map update effectively, an improved Bayesian formula is proposed. To realize synchronous positioning and map construction, dynamic random objects are related to the map with NN (nearest neighbor) data correlation method. Then the motion of the next step of robot is planned by improved particle swarm algorithm. The result of the numerical simulation shows that the novel particle swarm optimization is effective and can find the more optimal global solutions with high efficiency compared to the basic particle swarm optimization (PSO). The validity and reliability of this method are tested via the simulation. The result of the simulation shows that the method can solve the SLAM problem of robot in dynamic obstacles environment and realize real-time dynamic collision avoidance planning.

Published in:

Electrical and Control Engineering (ICECE), 2011 International Conference on

Date of Conference:

16-18 Sept. 2011