The identification of time delay in the linear plant is important tasks. Most of the conventional identification techniques, such as those based on least mean-squares, are essentially gradient-guided local search techniques and they require a smooth search space or a differentiable performance index. New possibility in this field is opened by an application of the hybrid Ant Colony Optimization (ACO) with local optimization algorithm. The Directional Derivatives Simplex (DDS) as a local optimization algorithm is proposed in the paper and used in the memetic ACODDS method. The ACODDS algorithm is compared with ACO and a classical methods: Global Separable Nonlinear Least Squares (GSNLS). The obtained results suggest that the proposed method performs well in estimating the model parameters. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Papliński, J. P. (2011). The memetic ant colony optimization with directional derivatives simplex algorithm for time delays identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6922 LNAI, pp. 183–192). https://doi.org/10.1007/978-3-642-23935-9_18
Mendeley helps you to discover research relevant for your work.