eprintid: 467
rev_number: 4
eprint_status: archive
userid: 5
dir: disk0/00/00/04/67
datestamp: 2011-03-25
lastmod: 2013-07-01 09:34:36
status_changed: 2013-07-01 09:34:36
type: techreport
metadata_visibility: show
item_issues_count: 0
creators_name: Rocca, Paolo
creators_name: Manica, Luca
creators_name: Massa, Andrea
title: An Improved Excitation Matching Method based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis
ispublished: pub
subjects: TU
full_text_status: public
keywords: Sum and Difference Patterns Synthesis, Monopulse Antennas, Linear Arrays, Excitation Matching, Directed Acyclic Graph, Ant Colony Optimization
abstract: Dealing with an excitation matching method, this paper presents a global optimization strategy for the optimal clustering in sum-difference compromise linear arrays. Starting from a combinatorial formulation of the problem at hand, the proposed technique is aimed at determining the sub-array configuration expressed as the optimal path inside a directed acyclic graph structure modelling the solution space. Towards this end, an ant colony metaheuristic is used to benefit of its hill-climbing properties in dealing with the non-convexity of the sub-arraying as well as in managing graph searches. A selected set of numerical experiments are reported to assess the efficiency and current limitations of the ant-based strategy also in comparison with previous local combinatorial search methods. (c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
date: 2009-08
date_type: published
institution: University of Trento
department: informaticat
refereed: TRUE
referencetext: [1] D. A.McNamara, “Synthesis of sub-arrayed monopulse linear arrays through matching of independently optimum sum and difference excitations,” IEE Proc. H Microwaves Antennas Propag., vol. 135, no. 5, pp. 371-374, Oct. 1988. [2] T. T. Taylor, “Design of line-source antennas for narrow beam-width and low side lobes,” Trans. IRE, vol. AP-3, pp. 16-28, 1955. [3] C. L. Dolph, “A current distribution for broadside arrays which optimises the relationship between beam width and sidelobe level,” Proc. IRE, vol. 34, pp. 335-348, 1946. [4] E. T. Bayliss, “Design of monopulse antenna difference patterns with low sidelobes,” Bell System Tech. Journal, 47, pp. 623-640, 1968. [5] D. A. McNamara, “Discrete ¯n-distributions for difference patterns,” Electron. Lett., vol. 22, no. 6, pp. 303-304, Jun. 1986. [6] F. Ares, S. R. Rengarajan, J. A. Rodriguez, and E. Moreno, “Optimal compromise among sum and difference patterns,” J. Electromag. Waves Appl., vol. 10, pp.1143-1555, 1996. [7] P. Lopez, J. A. Rodriguez, F. Ares, and E.Moreno, “Subarray weighting for difference patterns of monopulse antennas: Joint optimization of subarray configurations and weights,” IEEE Trans. Antennas Propag., vol. 49, no. 11, pp. 1606-1608, Nov. 2001. [8] S. Caorsi, A. Massa, M. Pastorino, and A. Randazzo, “Optimization of the difference patterns for monopulse antennas by a hybrid real/integer-coded differential evolution method,” IEEE Trans. Antennas Propag., vol. 53, no. 1, pp. 372-376, Jan. 2005. [9] M. D’Urso, T. Isernia, and E. F. Meliado’, “An effective hybrid approach for the optimal synthesis of monopulse antennas,” IEEE Trans. Antennas Propag., vol. 55, no. 4, pp. 1059-1066, Apr. 2007. [10] A.Massa,M. Pastorino, and A. Randazzo, “Optimization of the directivity of a monopulse antenna with a subarray weighting by a hybrid differential evolution method,” IEEE Antennas Wireless Propag. Lett., vol. 5, pp. 155-158, 2006. [11] Y. Chen, S. Yang, and Z. Nie, “The application of a modified differential evolution strategy to some array pattern synthesis problems,” IEEE Trans. Antennas Propagat., vol. 56, no. 7, pp. 1919-1927, Jul. 2008. [12] L. Manica, P. Rocca, A. Martini, and A. Massa, “An innovative approach based on a tree-searching algorithm for the optimal matching of independently optimum sum and difference excitations,” IEEE Trans. Antennas Propag., vol. 56, no. 1, pp. 58-66, Jan. 2008. [13] P. Rocca, L. Manica, A. Martini, and A. Massa, “Synthesis of large monopulse linear arrays through a tree-based optimal excitations matching,” IEEE Antennas Wireless Propagat. Lett., vol. 6, pp. 436-439, 2007. [14] P. Rocca, L. Manica, M. Pastorino, and A. Massa, “Boresight slope optimization of subarrayed linear arrays through the contiguous partition method,” IEEE Antennas Wireless Propag. Lett., in press. [15] P. Rocca, L. Manica, and A. Massa, “Synthesis of monopulse antennas through the iterative contiguous partition method,” Electron. Lett., vol. 43, no. 16, pp. 854-856, Aug. 2007. [16] P. Rocca, L.Manica, and A.Massa, “Hybrid approach for sub-arrayed monopulse antenna synthesis,” Electron. Lett.,vol. 44, no.2, pp.75- 76, Jan. 2008. [17] M. D’Urso, T. Isernia, “Solving some array synthesis problems by means of an effective hybrid approach,” IEEE Trans. Antennas Propagat., vol. 55, no. 3, pp. 750-759, Mar. 2007. [18] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Trans. Syst. Man and Cybern. B , vol. 26, no. 1, pp. 29-41, Feb. 1996. [19] P. Rocca, L. Manica, F. Stringari, and A. Massa, “Ant colony optimization for treesearching based synthesis of monopulse array antenna,” Electron. Lett., vol. 44, no. 13, pp.783-785, Jun. 2008. [20] L.Manica, P. Rocca, and A.Massa, “On the synthesis of sub-arrayed planar array antennas for tracking radar applications,” IEEE Antennas Wireless Propag. Lett., in press. [21] W. D. Fisher, “On grouping of maximum homogeneity,” American Statistical Journal, pp. 789-798, Dec. 1958. [22] M. Dorigo, M. Birattari, and T. Stutzle, “Ant colony optimization,” IEEE Comput. Intell. Mag., vol. 1, no. 4, pp. 28 - 39, Nov. 2006. [23] M. Dorigo and L. M. Gambarella, “Ant colony system: A cooperative learning approach to the traveling salesman problem,” IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 53-66, Apr. 1997. [24] M. Reimann, K. Doerner, and R. F. Hartl, “D-ants: Savings based ants divide and conquer the vehicle routing problem,” Computers & Operations Research, vol. 31, no. 4, pp. 563- 591, 2004. [25] V. Maniezzo, “Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem,” INFORMS J. Comput., vol. 11, no. 4, pp. 358-369, 1999. [26] D. Costa and A. Hertz, “Ants can colour graphs,” J. Operat. Res. Soc., vol. 48, pp. 295-305, 1997. [27] D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource constrained project scheduling,” IEEE Trans. Evol. Comput., vol. 6, no. 4, pp. 333-346, 2002. [28] D. Merkle and M. Middendorf, “Ant colony optimization with global pheromone evaluation for scheduling a single machine,” Appl. Intell., vol. 18, no. 1, pp. 105-111, 2003. [29] C. Blum and M. J. Blesa, “New metaheuristic approaches for the edge-weight ed kcardinality tree problem,” Computers & Operations Research, vol. 32, no. 6, pp. 1355- 1377, 2005. [30] C. M. Coleman, E. J. Rothwell, and J. E. Ross, “Investigation of simulated annealing, antcolony optimization, and genetic algorithms for selfstructuring antennas,” IEEE Trans. Antennas Propag., vol. 52, no. 4, pp. 1007-1014, Apr. 2004. [31] O. Quevedo-Teruel and E. Rajo-Iglesias, “Ant colony optimization for array synthesis,” in Proc. Antennas Propag. Soc. Int. Symp., Jul. 2006, pp. 3301-3304. [32] O. Quevedo-Teruel and E. Rajo-Iglesias, “Ant colony optimization in thinned array synthesis with minimum sidelobe level,” IEEE Antennas Wireless Propag. Lett., vol. 5, pp. 349-352, 2006. [33] E. Rajo-Iglesias and O. Quevedo-Teruel, “Linear Array synthesis using an ant-colonyoptimization- based algorithm,” IEEE Antennas Propag. Mag., vol. 49, no. 2, pp. 70-79, Apr. 2007. [34] M. Pastorino, “Stochastic optimizationmethods applied tomicrowave imaging: A review,” IEEE Trans. Antennas Propag., vol. 55, no. 3, pp. 538-548, Mar. 2007. [35] D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997. [36] D. A. McNamara, “Direct synthesis of optimum difference patterns for discrete linear arrays using Zolotarev distribution,” IEE Proc. H Microw. Antennas Propag., vol. 140, no. 6, pp 445-450, Dec. 1993.
citation:   Rocca, Paolo and Manica, Luca and Massa, Andrea  (2009) An Improved Excitation Matching Method based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis.  [Technical Report]     
document_url: http://www.eledia.org/students-reports/467/1/DISI-11-026.R171.pdf