Pure pursuit algorithm is one of the most effective ways of path tracking in autonomous vehicles. Nevertheless, the tracking accuracy of the existing pure pursuit algorithm is limited by the look-ahead distance. In this paper, to improve the tracking accuracy of the pure pursuit algorithm, a novel pure pursuit algorithm based on the optimized look-ahead distance named OLDPPA is proposed. Four improvements are presented in OLDPPA. Firstly, to find a better look-ahead distance of pure pursuit algorithm, salp swarm algorithm (SSA) is used in pure pursuit algorithm. Secondly, Brownian motion, a random motion mechanism of particles, is introduced in SSA to enhance its exploitation and exploration capabilities. Thirdly, to accelerate the convergence speed of SSA, a weighted mechanism which uses two different weights in the search process to adjust the salps closer to the food source quickly is assigned. Based on innovations 2 and 3, adaptive Brownian motion salp swarm algorithm (ABMSSA) is proposed and applied to pure pursuit algorithm. Finally, a velocity controller which outputs the speed of the next moment according to the distance and time interval between the look-ahead point and the current vehicle position is designed in OLDPPA, to ensure that the vehicle reaches its destination at a specified time. To verify the effectiveness and efficiency of OLDPPA, OLDPPA is applied in four different paths and the corresponding results are compared with other pure pursuit algorithms that use different look-ahead distances. Experimental results show that the tracking accuracy of OLDPPA is better than other algorithms.
Metaheuristic optimization algorithms are one of the most effective methods for solving complex engineering problems. However, the performance of a metaheuristic algorithm is related to its exploration ability and exploitation ability. Therefore, to further improve the African vultures optimization algorithm (AVOA), a new metaheuristic algorithm, an improved African vultures optimization algorithm based on tent chaotic mapping and time-varying mechanism (TAVOA), is proposed. First, a tent chaotic map is introduced for population initialization. Second, the individual’s historical optimal position is recorded and applied to individual location updating. Third, a time-varying mechanism is designed to balance the exploration ability and exploitation ability. To verify the effectiveness and efficiency of TAVOA, TAVOA is tested on 23 basic benchmark functions, 28 CEC 2013 benchmark functions and 3 common real-world engineering design problems, and compared with AVOA and 5 other state-of-the-art metaheuristic optimization algorithms. According to the results of the Wilcoxon rank-sum test with 5%, among the 23 basic benchmark functions, the performance of TAVOA has significantly better than that of AVOA on 13 functions. Among the 28 CEC 2013 benchmark functions, the performance of TAVOA on 9 functions is significantly better than AVOA, and on 17 functions is similar to AVOA. Besides, compared with the six metaheuristic optimization algorithms, TAVOA also shows good performance in real-world engineering design problems.
3D point cloud simplification is an important pretreatment in surface reconstruction for sparing computer resources and improving reconstruction speed. However, existing methods often sacrifice the simplification precision to improve the simplification speed, or sacrifice the speed to improve precision. A proper balance between the simplification speed and the simplification accuracy is still a challenge. In this paper, we propose a new simplification method based on the importance of point. Named as detail feature points simplified algorithm (DFPSA), this algorithm has distinct processes to achieve improvements in three aspects. First, a rule of k neighborhood search is set to ensure the points found are the closest to the sample point. In this way, the accuracy of calculated normal vector of the point cloud is significantly improved, and the search speed is largely increased. Second, a formula that considers multiple characteristics for measuring the importance of point is proposed. Thereupon, the main detail features of the point cloud are preserved. Finally, an octree structure is employed to simplify the remaining points, through which holes in reconstructing point cloud are obviously reduced. The DFPSA is applied to four different data sets, and the corresponding results are compared with those of other five algorithms. The experimental results demonstrate that the DFPSA brings better simplification effects than existing counterparts, and the DFPSA not only can simplify point cloud but also has good effect in simplifying subject’s narrow contours.
Feature selection, which eliminates irrelevant and redundant features, is one of the most efficient classification methods. However, searching for an optimal subset from the original set is still a challenging problem. This paper proposes a novel feature selection algorithm named hybrid improved dragonfly algorithm (HIDA) which combines the advantages of both mRMR and improved dragonfly algorithm (IDA) in order to generate promising candidate subset and achieve higher classification accuracy rate. Firstly, to generate promising subset, features with small weight have chance to be selected into candidate subset with a small probability in mRMR. Secondly, to balance the exploitation and exploration capabilities of IDA, dynamic swarming factors are proposed to balance global and local capability. Lastly, to enhance the exploitation capability of IDA, quantum local optimum and global optimum are introduced in the position updating mechanism. The performance of HIDA is investigated on ten gene expression datasets and eight UCI data sets from the UCI Machine Learning Data Repository. Results show that the performance of HIDA is superior to BBA, BDA, CDA, LBPSO, MPMDWOA and MSMCCS.
Q-learning is a classical reinforcement learning algorithm and one of the most important methods of mobile robot path planning without a prior environmental model. Nevertheless, Q-learning is too simple when initializing Q-table and wastes too much time in the exploration process, causing a slow convergence speed. This paper proposes a new Q-learning algorithm called the Paired Whale Optimization Q-learning Algorithm (PWOQLA) which includes four improvements. Firstly, to accelerate the convergence speed of Q-learning, a whale optimization algorithm is used to initialize the values of a Q-table. Before the exploration process, a Q-table which contains previous experience is learned to improve algorithm efficiency. Secondly, to improve the local exploitation capability of the whale optimization algorithm, a paired whale optimization algorithm is proposed in combination with a pairing strategy to speed up the search for prey. Thirdly, to improve the exploration efficiency of Q-learning and reduce the number of useless explorations, a new selective exploration strategy is introduced which considers the relationship between current position and target position. Fourthly, in order to balance the exploration and exploitation capabilities of Q-learning so that it focuses on exploration in the early stage and on exploitation in the later stage, a nonlinear function is designed which changes the value of ε in ε-greedy Q-learning dynamically based on the number of iterations. Comparing the performance of PWOQLA with other path planning algorithms, experimental results demonstrate that PWOQLA achieves a higher level of accuracy and a faster convergence speed than existing counterparts in mobile robot path planning. The code will be released at https://github.com/wanghanyu0526/improveQL.git.