A Possibilistic Formulation of Autonomous Search for Targets

Abstract

Autonomous search is an ongoing cycle of sensing, statistical estimation and motion control with objective to find and localise targets in a designated search area. Traditionally, the theoretical framework for autonomous search combines the sequential Bayesian estimation with the information theoretic motion control. This paper formulates autonomous search in the framework of possibility theory. Although the possibilistic formulation is slightly more involved than the traditional, it provides means for quantitative modelling and reasoning in the presence of epistemic uncertainty. This feature is demonstrated in the paper in the context of partially known probability of detection, expressed as an interval value. The paper presents an elegant Bayes-like solution to sequential estimation, with the reward function for motion control defined to take into account the epistemic uncertainty. The advantages of the proposed search algorithm are demonstrated by numerical simulations.