Multi-agent search with interim positive information

A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detection by scouts only improve on the current knowledge of the moving target´s location, such that the searchers can more effectively find and service the target in the future. The team must correspondingly plan not only to maximize the probability of the searchers directly finding the target, but also give them the best chance of exploiting any new information from potential scout detections. It is shown that this need to plan for replanning can be addressed by equivalently solving a series of simpler detection search problems that always do terminate on detection. Optimal and heuristic solution methods for this searcher/scout problem are derived, such that the capabilities of all the sensing platforms in a search task are harnessed even when only a subset are capable of actually servicing the target.