Optimal searches for asteroids

Abstract

Optimal searches for a fixed object are discussed, and the rigorous analytical results of discrete search theory are presented. The totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are shown to be identical under not too restrictive assumptions. The mathematical formalism is illustrated by an earth-approaching asteroid search and optimal searches for such objects are explicitly constructed. The approximation that earth-approaching asteroids are fixed is equivalent to having a very high (equiv 100 sq degs/hour) search rate. Generalizations to other types of astronomical search are briefly mentioned. Previously announced in STAR as N83-34657