Book ChapterDOI
Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion
T. J. Stweart
- pp 247-253
TLDR
Computational experience is reported on with the branch-and-bound algorithm proposed there for determining a track for a single searcher while searching for a moving target in discrete space and time.Abstract:
In a recent paper (Stewart [19 79]), we have introduced the problem of search for a moving target when there are practical constraints on the rate of movement of the searcher and have suggested approaches to a solution. In the present paper, we report, in particular, on computational experience with the branch-and-bound algorithm proposed there for determining a track for a single searcher while searching for a moving target in discrete space and time. Although the method was developed for a single searcher, a heuristic adaptation was also suggested for use when there are multiple searchers.read more
Citations
More filters
BookDOI
Cooperative Control of Distributed Multi-Agent Systems
TL;DR: This volume, the result of a UCLA collaborative project with Caltech, Cornell and MIT, presents cutting edge results in terms of the dimensions of cooperative control from leading researchers worldwide, allowing the reader to assess the multi-faceted landscape of Cooperative Control.
Journal ArticleDOI
The Optimal Search for a Moving Target When the Search Path Is Constrained
TL;DR: A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process and a finite time horizon POMDP solution technique is presented which is simpler than the standard linear programming methods.
Journal ArticleDOI
The complexity of the optimal searcher path problem
K E Trummel,J R Weisinger +1 more
TL;DR: It is shown that the problem of finding an optimal searcher path that maximizes the probability of detecting a stationary target by the end of a fixed time is NP-complete and the Problem of finding a path that minimizes mean time to detection isNP-hard.
Journal ArticleDOI
An optimal branch-and-bound procedure for the constrained path, moving target search problem
James N. Eagle,James R. Yee +1 more
TL;DR: A searcher and target move among a finite set of cells C = 1, 2, ',N in discrete time to minimize the probability of not detecting the target in T searches.
Book ChapterDOI
Cooperative Control for Autonomous Air Vehicles
Kevin M. Passino,Marios M. Polycarpou,David R. Jacques,Meir Pachter,Yang Liu,Yanli Yang,Matt Flint,Michael L. Baum +7 more
TL;DR: The utility of using-biomimicry of social foraging strategies to develop coordination strategies and the stability of vehicular swarms are studied to try to understand what types of communications are needed to achieve cooperative search and engagement.
References
More filters
Journal ArticleDOI
Optimal Search for a Moving Target in Discrete Time and Space
TL;DR: It is shown that a search plan maximizes the overall probability of detection if and only if for each time interval i the search conducted at time i maximized the probability of detecting a stationary target with the probability that the stationary target occupies cell c.
Journal ArticleDOI
Search for a moving target when searcher motion is restricted
TL;DR: Algorithms are developed for numerically determining search policies when resources are arbitrarily divisible and when they are indivisible (single searcher) and a potential heuristic approach to the problem of limited resource divisibility is discussed.
Journal ArticleDOI
Searching for a one-dimensional random walker
TL;DR: In this article, the existence of a search plan 4 such that )t = 0, was shown, where t is the number of vertices in a Bernoulli random walk with x-,r = 0.