10 research outputs found

    A multi-objective extremal optimisation approach applied to RFID antenna design

    Get PDF
    Extremal Optimisation (EO) is a recent nature-inspired meta-heuristic whose search method is especially suitable to solve combinatorial optimisation problems. This paper presents the implementation of a multi-objective version of EO to solve the real-world Radio Frequency IDentification (RFID) antenna design problem, which must maximise efficiency and minimise resonant frequency. The approach we take produces novel modified meander line antenna designs. Another important contribution of this work is the incorporation of an inseparable fitness evaluation technique to perform the fitness evaluation of the components of solutions. This is due to the use of the NEC evaluation suite, which works as a black box process. When the results are compared with those generated by previous implementations based on Ant Colony Optimisation (ACO) and Differential Evolution (DE), it is evident that our approach is able to obtain competitive results, especially in the generation of antennas with high efficiency. These results indicate that our approach is able to perform well on this problem; however, these results can still be improved, as demonstrated through a manual local search process.Full Tex

    Integrating continuous differential evolution with discrete local search for meander line RFID antenna design

    Get PDF
    The automated design of meander line RFID antennas is a discrete self-avoiding walk(SAW) problem for which efficiency is to be maximized while resonant frequency is to beminimized. This work presents a novel exploration of how discrete local search may beincorporated into a continuous solver such as differential evolution (DE). A prior DE algorithmfor this problem that incorporates an adaptive solution encoding and a bias favoringantennas with low resonant frequency is extended by the addition of the backbite localsearch operator and a variety of schemes for reintroducing modified designs into the DEpopulation. The algorithm is extremely competitive with an existing ACO approach and thetechnique is transferable to other SAW problems and other continuous solvers. The findingsindicate that careful reintegration of discrete local search results into the continuous populationis necessary for effective performance

    An investigation into the Gustafsson limit for small planar antennas using optimisation

    Get PDF
    The fundamental limit for small antennas provides a guide to the effectiveness of designs. Gustafsson et al, Yaghjian et al, and Mohammadpour-Aghdam et al independently deduced a variation of the Chu-Harrington limit for planar antennas in different forms. Using a multi-parameter optimisation technique based on the ant colony algorithm, planar, meander dipole antenna designs were selected on the basis of lowest resonant frequency and maximum radiation efficiency. The optimal antenna designs across the spectrum from 570 to 1750 MHz occupying an area of 56mm×25mm56mm \times 25mm were compared with these limits calculated using the polarizability tensor. The results were compared with Sievenpiper's comparison of published planar antenna properties. The optimised antennas have greater than 90% polarizability compared to the containing conductive box in the range 0.3<ka<1.10.3<ka<1.1, so verifying the optimisation algorithm. The generalized absorption efficiency of the small meander line antennas is less than 50%, and results are the same for both PEC and copper designs.Comment: 6 pages, 10 figures, in press article. IEEE Transactions on Antennas and Propagation (2014

    Local search for ant colony system to improve the efficiency of small meander line RFID antennas

    Get PDF
    The efficient design of meander line antennas for RFID devices is a significant real-world problem. Traditional manual tuning of antenna designs is becoming impractical for larger problems. Thus the use of automated techniques, in the form of combinatorial search algorithms, is a necessity. Ant colony system (ACS) is a very efficient meta-heuristic that is commonly used to solve path construction problems. Apart from its own native search capacity, ACS can be dramatically improved by combining it with local search strategies. As shown in this paper, applying local search as a form of structure refinement to RFID meander line antennas delivers effective antenna structures. In particular, we use the operator known as backbite, that has had previous application in the construction of self-avoiding walks and compact polymer chains. Moreover, we apply it in a novel, hierarchical manner that allows for good sampling of the local search space. Its use represents a significant improvement on results obtained previously
    corecore