Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Efficient path planning for searching a 2-D grid-based environment map

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

1 Author(s)
Marzouqi, M.A. ; Khalifa Univ. of Sci., Technol. & Res., Sharjah, United Arab Emirates

In this paper, the aim is to find the shortest path from which a mobile robot can view the whole environment. Available solutions are based on polygonal representations of the environment. This has limited a detailed modeling of the obstacles due to the representation complexity and modeling limitations forced by the proposed solutions. Such inaccuracy can be critical in search related tasks. This work presents a solution based on a grid-based representation of the environment which provides a detailed modeling for complex obstacle strewn environments. The presented approach provides a close to optimal short search path which the robot can traverse to incrementally view all free spaces. The approach has been implemented and tested on a simulated environment. A number of test cases are presented.

Published in:

GCC Conference and Exhibition (GCC), 2011 IEEE

Date of Conference:

19-22 Feb. 2011