Search for Moving Targets in Continuous Space

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 5 in Optimal Search for Moving Targets, 2016, pp 121-153 from Springer

Abstract: Abstract In Chap. 3 , we found optimal search allocations for problems that take place in discrete space and time. For the most part, algorithms for computing these allocations are limited to exponential detection functions.

Keywords: Detection Function; Stationary Target Problem; Gateaux Differential; Search Plan; finding Optimal Plans (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_5

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

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

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 ().