By Topic

Region exploration path planning for a mobile robot expressing working environment by grid points

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

6 Author(s)

In this paper, region exploration path planning algorithm is proposed. In order for a mobile robot to perform this task, appropriate measures with the shape of the working environment, which may be intricate or curved, is necessary. In addition, a robot must be able to react and be flexible when confronted with obstacles. With this algorithm, these challenges can be met by approximately expressing the working environment in grid points and regenerating the path using one that was planned beforehand. Simulations are used to demonstrate proposed exploration path planning and re-planning algorithm.

Published in:

Robotics and Automation, 2003. Proceedings. ICRA '03. IEEE International Conference on  (Volume:2 )

Date of Conference:

14-19 Sept. 2003