This book views multiple target tracking as a Bayesian inference problem. Within this framework it develops the theory of single target tracking, multiple target tracking, and likelihood ratio detection and tracking. In addition to providing a detailed description of a basic particle filter that implements the Bayesian single target recursion, this resource provides numerous examples that involve the use of particle filters. With these examples illustrating the developed concepts, algorithms, and approaches -- the book helps radar engineers track when observations are nonlinear functions of target site, when the target state distributions or measurement error distributions are not Gaussian, in low data rate and low signal to noise ratio situations, and when notions of contact and association are merged or unresolved among more than one target.

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.

Using the Bayesian inference framework, this book enables the reader to design and develop mathematically sound algorithms for dealing with tracking problems involving multiple targets, multiple sensors, and multiple platforms. It shows how non-linear Multiple Hypothesis Tracking and the Theory of United Tracking are successful methods when multiple target tracking must be performed without contacts or association. With detailed examples illustrating the developed concepts, algorithms, and approaches, the book helps the reader track when observations are non-linear functions of target site, when the target state distributions or measurements error distributions are not Gaussian, when notions of contact and association are merged or unresolved among more than one target, and in low data rate and low signal to noise ratio situations.

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.