Biologically inspired Autonomous Underwater Vehicles (AUVs) have been developed in the recent decades. Tis thesis focuses on the AUVs that are biologically inspired by snakes, called Underwater Snake Robots (USRs). A ...
详细信息
Biologically inspired Autonomous Underwater Vehicles (AUVs) have been developed in the recent decades. Tis thesis focuses on the AUVs that are biologically inspired by snakes, called Underwater Snake Robots (USRs). A well-known issue of the USRs, or any AUVs, is the long- term autonomy. To achieve this, energy efcient approaches are required. Many studies have considered single-objectiveoptimization problems regarding the energy efciency of the USR, but almost none with multi-objectiveoptimization Problems (MOPs). Tis thesis presents MOPs of diferent locomotions of the USR. Te presented MOPs consider the energy efcient optimiza- tion of maximizing the forward velocity, while minimizing the power consumption of the USR. For computing the efcient motion paterns, two multi-objective Evolutionary algorithms (MOEAs) called Non-dominated Sort Genetic algorithm II (NSGA-II), and hypervolumeestimation Algo- rithm for multi-objectiveoptimization (HypE) are applied. A challenging topic of the USR, is their adaptability of diferent locomotions. Diferent locomotions of the USR give rise to diferent search spaces for optimization. We present simulation studies of the two most common snake locomotions: (i) lateral undulation and (ii) eel-like motion. Furthermore, we also present and in- vestigate three altered motion patern of the USR. Te aim of the altered locomotions is to let the MOEAs generate efcient locomotions through evolutionary, which we do not know the gait of. From the simulation results, it turns out that one of the altered motion patern approximates a motion similar to the lateral undulation. Tis motion patern is generated based on Fourier se- ries. Te obtained simulation results are based on optimization with optimal Genetic algorithm (GA) parameters, found by numerous presimulations of the MOPs. Since this is multi-objectiveoptimization problems, the end results will be in the form of Pareto fronts. Tese Pareto fronts can be used as trade-ofs for selecting th
暂无评论