An Upper Bound Useful in Optimizing Search for a Moving Target
Alan R. Washburn · 1981
T HAS recently become possible to compute optimal search plans in certain cases where the target moves while the search is being carried out (Brown [1980], Stone [1979], Washburn [1980]). The algorithm used for computation produces an improving sequence of search plans 4P, 4A )2, ..., with an attendant computational issue of when to stop the sequence. The upper bound developed here permits an assessment of maximum possible error that is useful in making that decision.