Target search with an allocation of search effort to overlapping cones of observation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Target search with an allocation of search effort to overlapping cones of observation

Résumé

This paper addresses the problem of an aerial moving target search with a radar on an airborne platform. An observation of the radar is a modeled as a cone covering a set of regions of the search area. We assume overlapping cones of observation, and we want to find the discrete allocation plan of search effort to the cones in order to optimize target detection. For the stationary target search with overlapping cones, we present a dynamic programming algorithm that computes the optimal allocation. An approximate greedy heuristic, which is more appropriate in a real time context, is also presented and assessed. The moving target search problem is solved with the Forward And Backward (FAB) algorithm coupled with the different stationary search algorithms. In this paper, we use radar detection model that has been shown to be more realistic than the ones usually considered. Also, several models of movement of the target are considered with different Markovian transition matrices. We compare the performance of the mentioned algorithms on several scenarios.

Dates et versions

hal-04525102 , version 1 (28-03-2024)

Identifiants

Citer

Hugo Vaillaud, Claire Hanen, Emmanuel Hyon, Cyrille Enderli. Target search with an allocation of search effort to overlapping cones of observation. 18th Conference on Computer Science and Intelligence Systems, Sep 2023, Warsaw, Poland. pp.801-811, ⟨10.15439/2023F7181⟩. ⟨hal-04525102⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More