A computationally efficient approach to swimming monofin optimization

被引:0
|
作者
M. A. Luersen
R. Le Riche
D. Lemosse
O. Le Maître
机构
[1] DAMEC,LMR, Laboratoire de Mécanique de Rouen, INSA de Rouen
[2] Departamento de Mecânica,Laboratoire de Mécanique et d’Energétique d’Evry
[3] CEFET-PR,undefined
[4] Ecole des Mines de Saint Etienne,undefined
[5] Avenue de l’Université,undefined
[6] Université d’Evry Val d’Essonne,undefined
关键词
Monofin design; Swimming propulsion; Identification; Optimization;
D O I
暂无
中图分类号
学科分类号
摘要
Monofins provide swimmers with an efficient alternative to the standard pair of fins. For example, all short and long distance human swimming records have been established using monofins. Current monofin design is mostly empirical, so the objectives of this work are to analyze monofin propulsion through coupled fluid–structure simulation and to optimize its flexural stiffness distribution. The optimization process maximizes the propulsive power provided by the monofin with a constraint on the total expended power. To be able to carry out the optimization of the coupled fluid–structure system, which is numerically costly to evaluate, the following simplifications are proposed: (1) a 2-D unsteady, inviscid, and incompressible fluid flow is considered; (2) the swimmer is composed of linear articulated segments, whose kinematics is imposed and identified from experimental data; and (3) the monofin is represented by rigid bars linked by torsional springs. For various allowable swimmer powers, optimal 2-D stiffness distributions are obtained using the Globalized and Bounded Nelder–Mead algorithm. Finally, an identification procedure is described to translate the optimal 2-D stiffness distributions into 3-D thickness profiles for a given monofin planform shape.
引用
收藏
页码:488 / 496
页数:8
相关论文
共 50 条
  • [41] On a computationally efficient approach to boron-interstitial clustering
    Schermer, Johann
    Pichler, Peter
    Zechner, Christoph
    Lerch, Wilfried
    Paul, Silke
    ESSDERC 2007: PROCEEDINGS OF THE 37TH EUROPEAN SOLID-STATE DEVICE RESEARCH CONFERENCE, 2007, : 342 - +
  • [42] A computationally efficient evolutionary algorithm for real-parameter optimization
    Deb, K
    Anand, A
    Joshi, D
    EVOLUTIONARY COMPUTATION, 2002, 10 (04) : 371 - 395
  • [44] Direct multiple shooting for computationally efficient train trajectory optimization
    Kouzoupis, Dimitris
    Pendharkar, Ishan
    Frey, Jonathan
    Diehl, Moritz
    Corman, Francesco
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 152
  • [45] A computationally efficient method for optimization of transport-reaction processes
    Bendersky, E
    Christofides, PD
    COMPUTERS & CHEMICAL ENGINEERING, 1999, 23 : S455 - S458
  • [46] A Computationally Efficient Evolutionary Algorithm for Multiobjective Network Robustness Optimization
    Wang, Shuai
    Liu, Jing
    Jin, Yaochu
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (03) : 419 - 432
  • [47] Computationally efficient objective function for algebraic codebook optimization in ACELP
    Baeckstroem, Tom
    14TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2013), VOLS 1-5, 2013, : 3401 - 3405
  • [48] A Computationally Efficient Technique for Dynamic Sensitivity Filtering in Topology Optimization
    Huang, Hongbin
    Wang, Yiming
    Wang, Haoyin
    Wu, Bo
    Hu, Youmin
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2025, 126 (02)
  • [49] Use of computationally efficient method of moments in the optimization of printed antennas
    Alatan, L
    Aksun, MI
    Leblebicioglu, K
    Birand, MT
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1999, 47 (04) : 725 - 732
  • [50] Computationally Efficient Vector Perturbation Precoding Using Thresholded Optimization
    Masouros, C.
    Sellathurai, M.
    Ratnarajah, T.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (05) : 1880 - 1890