An Approximate Solution Technique for the Constrained Search Path Moving Target Search Problem PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download An Approximate Solution Technique for the Constrained Search Path Moving Target Search Problem PDF full book. Access full book title An Approximate Solution Technique for the Constrained Search Path Moving Target Search Problem by James N. Eagle. Download full books in PDF and EPUB format.
Author: James N. Eagle Publisher: ISBN: Category : Languages : en Pages : 20
Book Description
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 from which he can choose is a function of the cell chosen in the previous time period. The problem is to find a searcher path, i.e., a sequence of search cells, that minimizes the probability of not detecting the target in a fixed number of time periods. The problem is formulated as a nonlinear program and solved for a local optimum by a simple implementation of the convex simplex method.
Author: James N. Eagle Publisher: ISBN: Category : Languages : en Pages : 20
Book Description
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 from which he can choose is a function of the cell chosen in the previous time period. The problem is to find a searcher path, i.e., a sequence of search cells, that minimizes the probability of not detecting the target in a fixed number of time periods. The problem is formulated as a nonlinear program and solved for a local optimum by a simple implementation of the convex simplex method.
Author: Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
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 from which he can choose is a function of the cell chosen in the previous time period. The problem is to find a searcher path, i.e., a sequence of search cells, that minimizes the probability of not detecting the target in a fixed number of time periods. The problem is formulated as a nonlinear program and solved for a local optimum by a simple implementation of the convex simplex method.
Author: James N. Eagle Publisher: ISBN: Category : Operations research Languages : en Pages : 0
Book Description
A simple moving target problem is approximately solved for that search path minimizing the probability of non-detection subject to specified constraints on the search path. The solution procedure uses moving horizon policies. An 'almost asymptotically geometric' structure is observed in the solution. (Author).
Author: Metin Sagal Publisher: ISBN: Category : Languages : en Pages : 43
Book Description
The objective of this thesis is to develop and test two new approximate solution techniques for a moving target problem in discrete time and space where both the searcher and the target have constraints on their paths. The first technique is an application of the heuristic Local Search Method and the second technique is an application of the Frank-Wolfe Method. The motivation for looking at approximate methods is that the problem is NP-complete and optimal solution techniques become impractical for large size problems. Experiments showed that the Local Search Method approach is an efficient technique for obtaining approximate computation solutions. However, the Frank-Wolfe Method approach does not perform well for the problem. Keywords: Target detection; Paths; Fortran; Algorithms. (Author).
Author: Publisher: ISBN: Category : Electronic journals Languages : en Pages : 660
Book Description
Covers all aspects of OR including computing and decision technology; environment, energy and natural resources; financial services; logistics and supply chain operations; manufacturing operations; optimization; public and military services; simulation; stochastic models; telecommunications; and transportation.
Author: Publisher: ISBN: Category : Aeronautics Languages : en Pages : 1028
Book Description
Lists citations with abstracts for aerospace related reports obtained from world wide sources and announces documents that have recently been entered into the NASA Scientific and Technical Information Database.
Author: James N. Eagle Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
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.
Author: Lawrence D. Stone Publisher: Springer ISBN: 3319268996 Category : Business & Economics Languages : en Pages : 222
Book Description
This book begins with a review of basic results in optimal search for a stationary target. It then develops the theory of optimal search for a moving target, providing algorithms for computing optimal plans and examples of their use. Next it develops methods for computing optimal search plans involving multiple targets and multiple searchers with realistic operational constraints on search movement. These results assume that the target does not react to the search. In the final chapter there is a brief overview of mostly military problems where the target tries to avoid being found as well as rescue or rendezvous problems where the target and the searcher cooperate. Larry Stone wrote his definitive book Theory of Optimal Search in 1975, dealing almost exclusively with the stationary target search problem. Since then the theory has advanced to encompass search for targets that move even as the search proceeds, and computers have developed sufficient capability to employ the improved theory. In this book, Stone joins Royset and Washburn to document and explain this expanded theory of search. The problem of how to search for moving targets arises every day in military, rescue, law enforcement, and border patrol operations.
Author: James N. Eagle Publisher: ISBN: Category : Markov processes Languages : en Pages : 0
Book Description
A search is conducted for a target moving in discrete time between a finite number of cells according to a known Markov process. The set of cells available for search in a given time period is a function of the cell searched in the previous time period. The problem is formulated and solved as a partially observable Markov decision process (POMDP). A finite time horizon POMDP solution technique is presented which is simpler than the standard linear programming methods. (Author).
Author: James N. Eagle
Author: James N. Eagle
Author: 
Author: James N. Eagle
Author: Metin Sagal
Author: 
Author: 
Author: 
Author: James N. Eagle
Author: Lawrence D. Stone
Author: James N. Eagle