Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns - Ecole Centrale de Nantes Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns

Résumé

Electronic phased-array radars offer new possibilities for radar search pattern optimization by using bi-dimensional beam-forming and beam-steering. Radar search pattern optimization can be approximated as a set cover problem and solved using integer programming, while accounting for localized clutter and terrain masks in detection constraints. We present a set cover problem approximation for time-budget minimization of radar search patterns, under constraints of range, detection probability and direction-specific scan update rates. Branch&Bound is a classical optimization procedure for solving combinatorial problems. It is known mainly as an exact algorithm, but features interesting characteristics, making it particularly fit for solving optimization problems in real-time applications and producing just-in-time solutions.
Fichier principal
Vignette du fichier
BookChapter_BRIHECHE.pdf (865.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02474341 , version 1 (11-02-2020)

Identifiants

Citer

Yann Briheche, Frédéric Barbaresco, Fouad Bennis, Damien Chablat. Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns. Nature-Inspired Methods for Metaheuristics Optimization, pp.465-488, 2020, ⟨10.1007/978-3-030-26458-1_25⟩. ⟨hal-02474341⟩
27 Consultations
52 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More