By Topic

View planning for mobile robots

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)
Xie, S. ; Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John''s, Nfld., Canada

Two O(N log N) heuristic approaches for planning viewpoints in 2D known environments are described. Both are based on the generalized Delaunay triangulation of a polygon with holes. The main difference between them is the heuristic strategies used to merge the triangles to form the partitioning or covering star polygons. When the environment needs to be explored, an O(N2 log N) heuristic scheme which successively selects the viewpoints and views for mobile robots is used. Upper bounds on the number of planned viewpoints and views for each scheme are estimated

Published in:

Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on

Date of Conference:

13-18 May 1990