Similarity calculation is the most important basic algorithm in collaborative filtering recommendation. It plays an important role in calculating the similarity between users (items), finding nearest neighbors, and predicting scores. However, the existing similarity calculation is affected by over reliance on item scores and data sparsity, resulting in low accuracy of recommendation results. This paper proposes a personalized recommendation algorithm based on information entropy and particle swarm optimization, which takes into account the similarity of users’ score and preference characteristics. It uses random particle swarm optimization to optimize their weights to obtain the comprehensive similarity value. Experimental results on public data sets show that the proposed method can effectively improve the accuracy of recommendation results on the premise of ensuring recommendation coverage.

To overcome the limitations of the Flamingo Search Algorithm (FSA), such as a tendency to converge on local optima and improve solution accuracy, we present an improved algorithm known as the Multi-Strategy Improved Flamingo Search Algorithm (IFSA). The IFSA utilizes a cube chaotic mapping strategy to generate initial populations, which enhances the quality of the initial solution set. Moreover, the information feedback model strategy is improved to dynamically adjust the model based on the current fitness value, which enhances the information exchange between populations and the search capability of the algorithm itself. In addition, we introduce the Random Opposition Learning and Elite Position Greedy Selection strategies to constantly retain superior individuals while also reducing the probability of the algorithm falling into a local optimum, thereby further enhancing the convergence of the algorithm. We evaluate the performance of the IFSA using 23 benchmark functions and verify its optimization using the Wilcoxon rank-sum test. The compared experiment results indicate that the proposed IFSA can obtain higher convergence accuracy and better exploration abilities. It also provides a new optimization algorithm for solving complex optimization problems.

Aiming at improving the mapping accuracy and autonomous navigation efficiency of rescue robot in unknown environment, an improved Hector SLAM based autonomous navigation strategy is proposed, which is implemented on the Levenberg-Marquardt optimization and Bezier smooth dynamic weighted A* algorithm. Firstly, the scan match process of Hector SLAM is performed by an improved Levenberg-Marquart (LM) method to solve the problems of non-convergence of functions and inaccurate local approximation caused by the non-singularity for solving the Hessian matrix. Secondly, the Bezier smooth dynamic weighted A* algorithm is utilized to perform autonomous navigation based on the SLAM map. In which, the navigation target points selection is employed by the frontier exploration strategy in order to solve the search efficiency as for the increasing number of nodes in the A* algorithm, and the accuracy of SLAM mapping declines owing to the large angle amplitude. Finally, the experiments are carried out in ROS, the results show that there is a better performance for proposed method to implement the high mapping accuracy and efficient autonomous navigation.

Personalized news recommendations focus on providing users with news that fits their interests and alleviates their information overload. User preference modeling is crucial for achieving personalized news recommendations, and user preferences are usually expressed as long-term and short-term user preferences. Existing news recommendation methods have difficulty accurately matching user preferences with candidate news, which is the main challenge plaguing the news recommendation field. For this purpose, we propose a novel news recommendation method based on candidate-aware long- and short-term preference modeling, named NRCLS. The method contains: (1) a Candidate-Enhanced graph attention network, which learns high-order structural information in graphs, mines the potential relationship between long-term user preferences and candidate news; and (2) a candidate-aware attention network that incorporates news subtopics. In this network, the dynamic impact of candidate news on short-term user preferences is considered. Results on real-world datasets demonstrate the effectiveness of our proposed method in improving the performance of news recommendations. We have also conducted several ablation studies that demonstrate the effectiveness of the core module in NRCLS.

Three-dimensional (3D) path planning is a crucial technology for ensuring the efficient and safe flight of UAVs in complex environments. Traditional path planning algorithms often find it challenging to navigate complex obstacle environments, making it challenging to quickly identify the optimal path. To address these challenges, this paper introduces a Nutcracker Optimizer integrated with Hyperbolic Sine–Cosine (ISCHNOA). First, the exploitation process of the sinh cosh optimizer is incorporated into the foraging strategy to enhance the efficiency of nutcracker in locating high-quality food sources within the search area. Secondly, a nonlinear function is designed to improve the algorithm’s convergence speed. Finally, a sinh cosh optimizer that incorporates historical positions and dynamic factors is introduced to enhance the influence of the optimal position on the search process, thereby improving the accuracy of the nutcracker in retrieving stored food. In this paper, the performance of the ISCHNOA algorithm is tested using 14 classical benchmark test functions as well as the CEC2014 and CEC2020 suites and applied to UAV path planning models. The experimental results demonstrate that the ISCHNOA algorithm outperforms the other algorithms across the three test suites, with the total cost of the planned UAV paths being lower.