Three-dimensional location estimation, optimal disposition and operation of a direction finder system

Abstract

We consider three problems related to the operation of a target detection system. First, a problem of disposing multiple direction finders in a direction finder system is considered to effectively cover the area of interest in which a target is expected to turn up. We present a two-stage heuristic algorithm for the objective of maximizing the accuracy of estimation of the location of a target that is assumed to be located in the area of interest. Secondly, we present a new analytical method for estimating the three-dimensional (3-D) location of a target using directional data. Based on a nonlinear programming problem formulated for the line method, which is a well known algorithm for 2-D location estimation, we present a method for 3-D location estimation. Finally, we consider the problem of determining a route of a search resource to search visually multiple areas under time-dependent probabilities of existence. We propose heuristic algorithms and a simulated annealing (SA) algorithm to determine a search sequence. In the SA algorithm, a new neighborhood generation method and a new parameter are introduced to improve the performance of the SA algorithm.