Investigation and implementation of an algorithm for computing optimal search paths
A moving target is detected at long range with an initial position given by a probability distribution on a grid of N cells. Also located on the grid is a searcher, constrained by speed, who must find an optimal search path in order to minimize the probability of target survival by time T. A branch-...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://hdl.handle.net/10945/22312 |