Jul 2026· GECCO Companion· pp. 625-628· 0 citations· 11 references
Computer Science
TL;DR
Experimental results demonstrate that MAC significantly outperforms standalone GA, MA, AC, and other variants in terms of both solution quality and convergence stability, proving its effectiveness in balancing global exploration and local exploitation.
Abstract
Unmanned Aerial Vehicles play a pivotal role in maritime Search and Rescue (SAR) missions, yet generating optimal flight paths remains a significant challenge. Traditional meta-heuristic algorithms, such as genetic algorithms (GA), often suffer from premature convergence to local optima, while reinforcement learning (RL) approaches typically struggle with low sample efficiency and slow initial convergence. To address these limitations, this paper proposes a hybrid framework termed Memetic Actor-Critic (MAC). The MAC framework integrates the decision-making policy of Actor-Critic (AC) with the global search capabilities of a memetic algorithm. Specifically, we introduce a problem-specific local refinement mechanism that utilizes state-value estimations to refine the actor's policy, enabling precise exploitation of high-value regions beyond immediate rewards. The proposed method was thoroughly evaluated using a realistic SAR scenario constructed from oceanographic particle simulation data collected from the East Sea of South Korea. Experimental results demonstrate that MAC significantly outperforms standalone GA, MA, AC, and other variants in terms of both solution quality and convergence stability, proving its effectiveness in balancing global exploration and local exploitation.
Simulations indicate that the SHPP framework can establish a stable policy in approximately 625 episodes, and benefiting from the hierarchical architecture's smooth optimization in continuous space, the average flight path length is 138.3 meters, a reduction of approximately 19% compared to traditional discrete decisio...
Fei Wang, Jun-Yong Shi, Zhao-Kun Chen et al.· International Conference on...· 0 citations
Experimental results show that the proposed improved dung beetle optimization (IDBO) algorithm, which integrates multiple coordinated mechanisms to enhance the original dung beetle optimizer, can serve as a competitive optimizer for numerical benchmark problems and offline static 3D UAV path-planning simulations.
Simulation experiments show that in a complex obstacle environment of 100m × 100m× 100m, the IAGA algorithm can effectively plan the optimal path, and the convergence speed is significantly improved compared to traditional genetic algorithms, verifying the effectiveness and robustness of this method in handling multi-c...
Qian Wan, Tian-En Lu, Liquan Huang et al.· International Conference on...· 0 citations
Efficient 3-D path planning for autonomous underwater vehicles (AUVs) in dynamic submarine environments presents a significant challenge due to complex seabed terrain, ocean currents, and obstacles. In view of the adaptability and generalization limitations of traditional methods, this article proposes the reward-adapt...
Xin Cheng, Hai Jin, Yun Chen et al.· IEEE Systems Journal· 0 citations
The proposed hierarchical multi-agent proximal policy optimization framework can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
Li-Jing Liu, James M. Shihua, Qi-Yu Yan et al.· MATEC Web of Conferences· 0 citations
An Enhanced Competition of Tribes and Cooperation of Members Method based on the competition-cooperation search framework of the Competition of Tribes and Cooperation of Members Method (CTCM) can improve path quality, convergence accuracy, and search stability, providing a competitive optimization method for agent path...
Xiao-Yuan Li, Guang-Hui Li, Tai-Hua Zhang et al.· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.