Ant colony optimisation for tree-searching-based synthesis of monopulse array antenna

The design of simple feed networks is of great interest in synthesising 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 aircraft). Sub-arraying techniques have been proposed to properly address such a task. 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 optimiser.