By Topic

Blind approximation of planar convex sets

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

2 Author(s)
M. Lindenbaum ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; A. M. Bruckstein

The process of learning the shape of an unknown convex planar object through an adaptive process of simple measurements called line probings, which reveal tangent lines to the object, is considered. A systematic probing strategy is suggested and an upper bound on the number of probings it requires for achieving an approximation with a pre-specified precision to the unknown object is derived. A lower bound on the number of probings required by any strategy for achieving such an approximation is also derived, showing that the gap between the number of probings required by the authors' strategy and the number of probings required by the optimal strategy is a logarithmic factor in the worst case. The proposed approach overcomes deficiencies of the classical geometric probing approach which is based on the polygonality assumption, and thus is not applicable for real robotic tasks

Published in:

IEEE Transactions on Robotics and Automation  (Volume:10 ,  Issue: 4 )