Search for a Moving Target: The FAB Algorithm

Article Abstract:

An iterative Forward and Backward (FAB) algorithm is studied. It is applicable to the problem of computing optimal search plans when the target's motion is modeled by a discrete space and time Markov chain. The class of objective functions to which the method applies is generalized. The object is to optimize the distribution of effort in finding a target which moves randomly from cell to cell as the search proceeds. A model is developed and numerical results presented. A table shows ten passes through the FAB algorithm. A graph shows myopic and near optimal miss functions.

Mathematical models, Applications, Models, Systems, Markov Process, Searching, Surveillance Systems

---

(An Absolute Value of E) Time Algorithm for Computing the Reliability of a Class of Directed Networks

Article Abstract:

The problem of computing source-to-terminal reliability is studied. It is the probability that a source can communicate with a certain terminal in a probabilistic directed network. A set of reliability-preserving reductions is discussed. Polynomial time algorithms are developed for a class of directed networks called BSP-digraphs. The proposed method is usable for mixed graphs containing directed and undirected edges. Diagrams are used to illustrate digraphs.

Computational complexity (Machine theory), Reliability (Trustworthiness), Network analyzers, Graph theory, LAN Monitor, Networks, Reliability, Probability, Computational Complexity

---

An Algorithm for a Class of Discrete Maximum Entropy Problems

Article Abstract:

An exact method for solving a class of maximum entropy problems is presented. The solutions are valuable for testing numerical nonlinear programming methods. An example of equipment selection for an oil spill problem is given.

Nonlinear programming, Mathematical Programming, Decision Making, Theory, Entropy

Similar abstracts:

• Abstracts: Surveillance Search for a Moving Target. Optimal Tests for Initialization Bias in Simulation Output. A Selection Artifact in Delinquency Data Revisited
• Abstracts: An Efficient Point Algorithm for a Linear Two-State Optimization Problem. Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.