By Topic

Optimal search procedures

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)

This paper sets up a restricted class of search procedures for a satellite lost in a region of the sky. The satellite must be found by a radar search. The procedures under consideration allow the use of a preliminary search, which may be done with a wider beam than is required for the final search. The purpose of the preliminary search is to obtain a ranking of the various portions of the sky, so that the final search can examine the more likely regions of the sky first. It is shown that a preliminary search can reduce the expected search time, with no matter how wide a beam it is carried out. It is also shown that the preliminary search with the narrowest possible beam is best.

Published in:

Information Theory, IEEE Transactions on  (Volume:9 ,  Issue: 3 )