A brief review of simulated Kalman Filter Algorithm –&nbsp;variants and applications

Nor Hidayati Abdul Aziz; Zuwairie Ibrahim; Nor Azlina Ab. Aziz; Mohd Saberi Mohamad; Muhammad Razlan Kamaruzaman

doi:10.12688/f1000research.73242.1

Home Browse A brief review of simulated Kalman Filter Algorithm –variants and...

ALL Metrics

-

Views

-

Downloads

Get PDF

Get XML

Export

▬

✚

Review

A brief review of simulated Kalman Filter Algorithm – variants and applications

[version 1; peer review: 2 approved with reservations]

Nor Hidayati Abdul Aziz ¹, Zuwairie Ibrahim², Nor Azlina Ab. Aziz ¹, Mohd Saberi Mohamad³, Muhammad Razlan Kamaruzaman⁴

Nor Hidayati Abdul Aziz ¹, Zuwairie Ibrahim², [...] Nor Azlina Ab. Aziz ¹, Mohd Saberi Mohamad³, Muhammad Razlan Kamaruzaman⁴

PUBLISHED 25 Oct 2021

Author details Author details

¹ Faculty of Engineering and Technology,, Multimedia University, Melaka, Malaysia
² College of Engineering, Universiti Malaysia Pahang, Gambang, Kuantan, Malaysia
³ Department of Genetics and Genomics, College of Medical and Health Sciences, United Arab Emirates University, Abu Dhabi, United Arab Emirates
⁴ Texas Instruments Electronics Malaysia, Melaka, Malaysia

Nor Hidayati Abdul Aziz
Roles: Conceptualization, Formal Analysis, Funding Acquisition, Writing – Original Draft Preparation

Zuwairie Ibrahim
Roles: Writing – Review & Editing

Nor Azlina Ab. Aziz
Roles: Conceptualization, Writing – Review & Editing

Mohd Saberi Mohamad
Roles: Writing – Review & Editing

Muhammad Razlan Kamaruzaman
Roles: Data Curation, Investigation

OPEN PEER REVIEW

REVIEWER STATUS

This article is included in the Research Synergy Foundation gateway.

Abstract

Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. This paper presented an overview of the research progress in SKF from the day it was introduced until the present day, discussing the progress, improvements, modifications, and applications of SKF. The fundamental and standard algorithm were first introduced. Then, the work on the algorithm improvements was surveyed. Finally, the remaining unresolved problems and some directions of SKF research were discussed. We reviewed 57 SKF papers. 16 of them on fundamental improvements, 9 on extension of the algorithm to discrete problems and 25 on their applications. Researchers have worked on ideas to improve exploration capability to prevent premature convergence by trying prediction operators, opposition-based learning, and different iteration strategies. There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. Lastly, a single-agent variant of SKF and a multi-objective SKF were introduced. SKF algorithms and its variants have been implemented in at least nine areas of applications: drill path optimization, airport gate allocation problem (AGAP), assembly sequence planning (ASP), system identification, feature selection, image template matching, controller tuning, wireless sensor network, and engineering design problem. The literature reviewed solely depended on the keyword search that contained the terms simulated Kalman filter from December 2015 to the present date. This is the first review paper on SKF. It is hoped that this survey would be beneficial for the researchers of this area and attracting interest towards the algorithm.

Keywords

SKF, review, population-based, single-agent, continuous problems, discrete problems, single objective optimization, multiobjective optimization

Corresponding authors: Nor Hidayati Abdul Aziz, Zuwairie Ibrahim, Nor Azlina Ab. Aziz

Competing interests: No competing interests were disclosed.

Grant information: This project is funded by the Multimedia University (MMU) IRFund, MMUI/210015. The authors would like to acknowledge all parties directly or indirectly involved in the preparation of this review paper.
The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Copyright: © 2021 Abdul Aziz NH et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite: Abdul Aziz NH, Ibrahim Z, Ab. Aziz NA et al. A brief review of simulated Kalman Filter Algorithm – variants and applications [version 1; peer review: 2 approved with reservations]. F1000Research 2021, 10:1081 (https://doi.org/10.12688/f1000research.73242.1) First published: 25 Oct 2021, 10:1081 (https://doi.org/10.12688/f1000research.73242.1) Latest published: 25 Oct 2021, 10:1081 (https://doi.org/10.12688/f1000research.73242.1)

Introduction

Optimization in terms of time and complexity is often needed in this technological era. Optimization helps in cost minimization and profit maximization. The complexity of the traditional exact optimization methods led to enormous amount of computational work which is not practical. Therefore, approximate methods especially metaheuristics are becoming popular. These general-purpose algorithms have lower complexity and offer good solutions.

Studies of well-known Kalman Filter¹ have contributed to the development of many algorithms in estimation as well as in other fields, such as optimization. In optimization, two optimizers have been developed based on Kalman filter. They are Heuristic Kalman Algorithm (HKA)² and Simulated Kalman Filter (SKF).³ This paper emphasizes the fundamental advancements and applications of SKF, which originally proposed by Ibrahim et al. in 2015. The intention of this paper is to gather and briefly review all the papers related to SKF for the beneficial of students and researchers who would like to venture in this field.

Simulated Kalman Filter (SKF) algorithm

The SKF, which is also an estimation-based metaheuristic algorithm⁴ was first introduced as a solution to unimodal optimization problems.³ A year later, it was tested on various optimization problems and found to be a promising optimizer.⁵

In principle, SKF tries to solve an optimization problem by estimating the optimum solution. By taking the inspiration from the Kalman filter algorithm, each agent in the SKF will go through the same three-step process available in the Kalman filter that consist of prediction, measurement and estimation. The SKF uses the same prediction and measurement equation as in the Kalman filter. Moreover, since the measurement in Kalman filter estimation comes from sensors, the measurement is simulated in the optimization algorithm, thus the algorithm is named Simulated Kalman Filter (SKF).

Figure 1 shows the flowchart of the SKF algorithm. The optimization process starts with the initialization of solutions, followed by the fitness evaluation of each solution, and then the generation of new solutions for the next iteration. This process will stop when the stopping criteria is met. To further understand how the SKF works, a tutorial published in 2019 can be referred.⁶ In addition, further studies of the SKF algorithm revealed that the P, Q and R parameters can be replaced with random numbers $\in [0, 1]$ without affecting the performance of the algorithm.⁷^-⁹

Figure 1. Flowchart of SKF.

The SKF improvements

The exploration in the SKF algorithm solely depends on the measurement equation. The sine operator in the measurement equation gives a 50-50 chance for exploration to occur in the measurement phase. In the estimation phase, exploitation is set to take place. The predicted value is updated by a multiplication of two small numbers (the Kalman gain and the distance between the predicted and measurement value). This may cause the SKF algorithm to prematurely converge.

Opposition-based learning

In 2018, Ibrahim et al. introduced Opposition-Based Learning (OBL) concept in SKF to overcome the problem of premature convergent. In SKF with oppositional-learning prediction operator (SKF-OPO), the opposition population is generated around the best-so-far solution identified in the prediction phase.¹⁰ If the opposite prediction has a better fitness value than the original prediction (which is the previous estimated solution), the opposite prediction will be used as the predicted solution. This method proves that a proper prediction operator will help SKF to escape from premature convergence. Further experiments were conducted to observe the impact of opposition population generation in SKF-OPO with the introduction of jumping rate.¹¹ This jumping rate is later compared to a random number between 0-1. If the random number is smaller than the jumping rate, then the opposition population will be generated at prediction phase. Results show that the higher the jumping rate, the better the performance of the algorithm. Another variation of OBL implementation in SKF was introduced in 2019 by Mohd Azmi et al. known as Current Optimum Opposition-Based Learning SKF (COOB-SKF). In this algorithm, the formation of the opposite population uses the best-so-far solution as the center between the estimate population and the opposition estimate population.¹²

Iteration strategy

The original population-based SKF algorithm uses the synchronous update mechanism, in which all agents have to go through all optimization steps before the best-so-far solution is updated. However, in 2018, Ab. Aziz et al. found that when the update strategy of SKF is made individual-oriented, the results are better.

The researchers later explore the possibility to use both mechanisms in SKF. There are three variants of SKF adaptive switching algorithms: the fitness-based adaptive switching synchronous-asynchronous SKF (ASSA-SKF), fitness-evaluated adaptive switching SKF with randomness (ASSKFR), and diversity-based adaptive switching synchronous-asynchronous SKF (DASSA-SKF). In ASSA-SKF, the SKF algorithm starts with synchronous update and later changes its update mechanism when the fitness is found to be static for a number of fitness evaluations.¹³ In ASSKFR, the switching happens when the switching counter is greater than a random number which is chosen every time a switching occurs.¹⁴ One may choose to start with synchronous update or with asynchronous update. Lastly in DASSA-SKF, instead of using fitness as the switching indicator, the decision to switch depends on the diversity of the population.¹⁵ Every time the diversity of the population is not changing for a certain number of iterations, then the iteration strategy will switch from synchronous update to asynchronous update and vice versa. All findings have shown that the algorithms benefit when there is a greater number of switching happening, thus encouraging more explorations.

Hybrid

Hybridization between algorithms can be used to improve an algorithm’s performance. SKF has been subjected to hybridization with three algorithms: the Particle Swarm Optimization (PSO),¹⁶ the Gravitational Search Algorithm (GSA),¹⁷ and the Sine Cosine Algorithm (SCA).¹⁸

Muhammad et al. have proposed four ways to show how GSA¹⁹ and PSO²⁰ can be hybridized with SKF during its prediction step due to the absence of prediction operator in SKF.

• Model 1: GSA/PSO as prediction operator
• Model 2: GSA/PSO as prediction operator when a better solution is found
• Model 3: GSA/PSO as prediction operator with jumping rate
• Model 4: GSA/PSO as prediction operator with jumping rate and when a better solution is found

In another paper, although the fourth model has a better performance compared to the original SKF algorithm, this method is not the best hybrid method for SKF-GSA and SKF-PSO.²¹

A fairly recent SKF hybrid is the hybridization between SKF with SCA in 2018.¹⁸ The SCA algorithm is formulated using the mathematical sine and cosine term. In the hybrid version of SKF and SCA, namely the Kalman Filter-based Sine Cosine Algorithm (KFSCA), the prediction and estimation phases of SKF are implemented in SCA. Instead of using the simulated measurement equation of SKF during the measurement phase, SCA equations are used to update the individual agent’s position. Five unimodal benchmark functions are used to compare the performance of the hybrid KFSCA algorithm with the original SKF and SCA algorithm. The statistical results showed that the KFSCA performed significantly better than the original SKF and SCA algorithms, and had a higher convergence rate compared to the original SKF algorithm.

Other improvement methods

High convergence rate is a signature for all Kalman filter-based algorithms. While most researchers tried many ways to introduce more explorations to prevent the SKF algorithm from prematurely converging due to its fast convergence speed, Mat Jusof et al. opined that a faster convergence speed was favored especially in solving unimodal problems.²² In his paper, Simulated Kalman Filter with Improved Accuracy, a new exponential-based SKF named SKFIA was introduced. This SKFIA algorithm uses modified equations in the estimation phase where exponential term is introduced in the calculation of the Kalman gain and the corresponding error covariance. Instead of using the suggestion constant for measurement noise, an exponential term is added in the calculation of the measurement noise and is made dependent on the predicted error covariance. This is to enable a large step size at the beginning of the search and smaller size towards the end. Performance evaluation comparing the SKFIA with the original SKF using the first four benchmark functions of CEC2014 (3 unimodal and 1 multimodal function) shows SKFIA is able to find better results compared to the original SKF.

SKF extensions

Besides being subjected to various modifications to improve its performance, SKF also has been modified to extend its usage. Three main extension of SKF are SKF algorithms for discrete problems, single solution version of SKF algorithm, and SKF for multi-objective problems.

SKF for discrete problems

The first extension of SKF algorithm is to make it available to solve discrete problems. There are three approaches proposed by Md. Yusof et al. in solving combinatorial optimization problems using SKF, giving birth to three new modified algorithms: the binary SKF (BSKF), angle modulated SKF (AMSKF) and distance evaluated SKF (DESKF).²³

Right after the introduction of SKF, Md. Yusof et al. published Binary SKF (BSKF) algorithm to enable SKF to operate in binary search space BSKF.²⁴ This is followed by the publication of DESKF and AMSKF a year later.²⁵^,²⁶ Another variant of the DESKF is the local optimum DESKF algorithm²⁷ and the DESKF with state encoding.²⁸ All these discrete SKF algorithms are meant to solve binary problems. The state-encoded DESKF (SEDESKF) was introduced in 2018 to solve combinatorial optimization problems that were not in binary search space.

Single-solution Simulated Kalman Filter (ssSKF)

In the analysis on the number of agents towards the performance of the SKF optimizer, the results showed that the SKF algorithm performed its best at a surprisingly large population of 700 agents.²⁹ Due to this reason, another variant of the SKF algorithm was introduced in 2018 which was a single agent version of the SKF algorithm.³⁰ In order to use the same equations as the SKF algorithm, a prediction operator needs to be introduced during the prediction phase. Thus, a simple local adaptive neighborhood method centered around the best-found solution so far is used to predict the location of the optimum solution. However, the introduction of this new adaptive prediction operator introduces another parameter. The ssSKF algorithm with adaptive coefficient value of 5 is proven to be significantly better than the original SKF of 100 agents. Another tutorial published in 2019 can be referred to understand the difference between the population-based and the single-solution algorithm.³¹ The parameter tuning analysis published last year revealed that ssSKF performed best when the adaptive coefficient was set at 10.³²

Multiobjective SKF

The last but quite significant extension of SKF is the introduction of multi-objective SKF (MOSKF).³³ Research on multi-objective algorithm is gaining attention worldwide because it deals with problems with two or more objectives that might be conflicting to one another. The SKF is transformed into MOSKF by applying the non-dominated sorting approach. Each agent is associated with cost function value and diversity spacing parameter. Besides that, the mutation and crossover operators are also adopted in MOSKF. Only a limited number of agents undergo mutations and crossovers to reduce the complexity of the algorithm while at the same time promote randomness. The experimental results on three multi-objective benchmark functions showed MOSKF performed better than the Non-dominated Sorting Genetic Algorithm II. However, this MOSKF has no real-world application or has not been subjected to solve more complex problems yet.

SKF applications

Applications of SKF algorithm and its variants can be categorized into nine different area of applications:

A. Drill path optimization
B. Airport gate allocation problem (AGAP)
C. Assembly sequence planning (ASP)
D. System identification
E. Feature selection
F. Image template matching
G. Controller tuning
H. Wireless sensor network
I. Engineering design problem

Table 1 shows the summary of applications of SKF algorithm and its variants in the 9 fields mentioned above.

Table 1. Summary of SKF variants applications.

Field	SKF	SKF +OBL	Modi-fied SKF	SS SKF	B SKF	AM SKF	DE SKF
[A]	34			35
[B]					36	37
[C]						38	39
[D]	40, 41
[E]	42				43	44	45
[F]	46–48
[G]	49–52
[H]	53
[I]	54	55, 56	57	58, 59

SKF: simulated Kalman filter, SKF+OBL: SKF – opposition-based learning, SSSKF: single solution SKF, BSKF: binary SKF, AMSKF: angle modulated SKF, DESKF: distance evaluated SKF.

Conclusions

In this paper, we provided a brief review of SKF, its improvements, extensions and applications. It does not include any comparison study between SKF and other algorithms. Since the introduction of SKF at the end of 2015, more than 57 papers have been published. The majority of them focused on methods to improve the SKF performance and their applications in various fields due to its simple implementation and fast convergence behavior. However, additional works might need to be done to test the algorithms performance to solve more complex applications and large-scale problems, especially for multi-objective optimization. Another interesting area to explore is on improving the exploration of the single agent version of SKF since no single work has been carried out yet for the ssSKF algorithm.

Data availability

No data associated with this paper.

Author contributions

NHAA & NAAA: wrote most of the manuscript.

ZI & MSM: revised the manuscript.

MRK: compiled all SKF related papers.

Acknowledgements

The authors would like to acknowledge all parties directly or indirectly involved in the preparation of this review paper.

References

1. Kalman RE: A new approach to linear filtering and prediction problems. J. Fluids Eng. Trans. ASME. 1960; 82(1): 35–45. Publisher Full Text
2. Toscano R, Lyonnet P: Heuristic kalman algorithm for solving optimization problems. IEEE Trans. Syst. Man, Cybern. Part B Cybern. 2009; 39(5): 1231–1244. Publisher Full Text
3. Ibrahim Z, et al.: A Kalman filter approach for solving unimodal optimization problems. ICIC Express Lett. 2015; 9(12): 3415–3422.
4. Abdul Aziz NH, Ibrahim Z, Razali S, et al.: Estimation-based Metaheuristics: A New Branch of Computational Intelligence. Natl. Conf. Postgrad. Res. 2016(NCON-PGR). 2016: 469–476.
5. Ibrahim Z, Abdul Aziz NH, Nor NA, et al.: Simulated Kalman Filter: A novel estimation-based metaheuristic optimization algorithm. Adv. Sci. Lett. 2016; 22(10): 2941–2946. Publisher Full Text
6. Abdul Aziz NH, et al.: A Tutorial on Population-based Simulated Kalman Filter. Mekatronika. 2019; 1(2): 33–44. Publisher Full Text
7. Abdul Aziz NH, Ibrahim Z, Razali S, et al.: How Important the Error Covariance in Simulated Kalman Filter? Natl. Conf. Postgrad. Res. 2016. 2016; 315–320.
8. Abdul Aziz NH, et al.: Simulated Kalman Filter with Randomized Q and R Parameters. Proc. Int. Conf. Artif. Life Robot. 2017; 22(Icarob 2017): 711–714. Publisher Full Text
9. Abdul Aziz NH, Ibrahim Z, Ab Aziz NA, et al.: Parameter-Less Simulated Kalman Filter. Int. J. Softw. Eng. Comput. Syst. 2017; 3(February): 129–137. Publisher Full Text
10. Ibrahim Z, et al.: An oppositional learning prediction operator for simulated kalman filter. Proc. - 3rd Int. Conf. Comput. Intell. Appl. ICCIA 2018. 2018: 195–199. Publisher Full Text
11. Muhammad B, Ibrahim Z, Shapiai MI, et al.: Oppositional learning prediction operator with jumping rate for simulated kalman filter. 2019 Int. Conf. Comput. Inf. Sci. ICCIS 2019. 2019; pp. 0–5. Publisher Full Text
12. Mohd Azmi KZ, Ibrahim Z, Pebrianti D, et al.: Enhancing simulated Kalman filter algorithm using current optimum opposition-based learning. J. Intell. Manuf. Mechatronics. 2019; 01(01): 1–13. Publisher Full Text
13. Ab Aziz NA, Aziz ZI, Aziz NHA, et al.: A fitness-based adaptive synchronous-asynchronous switching in simulated kalman filter optimizer. 2019 Int Conf Computer Information Sci, ICCIS 2019. May 2019: 1–5. Publisher Full Text
14. Ab Aziz NA, Rahman TA, Aziz NHA: Fitness-evaluated Adaptive Switching Simulated Kalman Filter Algorithm with Randomness. Mekatronika. 2019; 1(2): 45–65. Publisher Full Text
15. Ab Aziz NA, et al.: A Diversity-Based Adaptive Synchronous-Asynchronous Switching Simulated Kalman Filter Optimizer. 2019; 632(July).
16. Muhammad B, et al.: A new hybrid simulated Kalman filter and particle swarm optimization for continuous numerical optimization problems. ARPN J. Eng. Appl. Sci. 2015; 10(22): 17171–17176.
17. Muhammad B, Ibrahim Z, Mat Jusof MF, et al.: A Hybrid Simulated Kalman Filter - Gravitational Search Algorithm (SKF-GSA). Proc. Int. Conf. Artif. Life Robot. 2017; 22(1): 707–710. Publisher Full Text
18. Mat Jusof MF, et al.: A Kalman-Filter-Based Sine-Cosine Algorithm. 2018 IEEE Int Conf Automatic Control Intelligent Systems (I2CACIS 2018). 2018: 137–141.
19. Muhammad B, et al.: Four Different Methods to Hybrid Simulated Kalman Filter (SKF) with Gravitational Search Algorithm (GSA). National Conf Postgraduate Res. 2016. 2016: 854–864.
20. Muhammad B, et al.: Four Different Methods to Hybrid Simulated Kalman Filter (SKF) with Particle Swarm Optimization (PSO). National Conf Postgraduate Res. 2016. 2016: 843–853.
21. Muhammad B, et al.: Performance Evaluation of Hybrid SKF Algorithms: Hybrid SKF-PSO and Hybrid SKF-GSA. Natl. Conf. Postgrad. Res. 2016; 2016: 865–874.
22. Mat Jusof MF, et al.: Simulated Kalman Filter Algorithm with Improved Accuracy. 2019; vol. 538. . Springer Singapore.
23. Md Yusof Z, et al.: Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter. National Conf Postgraduate Res 2016. 2016: 951–960.
24. Md Yusof Z, Ibrahim I, Satiman SN, et al.: BSKF: Simulated kalman filter. Proc - AIMS 2015, 3rd Int Conf Artificial Intelligence, Modelling Simulation. 2015: 77–81. Publisher Full Text
25. Md Yusof Z, et al.: Distance evaluated simulated Kalman filter algorithm for combinatorial optimization problems. ARPN J. Eng. Appl. Sci. 2016; 11(7): 4911–4916.Reference Source
26. Md Yusof Z, et al.: Angle modulated simulated kalman filter algorithm for combinatorial optimization problems. ARPN J. Eng. Appl. Sci. 2016; 11(7): 4854–4859.
27. Md Yusof Z, et al.: Local Optimum Distance Evaluated Simulated Kalman Filter for Combinatorial Optimization Problems. National Conf Postgraduate Res 2016, Universiti Malaysia Pahang. 2016: 892–901.
28. Md Yusof Z, et al.: Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems. Int. J. Eng. Technol. 2018; 7(4): 22–29. Publisher Full Text
29. Abdul Aziz NH, et al.: An analysis on the number of agents towards the performance of the simulated kalman filter optimizer. Proc. - Int. Conf. Intell. Syst. Model. Simulation, ISMS. 2018; (2018-May): 16, 21. Publisher Full Text
30. Abdul Aziz NH, Ibrahim Z, Ab Aziz NA, et al.: Single-solution Simulated Kalman Filter algorithm for global optimisation problems. Sadhana - Acad. Proc. Eng. Sci. 2018; 43(7): 1–15. Publisher Full Text
31. Abdul Aziz NH, et al.: A Tutorial on Single-solution Simulated Kalman Filter. Mekatronika. 2019; 1(2): 33–44. Publisher Full Text
32. Abdul Aziz NH, et al.: Parameter tuning in the single-solution simulated Kalman filter optimizer. Lecture Notes in Mechanical Engineering. Springer;2020, pp. 48–56.
33. Azwan A, Razak A, Jusof MFM, et al.: A multiobjective simulated Kalman filter optimization algorithm. Proc 4th IEEE Int Conf Applied System Innovation 2018, ICASI 2018. 2018: 23–26. Publisher Full Text
34. Aziz NHA, Ab Aziz NA, Ibrahim Z, et al.: A Kalman Filter approach to PCB drill path optimization problem. Proc - 2016 IEEE Conf Systems, Process and Control, ICSPC 2016. 2017: 33–36. Publisher Full Text
35. Aziz NHA, Ibrahim Z, Aziz NAA, et al.: Single-solution simulated kalman filter algorithm for routing in printed circuit board drilling process. Lecture Notes in Mechanical Engineering. 2018: 649–655.
36. Md Yusof Z, et al.: Solving Airport Gate Allocation Problem using Simulated Kalman Filter. Int Conf Knowledge Transfer. 2015; (December): 1–3.
37. Mohd Azmi KZ, et al.: Solving airport gate allocation problem using angle modulated simulated Kalman filter. National Conf Postgraduate Res 2016. 2016: 875–885.
38. Mustapa A, Yusof ZM, Adam A, et al.: Solving Assembly Sequence Planning using Angle Modulated Simulated Kalman Filter. IOP Conf. Ser. Mater. Sci. Eng. 2018; vol. 319, no. 1, pp. 0–6. Publisher Full Text
39. Mustapa A, Ibrahim Z, Md Yusof Z, et al.: Solving Assembly Sequence Planning using Distance Evaluated Simulated Kalman Filter. J. Intell. Manuf. Mechatronics. 2019; 319(02): 012044–012047. Publisher Full Text
40. Mohd Azmi KZ, Ibrahim Z, Pebrianti D, et al.: Simultaneous computation of model order and parameter estimation for ARX model based on single Swarm and Multi Swarm simulated Kalman filter. J. Telecommun. Electron. Comput. Eng. 2017; 9(1–3): 151–155.
41. Muhammad B, Mohd Azmi KZ, Ibrahim Z, et al.: Simultaneous computation of model order and parameter estimation for system identification based on opposition-based simulated Kalman Filter. 2018 SICE International Symposium on COntrol Systems (SICE ISCS). 2018: 105–112.
42. Ahmad Zamri N, Bhuvaneswari T, Aziz NAA, et al.: Feature selection using simulated Kalman filter (SKF) for prediction of body fat percentage. ACM Int Conf Proc Series. 2018: 23–27. Publisher Full Text
43. Muhammad B, et al.: Feature selection using binary simulated kalman filter for peak classification of EEG signals. Proc - Int Conf Intelligent Systems, Modelling Simulation, ISMS. 2018: 1–6. Publisher Full Text
44. Adam A, Ibrahim Z, Mokhtar N, et al.: Feature selection using angle modulated simulated Kalman filter for peak classification of EEG signals. Springerplus. 2016; 5(1580): 1–24. Publisher Full Text
45. Adam A, Muhammad B: Distance evaluated simulated kalman filter algorithm for peak classification of EEG signals. Int. J. Simul. Syst. Sci. Technol. 2018; 19(5): 6.1–6.7. Publisher Full Text
46. Ann NQ, Pebrianti D, Ibrahim Z, et al.: Illumination-invariant image matching based on Simulated Kalman Filter (SKF) algorithm. J. Telecommun. Electron. Comput. Eng. 2018; 10(1–3): 31–36.
47. Ann NQ, et al.: SKF-based image template matching for distance measurement by using stereo vision. Springer Singapore;2018.
48. Ann NQ, Pebrianti D, Ibrahim Z, et al.: Image template matching based on Simulated Kalman Filter (SKF) algorithm. J. Telecommun. Electron. Comput. Eng. 2018; 10(2–7): 37–41.
49. Muhammad B, et al.: An application of simulated Kalman filter optimization algorithm for parameter tuning in proportional-integral-derivative controllers for automatic voltage regulator system. SICE ISCS 2018-2018 SICE International Symposium on Control Systems. 2018: 113–120. Publisher Full Text
50. Mat Jusof MF, Nasir ANK, Ahmad MA, et al.: An exponential based simulated Kalman filter algorithm for data-driven PID tuning in liquid slosh controller. Proc 4th IEEE Int Conf Applied System Innovation 2018, ICASI 2018. 2018: 984–987. Publisher Full Text
51. Ramli MS, Sian SM, Salim MN, et al.: A Fictitious Reference Iterative Tuning Method for Buck Converter-Powered DC Motor Control System. Lecture Notes in Electrical Engineering. 2019: 47–58.
52. Taha Z, et al.: The control of an upper extremity exoskeleton for stroke rehabilitation by means of a hybrid active force control. Springer International Publishing;2019; vol. 751. .
53. Ab Aziz NA, Ibrahim Z, Aziz NHA, et al.: Simulated kalman filter optimization algorithm for maximization of wireless sensor networks coverage.May 2019. Publisher Full Text
54. Lazarus K, Noordin NH, Mat Jusof MF, et al.: Adaptive Beamforming Algorithm based on a Simulated Kalman Filter. Int. J. Simul. Syst. Sci. Technol. 2016; 18(4): 10.1–10.5. Publisher Full Text
55. Lazarus K, Noordin NH, Mohd Azmi KZ, et al.: Adaptive Beamforming Algorithm based on Generalized Opposition-based Simulated Kalman Filter. National Conf Postgraduate Res 2016, Universiti Malaysia Pahang. 2016: 1–9.
56. Lazarus K, et al.: An opposition-based simulated kalman filter algorithm for adaptive beamforming. Proc. 2017 IEEE Int. Conf. Appl. Syst. Innov. Appl. Syst. Innov. Mod. Technol. ICASI 2017. 2017; 4: 91–94. Publisher Full Text
57. Lazarus K, Noordin NH, Ibrahim Z: An Enhanced Simulated Kalman Filter Algorithm and its Application in Adaptive Beamforming. RFM 2018-2018 IEEE International RF and Microwave Conference, Proceedings. 2018: 321–324. Publisher Full Text
58. Fauzi H, Batool U: A Three-bar Truss Design using Single-solution Simulated Kalman Filter Optimizer. Mekatronika. 2019; 1(2): 98–102. Publisher Full Text
59. Azzam MA, Batool U, Fauzi H: Design of an Helical Spring using Single-solution Simulated Kalman Filter Optimizer. Mekatronika. 2019; 1(2): 93–97. Publisher Full Text

Comments on this article Comments (0)

Version 1

VERSION 1 PUBLISHED 25 Oct 2021

Author details Author details

¹ Faculty of Engineering and Technology,, Multimedia University, Melaka, Malaysia
² College of Engineering, Universiti Malaysia Pahang, Gambang, Kuantan, Malaysia
³ Department of Genetics and Genomics, College of Medical and Health Sciences, United Arab Emirates University, Abu Dhabi, United Arab Emirates
⁴ Texas Instruments Electronics Malaysia, Melaka, Malaysia

Nor Hidayati Abdul Aziz
Roles: Conceptualization, Formal Analysis, Funding Acquisition, Writing – Original Draft Preparation

Zuwairie Ibrahim
Roles: Writing – Review & Editing

Nor Azlina Ab. Aziz
Roles: Conceptualization, Writing – Review & Editing

Mohd Saberi Mohamad
Roles: Writing – Review & Editing

Muhammad Razlan Kamaruzaman
Roles: Data Curation, Investigation

Competing interests

No competing interests were disclosed.

Grant information

This project is funded by the Multimedia University (MMU) IRFund, MMUI/210015. The authors would like to acknowledge all parties directly or indirectly involved in the preparation of this review paper.
The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Article Versions (1)

version 1

Published: 25 Oct 2021, 10:1081

https://doi.org/10.12688/f1000research.73242.1

Copyright

© 2021 Abdul Aziz NH et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Download

Export To

metrics

	Views	Downloads
F1000Research	-	-
PubMed Central Data from PMC are received and updated monthly.	-	-

Citations

0

SEE MORE DETAILS

CITE

how to cite this article

Abdul Aziz NH, Ibrahim Z, Ab. Aziz NA et al. A brief review of simulated Kalman Filter Algorithm – variants and applications [version 1; peer review: 2 approved with reservations]. F1000Research 2021, 10:1081 (https://doi.org/10.12688/f1000research.73242.1)

NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article.

track

receive updates on this article

Track an article to receive email alerts on any updates to this article.

Open Peer Review

Version 1

VERSION 1

PUBLISHED 25 Oct 2021

Views

7

Reviewer Report 21 Apr 2022

Komeil Nosrati, Centre for Intelligent Systems, Tallinn University of Technology, Tallinn, Estonia

Approved with Reservations

https://doi.org/10.5256/f1000research.76883.r126077

In my opinion, the methods in 57 papers will be compared together. Their advantages and disadvantages need to be listed in a table. Some simulation and example can make the topic clearer and help the readers to make a difference ... Continue reading

In my opinion, the methods in 57 papers will be compared together. Their advantages and disadvantages need to be listed in a table. Some simulation and example can make the topic clearer and help the readers to make a difference between the presented algorithms. I am also wondering if there is any work related to the nonlinear SKF. I think the literature review has not been covered completely.

Also, the structure and organization of the paper needs to be modified. In case, the abstract is too long, and the introduction is too short.

Is the topic of the review discussed comprehensively in the context of the current literature?

Partly
Are all factual statements correct and adequately supported by citations?

Yes
Is the review written in accessible language?

Yes
Are the conclusions drawn appropriate in the context of the current research literature?

Partly

Competing Interests: No competing interests were disclosed.

Reviewer Expertise: Kalman Filtering, Estimation, Fractional Calculus and Descriptor Systems

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.

CITE

Report a concern

Respond or Comment

Views

16

Reviewer Report 21 Feb 2022

Roberta Veloso Garcia, Lorena School of Engineering (EEL), University of São Paulo (USP), São Paulo, Brazil

Approved with Reservations

https://doi.org/10.5256/f1000research.76883.r120972

The purpose of the article is to present an overview of the progress of SKF research from the day it was introduced to the present day, discussing SKF progress, improvements, modifications and applications. The importance of the proposal is due ... Continue reading

The purpose of the article is to present an overview of the progress of SKF research from the day it was introduced to the present day, discussing SKF progress, improvements, modifications and applications. The importance of the proposal is due to the researchers' work on ideas to improve SKF's exploitability to avoid premature convergence of the algorithm, trying prediction operators, opposition-based learning and different iteration strategies. There have also been attempts to hybridize SKF with other algorithms to improve their performance. A SKF single-agent variant and a multi-purpose SKF were also introduced. SKF algorithms and their variants have been implemented in at least nine application areas, all cited in this article.

Some comments and suggestions are pointed out below, in order to resolve doubts and contribute to the excellence of the work:

The subject reviewed is relevant, since studies that approach optimal estimation have been the object of interest of several researchers in different areas. In addition, having an overview of how such studies have been advancing provides a more robust parameter for researchers to dedicate themselves to areas that have not yet been explored.
In Figure 1, several fundamental terms and indices for the KF appear. I suggest defining them in the text.
In “The SKF Improvement”, the so-called premature convergence is cited in several studies. In this case, the authors must define what this convergence means, in addition to explaining why it is not appropriate, since the convergence of filters is always something desirable.
On page 5, 1st paragraph, I suggest that the authors detail better why and in what aspects the 4th model is better than the hybrid methods (SKF-GSA and SKF-PSO).
In table 1, check the writing “Modi-fied SKF” or “Modified SKF”.
In “SKF Applications”, the authors were too succinct. I suggest, if possible, detailing why the algorithms were chosen for the cited applications. Note that the Modi-fied SKF algorithm is in only one application and SKF is in practically all applications. What is this fact due to?
The conclusions were superficial, given the importance of the work. Even though it is a review article, it is necessary to explore in greater detail the improvements obtained and under which applications they are most relevant in relation to SKF. The authors cite that of the more than 57 published articles, most focus on methods to improve SKF performance. However, in table 1, it is noted that in terms of applications, SKF is still the most discussed. Is there any explanation, since the purpose of improving the performance of algorithms is to have better results in applications?

Is the topic of the review discussed comprehensively in the context of the current literature?

Yes
Are all factual statements correct and adequately supported by citations?

Yes
Is the review written in accessible language?

Yes
Are the conclusions drawn appropriate in the context of the current research literature?

Partly

Competing Interests: No competing interests were disclosed.

Reviewer Expertise: Specialist in optimal estimation methods, with emphasis on Kalman filters applied to aerospace engineering.

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.

CITE

Report a concern

Respond or Comment

Comments on this article Comments (0)

Version 1

VERSION 1 PUBLISHED 25 Oct 2021

Open Peer Review

Reviewer Status

Reviewer Reports

	Invited Reviewers
	1	2
Version 1 25 Oct 21	read	read

Roberta Veloso Garcia, University of São Paulo (USP), São Paulo, Brazil
Komeil Nosrati, Tallinn University of Technology, Tallinn, Estonia

Comments on this article

All Comments(0)

Add a comment

Sign up for content alerts

Browse by related subjects

Back to all reports

Reviewer Report

7 Views

21 Apr 2022 | for Version 1

Komeil Nosrati, Centre for Intelligent Systems, Tallinn University of Technology, Tallinn, Estonia

7 Views Cite this report Responses(0)

Approved With Reservations

In my opinion, the methods in 57 papers will be compared together. Their advantages and disadvantages need to be listed in a table. Some simulation and example can make the topic clearer and help the readers to make a difference between the presented algorithms. I am also wondering if there is any work related to the nonlinear SKF. I think the literature review has not been covered completely.

Also, the structure and organization of the paper needs to be modified. In case, the abstract is too long, and the introduction is too short.

Is the topic of the review discussed comprehensively in the context of the current literature?

Partly
Are all factual statements correct and adequately supported by citations?

Yes
Is the review written in accessible language?

Yes
Are the conclusions drawn appropriate in the context of the current research literature?

Partly

Competing Interests

No competing interests were disclosed.

Reviewer Expertise

Kalman Filtering, Estimation, Fractional Calculus and Descriptor Systems

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.

Respond to this report

Responses (0)

Back to all reports

Reviewer Report

16 Views

21 Feb 2022 | for Version 1

Roberta Veloso Garcia, Lorena School of Engineering (EEL), University of São Paulo (USP), São Paulo, Brazil

16 Views Cite this report Responses(0)

Approved With Reservations

The purpose of the article is to present an overview of the progress of SKF research from the day it was introduced to the present day, discussing SKF progress, improvements, modifications and applications. The importance of the proposal is due to the researchers' work on ideas to improve SKF's exploitability to avoid premature convergence of the algorithm, trying prediction operators, opposition-based learning and different iteration strategies. There have also been attempts to hybridize SKF with other algorithms to improve their performance. A SKF single-agent variant and a multi-purpose SKF were also introduced. SKF algorithms and their variants have been implemented in at least nine application areas, all cited in this article.

Some comments and suggestions are pointed out below, in order to resolve doubts and contribute to the excellence of the work:

The subject reviewed is relevant, since studies that approach optimal estimation have been the object of interest of several researchers in different areas. In addition, having an overview of how such studies have been advancing provides a more robust parameter for researchers to dedicate themselves to areas that have not yet been explored.
In Figure 1, several fundamental terms and indices for the KF appear. I suggest defining them in the text.
In “The SKF Improvement”, the so-called premature convergence is cited in several studies. In this case, the authors must define what this convergence means, in addition to explaining why it is not appropriate, since the convergence of filters is always something desirable.
On page 5, 1st paragraph, I suggest that the authors detail better why and in what aspects the 4th model is better than the hybrid methods (SKF-GSA and SKF-PSO).
In table 1, check the writing “Modi-fied SKF” or “Modified SKF”.
In “SKF Applications”, the authors were too succinct. I suggest, if possible, detailing why the algorithms were chosen for the cited applications. Note that the Modi-fied SKF algorithm is in only one application and SKF is in practically all applications. What is this fact due to?
The conclusions were superficial, given the importance of the work. Even though it is a review article, it is necessary to explore in greater detail the improvements obtained and under which applications they are most relevant in relation to SKF. The authors cite that of the more than 57 published articles, most focus on methods to improve SKF performance. However, in table 1, it is noted that in terms of applications, SKF is still the most discussed. Is there any explanation, since the purpose of improving the performance of algorithms is to have better results in applications?

Is the topic of the review discussed comprehensively in the context of the current literature?

Yes
Are all factual statements correct and adequately supported by citations?

Yes
Is the review written in accessible language?

Yes
Are the conclusions drawn appropriate in the context of the current research literature?

Partly

Competing Interests

No competing interests were disclosed.

Reviewer Expertise

Specialist in optimal estimation methods, with emphasis on Kalman filters applied to aerospace engineering.

I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.

Respond to this report

Responses (0)

[1] 1. Kalman RE: A new approach to linear filtering and prediction problems. J. Fluids Eng. Trans. ASME. 1960; 82(1): 35–45. Publisher Full Text

[2] 2. Toscano R, Lyonnet P: Heuristic kalman algorithm for solving optimization problems. IEEE Trans. Syst. Man, Cybern. Part B Cybern. 2009; 39(5): 1231–1244. Publisher Full Text

[3] 3. Ibrahim Z, et al.: A Kalman filter approach for solving unimodal optimization problems. ICIC Express Lett. 2015; 9(12): 3415–3422.

[4] 4. Abdul Aziz NH, Ibrahim Z, Razali S, et al.: Estimation-based Metaheuristics: A New Branch of Computational Intelligence. Natl. Conf. Postgrad. Res. 2016(NCON-PGR). 2016: 469–476.

[5] 5. Ibrahim Z, Abdul Aziz NH, Nor NA, et al.: Simulated Kalman Filter: A novel estimation-based metaheuristic optimization algorithm. Adv. Sci. Lett. 2016; 22(10): 2941–2946. Publisher Full Text

[6] 6. Abdul Aziz NH, et al.: A Tutorial on Population-based Simulated Kalman Filter. Mekatronika. 2019; 1(2): 33–44. Publisher Full Text

[7] 7. Abdul Aziz NH, Ibrahim Z, Razali S, et al.: How Important the Error Covariance in Simulated Kalman Filter? Natl. Conf. Postgrad. Res. 2016. 2016; 315–320.

[8] 8. Abdul Aziz NH, et al.: Simulated Kalman Filter with Randomized Q and R Parameters. Proc. Int. Conf. Artif. Life Robot. 2017; 22(Icarob 2017): 711–714. Publisher Full Text

[9] 9. Abdul Aziz NH, Ibrahim Z, Ab Aziz NA, et al.: Parameter-Less Simulated Kalman Filter. Int. J. Softw. Eng. Comput. Syst. 2017; 3(February): 129–137. Publisher Full Text

[10] 10. Ibrahim Z, et al.: An oppositional learning prediction operator for simulated kalman filter. Proc. - 3rd Int. Conf. Comput. Intell. Appl. ICCIA 2018. 2018: 195–199. Publisher Full Text

[11] 11. Muhammad B, Ibrahim Z, Shapiai MI, et al.: Oppositional learning prediction operator with jumping rate for simulated kalman filter. 2019 Int. Conf. Comput. Inf. Sci. ICCIS 2019. 2019; pp. 0–5. Publisher Full Text

[12] 12. Mohd Azmi KZ, Ibrahim Z, Pebrianti D, et al.: Enhancing simulated Kalman filter algorithm using current optimum opposition-based learning. J. Intell. Manuf. Mechatronics. 2019; 01(01): 1–13. Publisher Full Text

[13] 13. Ab Aziz NA, Aziz ZI, Aziz NHA, et al.: A fitness-based adaptive synchronous-asynchronous switching in simulated kalman filter optimizer. 2019 Int Conf Computer Information Sci, ICCIS 2019. May 2019: 1–5. Publisher Full Text

[14] 14. Ab Aziz NA, Rahman TA, Aziz NHA: Fitness-evaluated Adaptive Switching Simulated Kalman Filter Algorithm with Randomness. Mekatronika. 2019; 1(2): 45–65. Publisher Full Text

[15] 15. Ab Aziz NA, et al.: A Diversity-Based Adaptive Synchronous-Asynchronous Switching Simulated Kalman Filter Optimizer. 2019; 632(July).

[16] 16. Muhammad B, et al.: A new hybrid simulated Kalman filter and particle swarm optimization for continuous numerical optimization problems. ARPN J. Eng. Appl. Sci. 2015; 10(22): 17171–17176.

[17] 17. Muhammad B, Ibrahim Z, Mat Jusof MF, et al.: A Hybrid Simulated Kalman Filter - Gravitational Search Algorithm (SKF-GSA). Proc. Int. Conf. Artif. Life Robot. 2017; 22(1): 707–710. Publisher Full Text

[18] 18. Mat Jusof MF, et al.: A Kalman-Filter-Based Sine-Cosine Algorithm. 2018 IEEE Int Conf Automatic Control Intelligent Systems (I2CACIS 2018). 2018: 137–141.

[19] 19. Muhammad B, et al.: Four Different Methods to Hybrid Simulated Kalman Filter (SKF) with Gravitational Search Algorithm (GSA). National Conf Postgraduate Res. 2016. 2016: 854–864.

[20] 20. Muhammad B, et al.: Four Different Methods to Hybrid Simulated Kalman Filter (SKF) with Particle Swarm Optimization (PSO). National Conf Postgraduate Res. 2016. 2016: 843–853.

[21] 21. Muhammad B, et al.: Performance Evaluation of Hybrid SKF Algorithms: Hybrid SKF-PSO and Hybrid SKF-GSA. Natl. Conf. Postgrad. Res. 2016; 2016: 865–874.

[22] 22. Mat Jusof MF, et al.: Simulated Kalman Filter Algorithm with Improved Accuracy. 2019; vol. 538. . Springer Singapore.

[23] 23. Md Yusof Z, et al.: Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter. National Conf Postgraduate Res 2016. 2016: 951–960.

[24] 24. Md Yusof Z, Ibrahim I, Satiman SN, et al.: BSKF: Simulated kalman filter. Proc - AIMS 2015, 3rd Int Conf Artificial Intelligence, Modelling Simulation. 2015: 77–81. Publisher Full Text

[25] 25. Md Yusof Z, et al.: Distance evaluated simulated Kalman filter algorithm for combinatorial optimization problems. ARPN J. Eng. Appl. Sci. 2016; 11(7): 4911–4916.Reference Source

[26] 26. Md Yusof Z, et al.: Angle modulated simulated kalman filter algorithm for combinatorial optimization problems. ARPN J. Eng. Appl. Sci. 2016; 11(7): 4854–4859.

[27] 27. Md Yusof Z, et al.: Local Optimum Distance Evaluated Simulated Kalman Filter for Combinatorial Optimization Problems. National Conf Postgraduate Res 2016, Universiti Malaysia Pahang. 2016: 892–901.

[28] 28. Md Yusof Z, et al.: Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems. Int. J. Eng. Technol. 2018; 7(4): 22–29. Publisher Full Text

[29] 29. Abdul Aziz NH, et al.: An analysis on the number of agents towards the performance of the simulated kalman filter optimizer. Proc. - Int. Conf. Intell. Syst. Model. Simulation, ISMS. 2018; (2018-May): 16, 21. Publisher Full Text

[30] 30. Abdul Aziz NH, Ibrahim Z, Ab Aziz NA, et al.: Single-solution Simulated Kalman Filter algorithm for global optimisation problems. Sadhana - Acad. Proc. Eng. Sci. 2018; 43(7): 1–15. Publisher Full Text

[31] 31. Abdul Aziz NH, et al.: A Tutorial on Single-solution Simulated Kalman Filter. Mekatronika. 2019; 1(2): 33–44. Publisher Full Text

[32] 32. Abdul Aziz NH, et al.: Parameter tuning in the single-solution simulated Kalman filter optimizer. Lecture Notes in Mechanical Engineering. Springer;2020, pp. 48–56.

[33] 33. Azwan A, Razak A, Jusof MFM, et al.: A multiobjective simulated Kalman filter optimization algorithm. Proc 4th IEEE Int Conf Applied System Innovation 2018, ICASI 2018. 2018: 23–26. Publisher Full Text

[34] 34. Aziz NHA, Ab Aziz NA, Ibrahim Z, et al.: A Kalman Filter approach to PCB drill path optimization problem. Proc - 2016 IEEE Conf Systems, Process and Control, ICSPC 2016. 2017: 33–36. Publisher Full Text

[35] 35. Aziz NHA, Ibrahim Z, Aziz NAA, et al.: Single-solution simulated kalman filter algorithm for routing in printed circuit board drilling process. Lecture Notes in Mechanical Engineering. 2018: 649–655.

[36] 36. Md Yusof Z, et al.: Solving Airport Gate Allocation Problem using Simulated Kalman Filter. Int Conf Knowledge Transfer. 2015; (December): 1–3.

[37] 37. Mohd Azmi KZ, et al.: Solving airport gate allocation problem using angle modulated simulated Kalman filter. National Conf Postgraduate Res 2016. 2016: 875–885.

[38] 38. Mustapa A, Yusof ZM, Adam A, et al.: Solving Assembly Sequence Planning using Angle Modulated Simulated Kalman Filter. IOP Conf. Ser. Mater. Sci. Eng. 2018; vol. 319, no. 1, pp. 0–6. Publisher Full Text

[39] 39. Mustapa A, Ibrahim Z, Md Yusof Z, et al.: Solving Assembly Sequence Planning using Distance Evaluated Simulated Kalman Filter. J. Intell. Manuf. Mechatronics. 2019; 319(02): 012044–012047. Publisher Full Text

[40] 40. Mohd Azmi KZ, Ibrahim Z, Pebrianti D, et al.: Simultaneous computation of model order and parameter estimation for ARX model based on single Swarm and Multi Swarm simulated Kalman filter. J. Telecommun. Electron. Comput. Eng. 2017; 9(1–3): 151–155.

[41] 41. Muhammad B, Mohd Azmi KZ, Ibrahim Z, et al.: Simultaneous computation of model order and parameter estimation for system identification based on opposition-based simulated Kalman Filter. 2018 SICE International Symposium on COntrol Systems (SICE ISCS). 2018: 105–112.

[42] 42. Ahmad Zamri N, Bhuvaneswari T, Aziz NAA, et al.: Feature selection using simulated Kalman filter (SKF) for prediction of body fat percentage. ACM Int Conf Proc Series. 2018: 23–27. Publisher Full Text

[43] 43. Muhammad B, et al.: Feature selection using binary simulated kalman filter for peak classification of EEG signals. Proc - Int Conf Intelligent Systems, Modelling Simulation, ISMS. 2018: 1–6. Publisher Full Text

[44] 44. Adam A, Ibrahim Z, Mokhtar N, et al.: Feature selection using angle modulated simulated Kalman filter for peak classification of EEG signals. Springerplus. 2016; 5(1580): 1–24. Publisher Full Text

[45] 45. Adam A, Muhammad B: Distance evaluated simulated kalman filter algorithm for peak classification of EEG signals. Int. J. Simul. Syst. Sci. Technol. 2018; 19(5): 6.1–6.7. Publisher Full Text

[46] 46. Ann NQ, Pebrianti D, Ibrahim Z, et al.: Illumination-invariant image matching based on Simulated Kalman Filter (SKF) algorithm. J. Telecommun. Electron. Comput. Eng. 2018; 10(1–3): 31–36.

[47] 47. Ann NQ, et al.: SKF-based image template matching for distance measurement by using stereo vision. Springer Singapore;2018.

[48] 48. Ann NQ, Pebrianti D, Ibrahim Z, et al.: Image template matching based on Simulated Kalman Filter (SKF) algorithm. J. Telecommun. Electron. Comput. Eng. 2018; 10(2–7): 37–41.

[49] 49. Muhammad B, et al.: An application of simulated Kalman filter optimization algorithm for parameter tuning in proportional-integral-derivative controllers for automatic voltage regulator system. SICE ISCS 2018-2018 SICE International Symposium on Control Systems. 2018: 113–120. Publisher Full Text

[50] 50. Mat Jusof MF, Nasir ANK, Ahmad MA, et al.: An exponential based simulated Kalman filter algorithm for data-driven PID tuning in liquid slosh controller. Proc 4th IEEE Int Conf Applied System Innovation 2018, ICASI 2018. 2018: 984–987. Publisher Full Text

[51] 51. Ramli MS, Sian SM, Salim MN, et al.: A Fictitious Reference Iterative Tuning Method for Buck Converter-Powered DC Motor Control System. Lecture Notes in Electrical Engineering. 2019: 47–58.

[52] 52. Taha Z, et al.: The control of an upper extremity exoskeleton for stroke rehabilitation by means of a hybrid active force control. Springer International Publishing;2019; vol. 751. .

[53] 53. Ab Aziz NA, Ibrahim Z, Aziz NHA, et al.: Simulated kalman filter optimization algorithm for maximization of wireless sensor networks coverage.May 2019. Publisher Full Text

[54] 54. Lazarus K, Noordin NH, Mat Jusof MF, et al.: Adaptive Beamforming Algorithm based on a Simulated Kalman Filter. Int. J. Simul. Syst. Sci. Technol. 2016; 18(4): 10.1–10.5. Publisher Full Text

[55] 55. Lazarus K, Noordin NH, Mohd Azmi KZ, et al.: Adaptive Beamforming Algorithm based on Generalized Opposition-based Simulated Kalman Filter. National Conf Postgraduate Res 2016, Universiti Malaysia Pahang. 2016: 1–9.

[56] 56. Lazarus K, et al.: An opposition-based simulated kalman filter algorithm for adaptive beamforming. Proc. 2017 IEEE Int. Conf. Appl. Syst. Innov. Appl. Syst. Innov. Mod. Technol. ICASI 2017. 2017; 4: 91–94. Publisher Full Text

[57] 57. Lazarus K, Noordin NH, Ibrahim Z: An Enhanced Simulated Kalman Filter Algorithm and its Application in Adaptive Beamforming. RFM 2018-2018 IEEE International RF and Microwave Conference, Proceedings. 2018: 321–324. Publisher Full Text

[58] 58. Fauzi H, Batool U: A Three-bar Truss Design using Single-solution Simulated Kalman Filter Optimizer. Mekatronika. 2019; 1(2): 98–102. Publisher Full Text

[59] 59. Azzam MA, Batool U, Fauzi H: Design of an Helical Spring using Single-solution Simulated Kalman Filter Optimizer. Mekatronika. 2019; 1(2): 93–97. Publisher Full Text

A brief review of simulated Kalman Filter Algorithm – variants and applications

Abstract

Keywords

Introduction

Simulated Kalman Filter (SKF) algorithm

Figure 1. Flowchart of SKF.

The SKF improvements

Opposition-based learning

Iteration strategy

Hybrid

Other improvement methods

SKF extensions

SKF for discrete problems

Single-solution Simulated Kalman Filter (ssSKF)

Multiobjective SKF

SKF applications

Table 1. Summary of SKF variants applications.

Conclusions

Data availability

Author contributions

Acknowledgements

References

Comments on this article Comments (0)

Open Peer Review

Comments on this article Comments (0)

Open Peer Review

Reviewer Status

Reviewer Reports

Comments on this article

Browse by related subjects

Competing Interests Policy

Stay Updated