Till sidans topp

Sidansvarig: Webbredaktion
Sidan uppdaterades: 2012-09-11 15:12

Tipsa en vän

Zermelo's problem: Optima… - Göteborgs universitet Till startsida
Till innehåll Läs mer om hur kakor används på gu.se

Zermelo's problem: Optimal point-to-point navigation in 2D turbulent flows using reinforcement learning

Artikel i vetenskaplig tidskrift
Författare L. Biferale
F. Bonaccorso
M. Buzzicotti
P. C. Di Leoni
K Gustavsson
Publicerad i Chaos
Volym 29
Nummer/häfte 10
Sidor 13
ISSN 1054-1500
Publiceringsår 2019
Publicerad vid Institutionen för fysik (GU)
Sidor 13
Språk en
Länkar dx.doi.org/10.1063/1.5120370
Ämnesord particles, ocean, optimization, transport, dynamics, Mathematics, Physics
Ämneskategorier Fysik


To find the path that minimizes the time to navigate between two given points in a fluid flow is known as Zermelo's problem. Here, we investigate it by using a Reinforcement Learning (RL) approach for the case of a vessel that has a slip velocity with fixed intensity, Vs, but variable direction and navigating in a 2D turbulent sea. We show that an Actor-Critic RL algorithm is able to find quasioptimal solutions for both time-independent and chaotically evolving flow configurations. For the frozen case, we also compared the results with strategies obtained analytically from continuous Optimal Navigation (ON) protocols. We show that for our application, ON solutions are unstable for the typical duration of the navigation process and are, therefore, not useful in practice. On the other hand, RL solutions are much more robust with respect to small changes in the initial conditions and to external noise, even when V-s is much smaller than the maximum flow velocity. Furthermore, we show how the RL approach is able to take advantage of the flow properties in order to reach the target, especially when the steering speed is small. Published under license by AIP Publishing.

Sidansvarig: Webbredaktion|Sidan uppdaterades: 2012-09-11

På Göteborgs universitet använder vi kakor (cookies) för att webbplatsen ska fungera på ett bra sätt för dig. Genom att surfa vidare godkänner du att vi använder kakor.  Vad är kakor?