Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion
暂无分享,去创建一个
In a recent paper (Stewart [19 79]), we have introduced the problem of search for a moving target when there are practical constraints on the rate of movement of the searcher and have suggested approaches to a solution. In the present paper, we report, in particular, on computational experience with the branch-and-bound algorithm proposed there for determining a track for a single searcher while searching for a moving target in discrete space and time. Although the method was developed for a single searcher, a heuristic adaptation was also suggested for use when there are multiple searchers.
[1] B. McCabe. SEARCHING FOR A ONE-DIMENSIONAL RANDOM WALKER , 1974 .
[2] T. J. Stewart. Search for a moving target when searcher motion is restricted , 1979, Comput. Oper. Res..
[3] Scott Shorey Brown,et al. Optimal Search for a Moving Target in Discrete Time and Space , 1980, Oper. Res..