Continuous ant colony optimization for identification of time delays in the linear plant

Authors:
Janusz Papliński
Affiliations:
Department of Control and Measurement, West Pomeranian University of Technology, Szczecin, Poland
Venue:
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Year:
2012

Citing 8
Cited 0

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
On how pachycondyla apicalis ants suggest a new search algorithm

Future Generation Computer Systems
A global estimation for multichannel time-delay and signal parameters via genetic algorithm

Signal Processing
A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
The Ant Colony Metaphor for Searching Continuous Design Spaces

Selected Papers from AISB Workshop on Evolutionary Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interpolated Ant Colony Optimization (IACO) for a continuous domain was proposed in the paper. The IACO uses the same mechanisms as the classical ACO applied to discrete optimization. The continuous search space is sampled by individuals on the basis of the linear interpolated trace of the pheromone. It allows to obtain a simple and efficient optimization algorithm. The proposed algorithm is then used to identify delays in linear dynamic systems. The examination results show that it is an effective tool for global optimization problems.