一类有规避行为的动目标搜索问题研究

A Searching Question of Moving Target with Evasion

在动目标的搜索过程中,搜索者在有限的时间内,利用有限的资源寻找目标,使其期望回报最大,而目标则针对搜索者可能采取的策略,选择适当的运动路径躲避搜索者的搜索。将此问题归结为一个二人零和对策问题,并给出利用对策论求解的方法。

This paper investigates a search question of a moving target. In the process of the search, the searcher distributes search resources over a search space in order to detect the target at a finite number of time points. The target selects the path from some options in order to evade the searcher. Then the problem is formulated as a two-person zero - sum game, and the method of the problem＇s solution is given.