Ant Colony Based Hybrid Approach for Optimal Compromise Sum-Difference Patterns Synthesis

Rocca, Paolo and Manica, Luca and Massa, Andrea (2010) Ant Colony Based Hybrid Approach for Optimal Compromise Sum-Difference Patterns Synthesis. UNSPECIFIED.

[img]
Preview
PDF
Download (231Kb) | Preview

    Abstract

    Dealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so-called optimal compromise problem between sum and difference patterns when sub-arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub-set of the unknowns (i.e., the sub-array excitation coefficients) have demonstrated their effectiveness. In this letter, an hybrid approach based on the Ant Colony Optimization (ACO) is proposed. At the first step, the ACO is used to define the sub-array membership of the array elements, while, at the second step, the sub-array weights are computed by solving a convex programming problem. The definitive version is available at www3.interscience.wiley.com

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7885 Computer Engineering
    Q Science > QC Physics (General) > QC661 Electromagnetic Theory
    Q Science > QC Physics (General) > QC760 Electromagnetism
    Uncontrolled Keywords: Sum and Difference Patterns Synthesis, Ant Colony Optimization, Hybrid Optimization
    Report Number: DISI-11-020
    Repository staff approval on: 25 Feb 2011

    Actions (login required)

    View Item