The Optimal Search for a Moving Target When the Search Path Is Constrained 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 The Optimal Search for a Moving Target When the Search Path Is Constrained PDF full book. Access full book title The Optimal Search for a Moving Target When the Search Path Is Constrained by James N. Eagle. Download full books in PDF and EPUB format.
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 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 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: Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
A method for determining the optimal or near-optimal search path for the wake of a moving target when the searcher's motion is constrained is presented. The problem uses a Markov motion model in discrete time and space for the target and assumes that the searcher is constrained to move only from the currently occupied cell j to a specified set of 'neighbor cells', I(j). First, a discussion of the complexity of the problem is presented. Next, an extension of T.J. Stewart's constrained searcher algorithm is given. Stewart's algorithm uses S.S. Brown's unconstrained searcher algorithm to calculate bounds on the probability of nondetection. An extension of Brown's algorithm to allow the use of a wake detector is also given. Several alternatives to both algorithms are offered and compared. Finally, some further extensions to the algorithms are suggested. (Author).
Author: Irad Ben-Gal Publisher: John Wiley & Sons ISBN: 1118597044 Category : Mathematics Languages : en Pages : 367
Book Description
Presents a probabilistic and information-theoretic framework for a search for static or moving targets in discrete time and space. Probabilistic Search for Tracking Targets uses an information-theoretic scheme to present a unified approach for known search methods to allow the development of new algorithms of search. The book addresses search methods under different constraints and assumptions, such as search uncertainty under incomplete information, probabilistic search scheme, observation errors, group testing, search games, distribution of search efforts, single and multiple targets and search agents, as well as online or offline search schemes. The proposed approach is associated with path planning techniques, optimal search algorithms, Markov decision models, decision trees, stochastic local search, artificial intelligence and heuristic information-seeking methods. Furthermore, this book presents novel methods of search for static and moving targets along with practical algorithms of partitioning and search and screening. Probabilistic Search for Tracking Targets includes complete material for undergraduate and graduate courses in modern applications of probabilistic search, decision-making and group testing, and provides several directions for further research in the search theory. The authors: Provide a generalized information-theoretic approach to the problem of real-time search for both static and moving targets over a discrete space. Present a theoretical framework, which covers known information-theoretic algorithms of search, and forms a basis for development and analysis of different algorithms of search over probabilistic space. Use numerous examples of group testing, search and path planning algorithms to illustrate direct implementation in the form of running routines. Consider a relation of the suggested approach with known search theories and methods such as search and screening theory, search games, Markov decision process models of search, data mining methods, coding theory and decision trees. Discuss relevant search applications, such as quality-control search for nonconforming units in a batch or a military search for a hidden target. Provide an accompanying website featuring the algorithms discussed throughout the book, along with practical implementations procedures.
Author: Douglas B. Guthe (Jr.) Publisher: ISBN: Category : Computer science Languages : en Pages : 65
Book Description
A method for determining the optimal or near-optimal search path for the wake of a moving target when the searcher's motion is constrained is presented. The problem uses a Markov motion model in discrete time and space for the target and assumes that the searcher is constrained to move only from the currently occupied cell j to a specified set of 'neighbor cells', I(j). First, a discussion of the complexity of the problem is presented. Next, an extension of T.J. Stewart's constrained searcher algorithm is given. Stewart's algorithm uses S.S. Brown's unconstrained searcher algorithm to calculate bounds on the probability of nondetection. An extension of Brown's algorithm to allow the use of a wake detector is also given. Several alternatives to both algorithms are offered and compared. Finally, some further extensions to the algorithms are suggested. (Author).
Author: David V. Chudnovsky Publisher: CRC Press ISBN: 1000950735 Category : Mathematics Languages : en Pages : 182
Book Description
On the solution of an optimal search problem with an exponential detection function. Covers one- and two-sided detection problems by furnishing continuous and discret time strategies; examines two-sided search strategies with solutions in hide and seek games in many discrete and continuous bounded
Author: Michela Milano Publisher: Springer ISBN: 3642335586 Category : Mathematics Languages : en Pages : 1034
Book Description
This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP 2012), held in Québec, Canada, in October 2012. The 68 revised full papers were carefully selected from 186 submissions. Beside the technical program, the conference featured two special tracks. The former was the traditional application track, which focused on industrial and academic uses of constraint technology and its comparison and integration with other optimization techniques (MIP, local search, SAT, etc.) The second track, featured for the first time in 2012, concentrated on multidisciplinary papers: cross-cutting methodology and challenging applications collecting papers that link CP technology with other techniques like machine learning, data mining, game theory, simulation, knowledge compilation, visualization, control theory, and robotics. In addition, the track focused on challenging application fields with a high social impact such as CP for life sciences, sustainability, energy efficiency, web, social sciences, finance, and verification.
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
Author: James N. Eagle
Author: James N. Eagle
Author: Lawrence D. Stone
Author: 
Author: Irad Ben-Gal
Author: Douglas B. Guthe (Jr.)
Author: David V. Chudnovsky
Author: Michela Milano
Author: James N. Eagle
Author: