A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filte...A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.展开更多
In this paper,we consider the NP-hard problem of finding the minimum dominant resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of dista...In this paper,we consider the NP-hard problem of finding the minimum dominant resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B.A resolving set is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B.The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set.The dominant metric dimension is computed by a binary version of the Archimedes optimization algorithm(BAOA).The objects of BAOA are binary encoded and used to represent which one of the vertices of the graph belongs to the dominant resolving set.The feasibility is enforced by repairing objects such that an additional vertex generated from vertices of G is added to B and this repairing process is iterated until B becomes the dominant resolving set.This is the first attempt to determine the dominant metric dimension problem heuristically.The proposed BAOA is compared to binary whale optimization(BWOA)and binary particle optimization(BPSO)algorithms.Computational results confirm the superiority of the BAOA for computing the dominant metric dimension.展开更多
This paper presents an efficient enhanced snake optimizer termed BEESO for global optimization and engineering applications.As a newly mooted meta-heuristic algorithm,snake optimizer(SO)mathematically models the matin...This paper presents an efficient enhanced snake optimizer termed BEESO for global optimization and engineering applications.As a newly mooted meta-heuristic algorithm,snake optimizer(SO)mathematically models the mating characteristics of snakes to find the optimal solution.SO has a simple structure and offers a delicate balance between exploitation and exploration.However,it also has some shortcomings to be improved.The proposed BEESO consequently aims to lighten the issues of lack of population diversity,convergence slowness,and the tendency to be stuck in local optima in SO.The presentation of Bi-Directional Search(BDS)is to approach the global optimal value along the direction guided by the best and the worst individuals,which makes the convergence speed faster.The increase in population diversity in BEESO benefits from Modified Evolutionary Population Dynamics(MEPD),and the replacement of poorer quality individuals improves population quality.The Elite Opposition-Based Learning(EOBL)provides improved local exploitation ability of BEESO by utilizing solid solutions with good performance.The performance of BEESO is illustrated by comparing its experimental results with several algorithms on benchmark functions and engineering designs.Additionally,the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank sum tests.The findings show that these introduced strategies provide some improvements in the performance of SO,and the accuracy and stability of the optimization results provided by the proposed BEESO are competitive among all algorithms.To conclude,the proposed BEESO offers a good alternative to solving optimization issues.展开更多
基金supported by National Natural Science Foundation of China (Nos.62265010,62061024)Gansu Province Science and Technology Plan (No.23YFGA0062)Gansu Province Innovation Fund (No.2022A-215)。
文摘A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.
文摘In this paper,we consider the NP-hard problem of finding the minimum dominant resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B.A resolving set is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B.The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set.The dominant metric dimension is computed by a binary version of the Archimedes optimization algorithm(BAOA).The objects of BAOA are binary encoded and used to represent which one of the vertices of the graph belongs to the dominant resolving set.The feasibility is enforced by repairing objects such that an additional vertex generated from vertices of G is added to B and this repairing process is iterated until B becomes the dominant resolving set.This is the first attempt to determine the dominant metric dimension problem heuristically.The proposed BAOA is compared to binary whale optimization(BWOA)and binary particle optimization(BPSO)algorithms.Computational results confirm the superiority of the BAOA for computing the dominant metric dimension.
基金supported by the National Natural Science Foundation of China (Grant No.51875454).
文摘This paper presents an efficient enhanced snake optimizer termed BEESO for global optimization and engineering applications.As a newly mooted meta-heuristic algorithm,snake optimizer(SO)mathematically models the mating characteristics of snakes to find the optimal solution.SO has a simple structure and offers a delicate balance between exploitation and exploration.However,it also has some shortcomings to be improved.The proposed BEESO consequently aims to lighten the issues of lack of population diversity,convergence slowness,and the tendency to be stuck in local optima in SO.The presentation of Bi-Directional Search(BDS)is to approach the global optimal value along the direction guided by the best and the worst individuals,which makes the convergence speed faster.The increase in population diversity in BEESO benefits from Modified Evolutionary Population Dynamics(MEPD),and the replacement of poorer quality individuals improves population quality.The Elite Opposition-Based Learning(EOBL)provides improved local exploitation ability of BEESO by utilizing solid solutions with good performance.The performance of BEESO is illustrated by comparing its experimental results with several algorithms on benchmark functions and engineering designs.Additionally,the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank sum tests.The findings show that these introduced strategies provide some improvements in the performance of SO,and the accuracy and stability of the optimization results provided by the proposed BEESO are competitive among all algorithms.To conclude,the proposed BEESO offers a good alternative to solving optimization issues.