Constrained robust submodular sensor selection with application to multistatic sonar arrays

Abstract

The authors develop a framework to select a subset of sensors from a field in which the sensors have an ingrained independence structure. Given an arbitrary independence pattern, the authors construct a graph that denotes pairwise independence between sensors, which means those sensors may operate simultaneously without interfering. The set of all fully‐connected subgraphs (cliques) of this independence graph forms the independent sets of matroids over which the authors maximise the average and minimum of a set of submodular objective functions. The average case is submodular, so it can be approximated. The minimum case is both non‐submodular and inapproximable. The authors propose a novel algorithm GENSAT that exploits submodularity and, as a result, returns a near‐optimal solution with approximation guarantees on a relaxed problem that are within a small factor of the average case scenario. The authors apply this framework to ping sequence optimisation for active multistatic sonar arrays by maximising sensor coverage for average and minimum case scenarios and derive lower bounds for minimum probability of detection for a fractional number of targets. In these ping sequence optimisation simulations, GENSAT exceeds the fractional lower bounds and reaches near‐optimal performance, and submodular function optimisation vastly outperforms traditional approaches and nearly achieves optimal performance.

Keywords

• independence graph formation
• submodular objective function
• generalised saturate
• GENSAT
• PSO
• ping sequence optimisation