Yong Xu

Mr. Yong Xu


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 June 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
YXYong Xu
Yong Xu
碧桑碧聪 碧 桑
碧聪 碧 桑
YZyi zhang
yi zhang
Path planning is an important research direction in the field of robotics; however, with the advancement of modern science and technology, the study of efficient, stable, and safe path-planning technology has become a realistic need in the field of robotics research. This paper introduces an improved sparrow search algorithm (ISSA) with a fusion strategy to further improve the ability to solve challenging tasks. First, the sparrow population is initialized using circle chaotic mapping to enhance diversity. Second, the location update formula of the northern goshawk is used in the exploration phase to replace the sparrow search algorithm’s location update formula in the security situation. This improves the discoverer model’s search breadth in the solution space and optimizes the problem-solving efficiency. Third, the algorithm adopts the Lévy flight strategy to improve the global optimization ability, so that the sparrow jumps out of the local optimum in the later stage of iteration. Finally, the adaptive T-distribution mutation strategy enhances the local exploration ability in late iterations, thus improving the sparrow search algorithm’s convergence speed. This was applied to the CEC2021 function set and compared with other standard intelligent optimization algorithms to test its performance. In addition, the ISSA was implemented in the path-planning problem of mobile robots. The comparative study shows that the proposed algorithm is superior to the SSA in terms of path length, running time, path optimality, and stability. The results show that the proposed method is more effective, robust, and feasible in mobile robot path planning.

9 August 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
YXYong Xu
Yong Xu
BZBaicheng Zhang
Baicheng Zhang
YZyi zhang
yi zhang
The wireless sensor network (WSN) is an essential technology of the Internet of Things (IoT) but has the problem of low coverage due to the uneven distribution of sensor nodes. This paper proposes a novel enhanced whale optimization algorithm (WOA), incorporating Lévy flight and a genetic algorithm optimization mechanism (WOA-LFGA). The Lévy flight technique bolsters the global search ability and convergence speed of the WOA, while the genetic optimization mechanism enhances its local search and random search capabilities. WOA-LFGA is tested with 29 mathematical optimization problems and a WSN coverage optimization model. Simulation results demonstrate that the improved algorithm is highly competitive compared with mainstream algorithms. Moreover, the practicality and the effectiveness of the improved algorithm in optimizing wireless sensor network coverage are confirmed.

23 November 2021 in Scientific Programming
Verified
Journal Article
Open access
PDF file
YXYong Xu
Yong Xu
With global resource waste and environmental pollution becoming increasingly serious, corporate investment environmental performance (CIEP) of blockchain industry has received much attention from researchers over the past decade. As an important part of economic development, enterprises also pay increasing attention to environmental protection and pollution control. CIEP of blockchain industry is regarded as the result of corporate environmental management. Assessing CIEP of blockchain industry can not only make enterprises focus on the environmental protection and management but also promote sustainable social development. Also, it is always viewed as multiattribute group decision making (MAGDM). Thus, a new MAGDM model is used to tackle it. Based on the CODAS (combinative distance-based assessment) method and intuitionistic fuzzy sets (IFSs), this paper designs the distance-based IF-CODAS method to assess CIEP. Eventually, an application about CIEP evaluation is employed to show the superiority of the defined method. The results illustrate that the defined framework is very useful for assessing CIEP.

23 February 2022 in Frontiers in Bioengineering and Biotechnology
Verified
Journal Article
Open access
ZYZhang Yi
Zhang Yi
YHYu Hongda
Yu Hongda
SMSun Mengdi
Sun Mengdi
YXYong Xu
Yong Xu
This paper proposes a hybrid swarming algorithm based on Ant Colony Optimization and Physarum Polycephalum Algorithm. And the Van Der Waals force is first applied to the pheromone update mechanism of the hybrid algorithm. The improved method can prevent premature convergence into the local optimal solution. Simulation results show the proposed approach has excellent in solving accuracy and convergence time. We also compare the improved algorithm with other advanced algorithms and the results show that our algorithm is more accurate than the literature algorithms. In addition, we use the capitals of 35 Asian countries as an example to verify the robustness and versatility of the hybrid algorithm.

6 January 2026 in Biomimetics
Verified
Journal Article
Open access
PDF file
YXYong Xu
Yong Xu
NXNing Xue
Ning Xue
YZyi zhang
yi zhang
This paper presents the Circle-Mapping Transition and Weighted Red-Billed Blue Magpie Optimizer (CTWRBMO), designed to address significant challenges in 3D path planning for drones. Although the original Red-Billed Blue Magpie Optimizer (RBMO) algorithm features a simple structure, few parameters, and strong local search capability, making it well-suited for UAV path optimization, it suffers from insufficient population diversity, limited global search ability, and a tendency to fall into local optima in complex high-dimensional scenarios. To overcome these limitations, four enhancement strategies are introduced. Firstly, the Circle chaotic mapping strategy leverages the randomness and ergodicity of chaotic sequences to generate an initial population that is uniformly distributed. This enhancement improves population diversity from the beginning and provides a solid foundation for global optimization. Secondly, the ε parameter is dynamically adjusted to prioritize local refinement during the early stages of optimization. This adjustment enables rapid convergence toward potentially optimal areas. This parameter increases to enhance global search capabilities as the algorithm progresses, thereby broadening the optimization space and achieving a dynamic equilibrium. Additionally, a nonlinear dynamic weighting factor (wd) is incorporated into the position update formula. The algorithm’s ability to escape local optima is significantly improved by dynamically altering the weight ratio between historical optimal positions and the current position. Furthermore, an elite perturbation mechanism based on individual neighborhoods is implemented to generate candidate solutions using local information. This mechanism enhances the algorithm’s local exploration capabilities and improves the stability of preserving optimal solutions, supported by a greedy criterion for optimal retention. Experimental results show that the CTWRBMO algorithm significantly outperforms comparison algorithms in terms of optimization accuracy and convergence speed, demonstrating exceptional global optimization capabilities. Additional applications in UAV 3D path planning simulations evaluated paths based on length, threat avoidance efficiency, and smoothness. The results indicate that paths planned using CTWRBMO are shorter, safer, and smoother compared to those generated by the Harrier Hawks Optimization (HHO), African Vulture Optimization Algorithm (AVOA), Artificial Bee Colony (ABC) Algorithm, and the traditional Magpie Algorithm, effectively meeting practical engineering requirements for UAV 3D path planning.

12 July 2026 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
YZYi Zhang
Yi Zhang
HLHaoran Li
Haoran Li
YCYifei Cai
Yifei Cai
YZYue Zhao
Yue Zhao
TYTianshu You
Tianshu You
YXYong Xu
Yong Xu