Path optimization for single and multiple searchers: models and algorithms
We develop models and solution methodologies to solve the discrete-time path-optimization problem where a single or multiple searchers look for a moving target in a finite set of cells. The single searcher is constrained by maximum limits on the consumption of several resources such as time, fuel,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/10380 |