Search Theory

2A Review of Results in Optimal Search for Moving Targets

LAWRENCE D. STONE / METRON, Inc., McLean, Virginia

DOI: 10.1201/9781003420057-2

1. INTRODUCTION

Optimal search problems divide naturally into four categories depending on the target’s behavior. The first division depends on whether the target is evading or not, that is, whether there is a two-sided optimization of both the searcher’s and target’s strategy, or whether the target’s behavior is independent of the searcher’s action. Within each of these categories the target can be stationary or moving. The four categories are illustrated in Figure 1. In this review we concentrate on the one-sided search for a moving target problem. For the other three categories, we provide references ...