Shuhao Jiang

High renewable energy penetration continuously changes renewable generation, load, carbon prices, and regional exchange states, making fixed electricity-carbon relations insufficient for rolling dispatch. This paper proposes a GraphLLM-based low-carbon dispatch method that represents generation units, carbon quotas, regional grids, and their couplings in a time-varying attributed graph. A heterogeneous graph Transformer encodes typed relations, and a Q-Former maps graph representations and structured operating states to a Decoder-only large language model (LLM). The LLM generates node-state, edge-weight, and constraint updates, which are written back to the graph. A dual-timescale optimizer combines day-ahead adaptive particle swarm optimization (APSO) with hourly dynamic minimum-cost flow (dynamic MCF) to coordinate generation, carbon quota flows, and cross-regional trading. Across multiple datasets, the method reduces total cost and carbon emissions by about 7.8% and 10.5%, respectively, while lowering the constraint violation rate to 1.7%.

Three-dimensional (3D) path planning for unmanned aerial vehicles is a classic NP-hard problem, where conventional algorithms often face limitations like slow convergence and susceptibility to local optima. This paper proposes an improved black kite optimization algorithm (IGFMBKA) that enhances performance through the integration of adaptive weights, multi-directional flipping, and differential evolution with vertical crossover strategies. The effectiveness of IGFMBKA was evaluated using 18 benchmark functions, along with test functions from CEC2017 and CEC2022, and further applied to a 3D UAV path planning model. Experimental results demonstrate that IGFMBKA consistently surpasses both individual improvement strategies and state-of-the-art optimization algorithms across all test cases. Notably, IGFMBKA achieved the lowest comprehensive cost while generating smooth and collision-free flight trajectories. This approach provides an efficient solution for UAV path planning in complex scenarios.

As big data continues to evolve, cluster analysis still has a place. Among them, the K-means algorithm is the most widely used method in the field of clustering, which can cause unstable clustering results due to the random selection of the initial clustering center of mass. In this paper, an improved honey badger optimization algorithm is proposed: (1) The population is initialized using sin chaos to make the population uniformly distributed. (2) The density factor is improved to enhance the optimization accuracy of the population. (3) A nonlinear inertia weight factor is introduced to prevent honey badger individuals from relying on the behavior of past individuals during position updating. (4) To improve the diversity of solutions, random opposition learning is performed on the optimal individuals. The improved algorithm outperforms the comparison algorithm in terms of performance through experiments on 23 benchmark test functions. Finally, in this paper, the improved algorithm is applied to K-means clustering and experiments are conducted on three data sets from the UCI data set. The results show that the improved honey badger optimized K-means algorithm improves the clustering effect over the traditional K-means algorithm.

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.

Personalized news recommendation can alleviate the information overload problem, and accurate modeling of user interests is the core of personalized news recommendation. Existing news recommendation methods integrate the titles and contents of news articles that users have historically browsed to construct user interest models. However, this method ignores the phenomenon of “title–content mismatching” in news articles, which leads to the lack of precision in user interest modeling. Therefore, a hybrid news recommendation method based on title–content matching is proposed in this paper: (1) An interactive attention network is employed to model the correlation between title and content contexts, thereby enhancing the feature representation of both; (2) The degree of title–content matching is computed using a Siamese neural network, constructing a user interest model based on title–content matching; and (3) neural collaborative filtering (NCF) based on factorization machines (FM) is integrated, taking into account the perspective of the potential relationships between users for recommendation, leveraging the insensitivity of neural collaboration to news content to alleviate the impact of title–content mismatching on user feature modeling. The proposed model was evaluated on a real-world dataset, achieving an nDCG of 83.03%, MRR of 81.88%, AUC of 85.22%, and F1 Score of 35.10%. Compared to state-of-the-art news recommendation methods, our model demonstrated an average improvement of 0.65% in nDCG and 3% in MRR. These experimental results indicate that our approach effectively enhances the performance of news recommendation systems.

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.