Theoretical Complexity of Grid Cover Problems Used in Radar Applications

Modern radars are highly flexible systems, relying on digital antennas to dynamically control the radar beam shape and position through electronic circuits. Radar surveillance is performed by sequential emission of different radar beams. Optimization of radar surveillance requires finding a minimal subset of radar beams, which covers and ensures detection over the surveillance space, among a collection of available radar beams with different shapes and positions, thus minimizing the required scanning time. Optimal radar surveillance can be modelled by grid covering, a specific geometric case of set covering where the universe set is laid out on a grid, representing the radar surveillance space, which must be covered using available subsets, representing the radar beams detection areas. While the set cover problem is generally difficult to solve optimally, certain geometric cases can be optimized in polynomial time. This paper studies the theoretical complexity of grid cover problems used for modelling radar surveillance, proving that unidimensional grids can be covered by strongly polynomial algorithms based on dynamic programming, whereas optimal covering of bidimensional grids is generally non-deterministic polynomially hard.

[1]  P. M. Hahn,et al.  Beam Shape Loss and Surveillance Optimization for Pencil Beam Arrays , 1969, IEEE Transactions on Aerospace and Electronic Systems.

[2]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[3]  David S. Johnson.  Approximation algorithms for combinatorial problems , 1973, STOC '73.

[4]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[5]  G. Thiele,et al.  Antenna theory and design , 1981 .

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[8]  Nimrod Megiddo,et al.  On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..

[9]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[10]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[11]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[12]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[13]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[14]  Joseph J. Carr.  Chapter 11 – Impedance matching , 2001 .

[15]  Aravind Srinivasan,et al.  Approximation algorithms for the covering Steiner problem , 2002, Random Struct. Algorithms.

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[17]  Bernd Gärtner,et al.  Understanding and Using Linear Programming (Universitext) , 2006 .

[18]  Vangelis Th. Paschos,et al.  Completeness in approximation classes beyond APX , 2006, Theor. Comput. Sci..

[19]  Anita Schöbel,et al.  Optimization in Public Transportation - Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network , 2006, Optimization and its applications.

[20]  Division on Earth Climate.  Evaluation of the multifunction phased array radar planning process , 2008 .

[21]  Basis reduction and the complexity of branch-and-bound , 2010, SODA 2010.

[22]  Gabor Pataki,et al.  Basis reduction and the complexity of branch-and-bound , 2009, SODA '10.

[23]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[24]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[25]  Timothy M. Chan,et al.  Exact algorithms and APX-hardness results for geometric packing and covering problems , 2014, Comput. Geom..

[26]  David Priegnitz,et al.  A demonstration of adaptive weather surveillance and multifunction capabilities on the National Weather Radar Testbed Phased Array Radar , 2014, 2014 International Radar Conference.

[27]  Jian Li,et al.  A PTAS for the Weighted Unit Disk Cover Problem , 2015, ICALP.

[28]  F. Bennis,et al.  Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming , 2016, 2016 17th International Radar Symposium (IRS).