Most threatening trajectories in a radar coverage area

In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to find theoretical results (existence or unicity) and also search algorithm which would be able to compute these trajectories. More particularly, we saw that the classical ¿shortest path algorithm¿ get useless when dealing with an additional local geometric constraints (local anisotropy of target Radar Cross Section). We built two sorts of algorithm in order to take this local constraint into account.