Methods of Information Theory Search
Eugene Kagan, Irad Ben‐Gal · 2013
This chapter formulates the algorithm of search for static targets and proves its main properties. The algorithm is based on the Learning Real-Time A* (LRTA*) algorithm. The chapter considers Huffman—Zimmerman search procedure and the Generalized Optimal Testing Algorithm (GOTA) relations and shows that under certain conditions the algorithm acts as the optimal Huffman—Zimmerman search procedure or as the near-optimal GOTA. It considers the informational algorithm which is based on the Moving Target Search (MTS) algorithm. The chapter demonstrates the relation of the algorithm with the Pollock model of search, and show that under the conditions of the Pollock simple optimal model of search, it gives the same optimal solutions for both certain and uncertain detections. It presents certain generalizations and, on the basis of the ILRTA* algorithm, demonstrate search with multiple searchers for both cooperative and non-cooperative behavior. The theoretical results are also illustrated by numerical examples. Controlled Vocabulary Terms Multivariate statistics