Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown, S. S. [ 1980 ] Optimal Search for a Moving Target in Discrete Time and Space, Oper. Res, (to appear).
McCabe, B. J. [1974] Searching for a One-Dimensional Random Walker, J. Appl. Probab. 11, pp. 86–93.
Stewart, T. J. [1979] Search for a Moving Target When Searcher Motion is Restricted, Computer and Oper. Res. 6, pp. 129–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Plenum Press, New York
About this chapter
Cite this chapter
Stweart, T.J. (1980). Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion. In: Haley, K.B., Stone, L.D. (eds) Search Theory and Applications. NATO Conference Series, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9188-7_24
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9188-7_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9190-0
Online ISBN: 978-1-4615-9188-7
eBook Packages: Springer Book Archive