mlsanityData to 13 Oct 2026

Learning swimming escape patterns for larval fish under energy constraints

arXiv 2105.00771 ↗First posted 3 May 2021physics.flu-dyn cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Swimming organisms can escape their predators by creating and harnessing unsteady flow fields through their body motions. Stochastic optimization and flow simulations have identified escape patterns that are consistent with those observed in natural larval swimmers. However, these patterns have been limited by the specification of a particular cost function and depend on a prescribed functional form of the body motion. Here, we deploy reinforcement learning to discover swimmer escape patterns for larval fish under energy constraints. The identified patterns include the C-start mechanism, in addition to more energetically efficient escapes. We find that maximizing distance with limited energy requires swimming via short bursts of accelerating motion interlinked with phases of gliding. The present, data efficient, reinforcement learning algorithm results in an array of patterns that reveal practical flow optimization principles for efficient swimming and the methodology can be transferred to the control of aquatic robotic devices operating under energy constraints.

Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 6 of its 72 references that are in the map. First posted on arXiv 3 May 2021.

Builds on

6 of 72 references.

References · 6

  1. 2019Machine Learning for Fluid Mechanicscited by 381
  2. 2018Efficient collective swimming by harnessing vortices through deep reinforcement learningcited by 73
  3. 2018Remember and Forget for Experience Replaycited by 42
  4. 2017Flow Navigation by Smart Microswimmers via Reinforcement Learningcited by 32
  5. 2016A statistical learning strategy for closed-loop control of fluid flowscited by 4
  6. 2018Deep-Reinforcement-Learning for Gliding and Perching Bodiescited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.