Asynchronous simulated kalman filter optimization algorithm
Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. SKF was introduced as synchronous population-based algorithm. This work introduced a new variation of SKF which is SKF with asynchronous update mechanism, asynchronous-SKF (ASKF). In contrast to...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en en |
| Published: |
Science Publishing Corporation Inc.
2018
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/22974/1/90.%20Asynchronous%20simulated%20kalman%20filter%20optimization%20algorithm.pdf http://umpir.ump.edu.my/id/eprint/22974/2/90.1%20Asynchronous%20simulated%20kalman%20filter%20optimization%20algorithm.pdf http://umpir.ump.edu.my/id/eprint/22974/ https://doi.org/10.14419/ijet.v7i4.27.22478 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. SKF was introduced as synchronous population-based algorithm. This work introduced a new variation of SKF which is SKF with asynchronous update mechanism, asynchronous-SKF (ASKF). In contrast to the synchronous implementation where the whole population go through each optimization step as a group, in ASKF an agent starts its optimization steps only after its preceding agent has complete all of its optimization steps. The performance of ASKF is compared against SKF using CEC2014 benchmark functions, where the ASKF is found to perform significantly better than the original SKF. |
|---|