By Topic

A divide and conquer algorithm for rectilinear region coverage

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

3 Author(s)
Agarwal, A. ; Intelligent Syst. Center, Nanyang Technol. Univ., Singapore ; Meng-Hiot Lim ; Lip Chien Woon

We give an algorithm to generate a coverage motion plan for a single unmanned reconnaissance aerial vehicle (URAV) over a holed rectilinear polygonal region. The URAV is equipped with a stabilized downward-looking sensor which has a square footprint of a fixed area. The algorithm is based on the principle of divide-and-conquer. In the first step, we generate the lexicographically maximum area rectangle partition of the polygon. We outline a sweep line based algorithm to compute this partition. Next, we rind a coverage motion plan for movement of the sensor over each rectangle in the partition. Plans for adjacent rectangles are finally merged to generate a complete plan for the entire region. Our algorithm yields paths with minimal length and minimal turns.

Published in:

Robotics, Automation and Mechatronics, 2004 IEEE Conference on  (Volume:2 )

Date of Conference:

1-3 Dec. 2004