Search for a Moving Target in Discrete Space and Time

Lawrence D. Stone, Johannes O. Royset and Alan R. Washburn
Additional contact information
Lawrence D. Stone: Metron, Inc.
Johannes O. Royset: Naval Postgraduate School
Alan R. Washburn: Naval Postgraduate School

Chapter Chapter 3 in Optimal Search for Moving Targets, 2016, pp 49-79 from Springer

Abstract: Abstract This chapter develops methods for finding optimal search plans for a target that is moving in discrete space and time. In the case where the detection function is exponential, optimal moving target plans can be obtained by computing a sequence of optimal stationary target plans. The algorithm developed to find these plans is a special case of the more general Forward-And-Backward (FAB) algorithm which is also presented in this chapter.

Keywords: Search Plan; Forward And Backward (FAB); Exponential Detection Function; Myopic Plan; Stationary Target Problem (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-26899-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319268996

DOI: 10.1007/978-3-319-26899-6_3

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().