An optimal branch-and-bound procedure for the constrained path, moving target search problem - Info and Reading Options
By James N. Eagle
"An optimal branch-and-bound procedure for the constrained path, moving target search problem" was published by Naval Postgraduate School in 1987 - Monterey, Calif and the language of the book is English.
“An optimal branch-and-bound procedure for the constrained path, moving target search problem” Metadata:
- Title: ➤ An optimal branch-and-bound procedure for the constrained path, moving target search problem
- Author: James N. Eagle
- Language: English
- Publisher: Naval Postgraduate School
- Publish Date: 1987
- Publish Location: Monterey, Calif
“An optimal branch-and-bound procedure for the constrained path, moving target search problem” Subjects and Themes:
- Subjects: TARGET DETECTION - SEARCHING - MOVING TARGETS - MARKOV PROCESSES
Edition Specifications:
- Pagination: 5 p. ;
Edition Identifiers:
- The Open Library ID: OL25481327M - OL16857051W
AI-generated Review of “An optimal branch-and-bound procedure for the constrained path, moving target search problem”:
"An optimal branch-and-bound procedure for the constrained path, moving target search problem" Description:
The Open Library:
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells that maximizes the probability of detecting the target in a fixed number of time periods. Closely following earlier work by Theodor Stewart, a branch-and-bound procedure is developed which finds optimal search paths. This procedure is tested and appears to be more efficient than existing dynamic programming solution methods. Keywords: Moving targets; Target detection; Searching.
Read “An optimal branch-and-bound procedure for the constrained path, moving target search problem”:
Read “An optimal branch-and-bound procedure for the constrained path, moving target search problem” by choosing from the options below.
Search for “An optimal branch-and-bound procedure for the constrained path, moving target search problem” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "An optimal branch-and-bound procedure for the constrained path, moving target search problem" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “An optimal branch-and-bound procedure for the constrained path, moving target search problem” in Libraries Near You:
Read or borrow “An optimal branch-and-bound procedure for the constrained path, moving target search problem” from your local library.
Buy “An optimal branch-and-bound procedure for the constrained path, moving target search problem” online:
Shop for “An optimal branch-and-bound procedure for the constrained path, moving target search problem” on popular online marketplaces.
- Ebay: New and used books.