Optimal sub-arraying of compromise planar arrays through an innovative ACO-weighted procedure

In this paper, the synthesis of sub-arrayed monopulse planar arrays providing an optimal sum pattern and best compromise difference patterns is addressed by means of an innovative clustering approach based on the Ant Colony Optimizer. Exploiting the similarity properties of optimal and independent sum and difference excitation sets, the problem is reformulated into a combinatorial one where the definition of the sub-array configuration is obtained through the search of a path within a weighted graph. Such a weighting strategy allows one to effectively sample the solution space avoiding bias towards sub-optimal solutions. The sub-array weight coefficients are then determined in an optimal way by exploiting the convexity of the problem at hand by means of a convex programming procedure. Representative results are reported to assess the effectiveness of the weighted global optimization and its advantages over previous implementations. (c) The Electromagnetics Academy - The final version of this article is available at the url of the journal PIER (Progress In Electromagnetics Research): http://www.jpier.org/PIER/pier.php?paper=10092008

[1]  Paolo Rocca,et al.  Design of compromise sum-difference patterns through the iterative contiguous partition method , 2009 .

[2]  P. Rocca,et al.  Ant colony optimisation for tree-searching-based synthesis of monopulse array antenna , 2008 .

[3]  Tser-Ya Dai,et al.  Optimum beamformers for monopulse angle estimation using overlapping subarrays , 1994 .

[4]  P. Rocca,et al.  Boresight Slope Optimization of Subarrayed Linear Arrays Through the Contiguous Partition Method , 2009, IEEE Antennas and Wireless Propagation Letters.

[5]  Z. Nie,et al.  The Application of a Modified Differential Evolution Strategy to Some Array Pattern Synthesis Problems , 2008, IEEE Transactions on Antennas and Propagation.

[6]  A. Massa,et al.  Optimization of the difference patterns for monopulse antennas by a hybrid real/integer-coded differential evolution method , 2005, IEEE Transactions on Antennas and Propagation.

[7]  Paolo Rocca,et al.  Excitation matching procedure for sub-arrayed monopulse arrays with maximum directivity , 2009 .

[8]  E. Moreno,et al.  Optimal compromise among sum and difference patterns , 1996 .

[9]  Paolo Rocca,et al.  An Effective Excitation Matching Method for the Synthesis of Optimal Compromises Between Sum and Difference Patterns in Planar Arrays , 2008 .

[10]  R. Elliott Antenna Theory and Design , 2003 .

[11]  Paolo Rocca,et al.  Synthesis of monopulse antennas through iterative contiguous partition method , 2007 .

[12]  P. Rocca,et al.  An Improved Excitation Matching Method Based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis , 2009, IEEE Transactions on Antennas and Propagation.

[13]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[14]  P. Rocca,et al.  Evolutionary optimization as applied to inverse scattering problems , 2009 .

[15]  E. Moreno,et al.  Subarray weighting for the difference patterns of monopulse antennas: joint optimization of subarray configurations and weights , 2001 .

[16]  Paolo Rocca,et al.  DIRECTIVITY OPTIMIZATION IN PLANAR SUB-ARRAYED MONOPULSE ANTENNA , 2008 .

[17]  P. Rocca,et al.  An Innovative Approach Based on a Tree-Searching Algorithm for the Optimal Matching of Independently Optimum Sum and Difference Excitations , 2008, IEEE Transactions on Antennas and Propagation.

[18]  Tommaso Isernia,et al.  Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas , 2005 .

[19]  Samuel M. Sherman,et al.  Monopulse Principles and Techniques , 1984 .

[20]  P. Rocca,et al.  On the Synthesis of Sub-Arrayed Planar Array Antennas for Tracking Radar Applications , 2008, IEEE Antennas and Wireless Propagation Letters.

[21]  Walter D. Fisher On Grouping for Maximum Homogeneity , 1958 .

[22]  A F Morabito,et al.  Optimal Synthesis of Sum and Difference Patterns With Arbitrary Sidelobes Subject to Common Excitations Constraints , 2010, IEEE Antennas and Wireless Propagation Letters.

[23]  P. Rocca,et al.  A Fast Graph-Searching Algorithm Enabling the Efficient Synthesis of Sub-Arrayed Planar Monopulse Antennas , 2009, IEEE Transactions on Antennas and Propagation.

[24]  Derek A. McNamara,et al.  Synthesis of sub-arrayed monopulse linear arrays through matching of independently optimum sum and difference excitations , 1988 .

[25]  P. Rocca,et al.  A Hybrid Approach to the Synthesis of Subarrayed Monopulse Linear Arrays , 2009, IEEE Transactions on Antennas and Propagation.

[26]  Ta-Sung Lee,et al.  Subarray-synthesized low-side-lobe sum and difference patterns with partial common weights , 1993 .

[27]  T. Isernia,et al.  An Effective Hybrid Approach for the Optimal Synthesis of Monopulse Antennas , 2007, IEEE Transactions on Antennas and Propagation.

[28]  P. Rocca,et al.  Synthesis of Large Monopulse Linear Arrays Through a Tree-Based Optimal Excitations Matching , 2007, IEEE Antennas and Wireless Propagation Letters.