Task-Sequencing Optimization Using DSSA Algorithm for AUV with Limited Endurance

Efficiency is very important for robots when executing multiple tasks, especially for autonomous underwater vehicles (AUVs) with limited endurance. In order to improve efficiency, task-sequencing optimization, which focuses on achieving the optimal execution order of multiple tasks, is one effective way. In this paper, the classic lawnmower traverse task is taken as an example for optimization, and discrete salp swarm algorithm (DSSA), which combines salp swarm algorithm (SSA) and genetic algorithm (GA), is selected and applied to optimize task sequencing for one AUV. In the optimization process, there are two key problems that need to be solved. One is how to encode the individual chromosome and the other is how to perform genetic operations on chromosomes of different lengths. For the former problem, a two-layer encoding method is proposed to generate individuals in the population, in which identity number and entry point of different areas are encoded, respectively. For the latter problem, mutation and crossover operators are modified and extended to deal with individuals of variable length due to the limited endurance of AUVs. Simulation results show that the sequencing optimization can be achieved after finite iteration. Through comprehensive comparison, DSSA is finally implemented and verified in a physical AUV.

Authors

Institutions

Publication Details

Journal
Journal of Marine Science and Engineering
Published
2025-06-02
DOI
https://doi.org/10.3390/jmse13061111
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

Task-Sequencing Optimization Using DSSA Algorithm for AUV with Limited Endurance

Qixin Sha, Yue Shen, Jiaming Zhang, Bo He
Journal of Marine Science and Engineering
Robotic Path Planning Algorithms
article

Task-Sequencing Optimization Using DSSA Algorithm for AUV with Limited Endurance

Qixin Sha, Yue Shen, Jiaming Zhang, Bo He
article en

Abstract

Efficiency is very important for robots when executing multiple tasks, especially for autonomous underwater vehicles (AUVs) with limited endurance. In order to improve efficiency, task-sequencing optimization, which focuses on achieving the optimal execution order of multiple tasks, is one effective way. In this paper, the classic lawnmower traverse task is taken as an example for optimization, and discrete salp swarm algorithm (DSSA), which combines salp swarm algorithm (SSA) and genetic algorithm (GA), is selected and applied to optimize task sequencing for one AUV. In the optimization process, there are two key problems that need to be solved. One is how to encode the individual chromosome and the other is how to perform genetic operations on chromosomes of different lengths. For the former problem, a two-layer encoding method is proposed to generate individuals in the population, in which identity number and entry point of different areas are encoded, respectively. For the latter problem, mutation and crossover operators are modified and extended to deal with individuals of variable length due to the limited endurance of AUVs. Simulation results show that the sequencing optimization can be achieved after finite iteration. Through comprehensive comparison, DSSA is finally implemented and verified in a physical AUV.

Journal of Marine Science and EngineeringVol. 13(6)
Ocean University of China (CN)
Life below water
Openalex Percentile: Top 90%
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.