Download or read book Optimal Search for Moving Targets written by Lawrence D. Stone and published by Springer. This book was released on 2016-04-06 with total page 222 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Constrained Optimal Search for a Moving Target in a False Contact Environment written by Donald E. Merrifield and published by . This book was released on 1987 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On the Optimal Search for a Moving Target written by Ulla Pursiheimo and published by . This book was released on 1972 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Optimal Search for a Moving Target with the Option to Wait written by János Flesch and published by . This book was released on 2007 with total page 37 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Optimal Whereabouts Search for a Moving Target written by STANFORD UNIV CALIF DEPT OF STATISTICS. and published by . This book was released on 1979 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt: This paper shows that solving the optimal whereabouts search problem for a moving target is equivalent to solving a finite number of optimal detection problems for moving targets. This generalizes the result of Kadane (5) for stationary targets. (Author).
Download or read book On Optimal Search for a Moving Target written by Benjamin Paul Jordan and published by . This book was released on 1997 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book An Optimal Branch and Bound Procedure for the Constrained Path Moving Target Search Problem written by James N. Eagle and published by . This book was released on 1987 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book The Optimal Search for a Moving Target When the Search Path Is Constrained written by James N. Eagle and published by . This book was released on 1982 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).
Download or read book Optimal Search for the Wake of a Moving Target When Searcher Motion is Constrained written by and published by . This book was released on 1983 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).
Download or read book Studies on the Optimal Search Plan written by Koji Iida and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 138 pages. Available in PDF, EPUB and Kindle. Book excerpt: Search theory is concerned with the location of a 'target' given imprecise information concerning its location. The subject has a variety of applications such as locating missing people in wilderness or at sea, searching for mineral deposits, medical diagnosis, and searching for malfunctions in industrial processes. This volume is concerned with search strategies which are optimal in the sense that they minimize the 'risk' or cost of a search where this may be measured in factors such as time or money. Consequently, the author discusses a range of mathematical techniques including non-linear programming, fractional programming, dynamic programming, the calculus of variation, and the Pontryagin maximum principle from optimal control theory. Many numerical examples are presented in order to illustrate the effectiveness of particular techniques. As a result, this book will provide all researchers in search theory with an up-to-date account of this important area of operations research.
Download or read book Optimal Search for the Wake of a Moving Target When Searcher Motion is Constrained written by Douglas B. Guthe (Jr.) and published by . This book was released on 1983 with total page 65 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).
Download or read book Numerical Optimization of Search for a Moving Target written by Lawrence D. Stone and published by . This book was released on 1978 with total page 188 pages. Available in PDF, EPUB and Kindle. Book excerpt: The problem of computing an optimal search plan for a moving target is addressed. The majority of the report describes numerical techniques which have been developed to compute optimal search plans for the very broad class of problems in which the target's motion can be modeled by a discrete-time stochastic process and the detection function is exponential. A very efficient algorithm is given to find optimal search plans when the target's motion is modeled by a mixture of discrete time and space Markov processes. A second algorithm is presented to solve the variation of this problem that one encounters when the search effort at each time period is restricted to be uniform over an arbitrary rectangular region. The latter is intended to approximate the problem of choosing a sequence of sonobuoy fields to maximize the probability of detecting a submarine. Examples show that one can often find rectangular plans that are almost as effective as the optimal plan. In addition to the above, an algorithm is presented to find optimal plans for arbitrary discrete time target motion processes which can be modeled by Monte Carlo simulation. All the algorithms have been programmed in FORTRAN and run on a Prime 400 minicomputer. Examples of optimal plans calculated by these algorithms are presented.
Download or read book Search for a Moving Target Upper Bound on Detection Probability written by and published by . This book was released on 1978 with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: Existing algorithms for computing the optimal distribution of effort in search for a moving target operate by producing a sequence of progressively better distributions. This report shows how to compute an upper bound on the detection probability for each of those effort distributions in the case where the detection function is concave.
Download or read book Distribution of Search Effort Determined from the Necessary Condition for the Uniformly Optimal Search in the Case of a Moving Target written by Ulla Pursiheimo and published by . This book was released on 1956 with total page 12 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Theory of Optimal Search written by and published by Elsevier. This book was released on 1976-01-20 with total page 275 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; andmethods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory.As a result, the book represents a blend of new methods in general computational analysis,and specific, but also generic, techniques for study of systems theory ant its particularbranches, such as optimal filtering and information compression.- Best operator approximation,- Non-Lagrange interpolation,- Generic Karhunen-Loeve transform- Generalised low-rank matrix approximation- Optimal data compression- Optimal nonlinear filtering
Download or read book Probabilistic Search for Tracking Targets written by Irad Ben-Gal and published by John Wiley & Sons. This book was released on 2013-03-25 with total page 367 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Search Theory written by David V. Chudnovsky and published by CRC Press. This book was released on 2023-05-09 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
