An infiltration game on k arcs |
| |
Authors: | John M. Auger |
| |
Abstract: | An infiltrator, starting at a safe base, tries to pass, undetected by a guard and within a time limit, along one of k nonintersecting arcs to a safe destination. Optimal strategies and the value are obtained for this discrete zero-sum search-evasion game. |
| |
Keywords: | |
|
|