Ant Colony Optimization for Tree-Searching based Synthesis of Monopulse Array Antenna

The design of simple feed networks is of great interest in synthesizing monopulse radar array antennas in order to reduce the complexity of the antenna architecture, the costs as well as the occupied physical space (e.g., on aircrafts). Sub-arraying techniques have been proposed to properly address such a task. In this letter, starting from the formulation of the sub-arraying problem in terms of a combinatorial one, the final compromise solution is obtained by looking for the minimum cost path inside a binary tree graph through an Ant Colony Optimizer. This paper is a postprint of a paper submitted to and accepted for publication in Electronics Letters and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library.