PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 9, 2026IET conference proceedings.0 citations

Improved remora optimization algorithm combining chaotic mapping and crossover strategy: path planning for orchard robots

View Full Paper
HTHao TangCZCaigen ZhouSTShixi Tang

Key Points

  • This research aims to improve the Remora Optimization Algorithm for more effective path planning in orchard robots.
  • Introduced a new algorithm (GROA) combining chaotic mapping for population initialization and a crossover mechanism.
  • Compared GROA with existing algorithms using CEC2020 benchmark for performance assessment.
  • Applied GROA to optimize orchard robot path planning and tested against conventional algorithms.
  • GROA shows a 20% improvement in ideal fitness compared to ROA, HHO, and SHO.
  • Average path planning results indicate a 0.23% shorter path and 3.26% reduction in average path length compared to conventional methods.

Abstract

Orchard robot path planning has become a major area of study in smart agriculture due to advances in intelligent robotics technology. To address limitations of the Remora Optimization Algorithm (ROA)—such as low convergence accuracy, susceptibility to local optima, and inadequate global search—this study introduces an enhanced algorithm (GROA) that employs Logistic-Tent chaotic mapping for population initialization, a crossover mechanism to improve search update, and a sine-cosine method to balance global and local exploration. Compared with ROA, Harris Hawks Optimization (HHO), and the Seahorse Optimization algorithm (SHO) using the CEC2020 benchmark, GROA achieves average improvements of 20% in ideal fitness, 32% in average fitness, and 73% in standard deviation. When applied to orchard path planning, GROA also outperforms ROA, Genetic Algorithm (GA), and Particle Swarm Optimization (PSO), with average gains of 0.23% in the shortest path and 3.26% in average path length.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Tang et al. (2026) studied this question.

synapsesocial.com/papers/69fecfafb9154b0b82876a84https://doi.org/10.1049/icp.2026.1869
Ask AI
Helpful
Bookmark
Share
View Full Paper