Xiaoxiao Chen

Xiaoxiao Chen


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
WLWuke Li
Wuke Li
Kongwen Frank ZhangKongwen Frank Zhang
Kongwen Frank Zhang
QXQi Xiong
Qi Xiong
XCXiaoxiao Chen
Xiaoxiao Chen
The challenging terrain and deep ravines that characterize mountainous regions often result in slower path planning and suboptimal flight paths for unmanned aerial vehicles (UAVs) when traditional meta-heuristic optimization algorithms are employed. This study proposes a novel Improved Enhanced Snake Optimizer (IESO) for three-dimensional path planning and tested it in a simulated rugged mountainous terrain with obstacles and a restricted “no-fly zone”. The initialization process in the enhanced snake optimizer is refined by integrating the Chebyshev chaotic map. Additionally, a non-monotonic factor is introduced to modulate the “temperature”. This temperature controls the freedom of movement within the solution space. Furthermore, a boundary condition is incorporated into the dynamic opposition learning mechanism. These modifications collectively reduce the likelihood of population convergence to local optima during optimization. The feasibility of IESO is validated through time complexity and global convergence analyses. Comparative simulation experiments benchmarked IESO against five state-of-the-art biologically inspired optimization algorithms across test functions and path-planning simulated scenarios. Experimental results show that compared with five commonly used algorithms, the IESO algorithm improves the quality of flight trajectory planning by nearly 30% on average. Particularly when compared to the original SO algorithm, IESO demonstrates performance enhancement exceeding 36%, proving its superiority in UAV path planning over complex terrain.

7 October 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
WLWuke Li
Wuke Li
XCXiaoxiao Chen
Xiaoxiao Chen
POPrince-Hector Chimeremeze Okere
Prince-Hector Chimeremeze Okere
Metaheuristic algorithms provide reliable and effective methods for solving challenging optimization problems. The snow ablation algorithm (SAO) performs favorably as a physics-based metaheuristic algorithm. Nevertheless, SAO has some shortcomings. SAO is overpowered in its exploitation, has difficulty in balancing the proportion of global and local search, and is prone to encountering local optimum traps when confronted with complex problems. To improve the capability of SAO, this paper proposes a modified snow ablation algorithm hybrid distribution estimation algorithm named MSAO-EDA. In this work, a collaborative search framework is proposed where SAO and EDA can be organically integrated together to fully utilize the exploitation capability of SAO and the exploration capability of EDA. Secondly, an offset EDA approach that combines the optimal solution and the agent itself is used to replace SAO’s exploration strategy for the purpose of enhancing SAO’s exploration capability. Finally, the convergence of SAO is accelerated by selecting the next generation of agents through a greedy strategy. MSAO-EDA is tested on the CEC 2017 and CEC 2022 test suites and compared with EO, RIME, MRFO, CFOA, and four advanced algorithms, AFDBARO, CSOAOA, EOSMA, and JADE. The experimental results show that MSAO-EDA has excellent efficiency in numerical optimization problems and is a highly competitive SAO variant.

17 June 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
WLWuke Li
Wuke Li
Kongwen Frank ZhangKongwen Frank Zhang
Kongwen Frank Zhang
QXQi Xiong
Qi Xiong
XCXiaoxiao Chen
Xiaoxiao Chen
The challenging terrain and deep ravines characteristic of mountainous regions often result in slower path planning and suboptimal flight paths for Unmanned Aerial Vehicles (UAVs) when traditional meta-heuristic optimization algorithms are employed. This study investigates the application of an Improved Enhanced Snake Optimizer (IESO) for three-dimensional path planning in a simulated rugged mountainous terrain. The initialization process in the enhanced snake optimizer is refined by integrating the Chebyshev chaotic map. Additionally, a non-monotonic factor is introduced to modulate the "temperature," and a boundary condition is incorporated into the dynamic opposition learning mechanism. These modifications collectively reduce the likelihood of population convergence to local optima during optimization. The feasibility of IESO is validated through time complexity and global convergence analyses. Comparative simulation experiments benchmarked IESO against five state-of-the-art optimization algorithms across test functions and path-planning simulated scenarios. The experimental results indicate that the enhanced algorithm achieves superior optimization precision, faster convergence speeds, and improved quality in the planned trajectories by 30%.