Hybrid Path Planning Based on Golden Jackal Optimization and Particle Swarm Optimization

To address the issues of the golden jackal optimization (GJO) algorithm—such as susceptibility to local optima, poor convergence, and non-smooth paths—in mobile robot path planning, this paper proposes an improved GJO algorithm integrated with a particle swarm optimization strategy (PSO-GJO). First, a gaussian mutation strategy is introduced to probabilistically perturb the position of the current optimal solution. Combined with a greedy selection mechanism, this retains superior solutions and balances the algorithm’s exploration and exploitation capabilities. Second, by incorporating particle swarm optimization principles, the position update formula is redesigned to dynamically weight collective information and individual historical optima, thereby enhancing global search efficiency. Simulation experiments in grid environments demonstrate that the improved algorithm achieves faster convergence, stronger search capability, smoother paths, and higher stability in mobile robot path planning.

Authors

Institutions

Publication Details

Published
2025-08-22
DOI
https://doi.org/10.1109/ccris65764.2025.11192947
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hybrid Path Planning Based on Golden Jackal Optimization and Particle Swarm Optimization

Wenji Li, Yijing Yang, Dongliang Wang
Robotic Path Planning Algorithms
article

Hybrid Path Planning Based on Golden Jackal Optimization and Particle Swarm Optimization

Wenji Li, Yijing Yang, Dongliang Wang
article en

Abstract

To address the issues of the golden jackal optimization (GJO) algorithm—such as susceptibility to local optima, poor convergence, and non-smooth paths—in mobile robot path planning, this paper proposes an improved GJO algorithm integrated with a particle swarm optimization strategy (PSO-GJO). First, a gaussian mutation strategy is introduced to probabilistically perturb the position of the current optimal solution. Combined with a greedy selection mechanism, this retains superior solutions and balances the algorithm’s exploration and exploitation capabilities. Second, by incorporating particle swarm optimization principles, the position update formula is redesigned to dynamically weight collective information and individual historical optima, thereby enhancing global search efficiency. Simulation experiments in grid environments demonstrate that the improved algorithm achieves faster convergence, stronger search capability, smoother paths, and higher stability in mobile robot path planning.

Shantou University (CN)
Openalex Percentile: Top 71%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.