Branch-and-bound method for just-in-time optimization of radar search patterns

DOI10.1007/978-3-030-26458-1_25MaRDI QIDQ3296267zbMATH OpenOpenAlexFDO

Authors Yann Briheche, Frédéric Barbaresco, Fouad Bennis, Damien Chablat

Publication date 7 July 2020

Published in Nature-Inspired Methods for Metaheuristics Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.04906

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Abstract: 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.

Recommendations

• Theoretical complexity of grid cover problems used in radar applications
• Solving radar netting problem with mathematical programming
• The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
• Exploring further advantages in an alternative formulation for the set covering problem
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• Integer Programming
• The set covering problem revisited: an empirical study of the value of dual information
• Theoretical complexity of grid cover problems used in radar applications

Cited in

(2)

• Theoretical complexity of grid cover problems used in radar applications
• Solving radar netting problem with mathematical programming

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Branch-and-bound method for just-in-time optimization of radar search patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296267)