
























Abstract:In dynamic flow fields, various animals exhibit remarkable odor search capabilities despite relying on stochastic detections. Interestingly, there exists an optimal time window for integrating these detections that maximizes search efficiency. To understand the underlying mechanism, we investigate the navigation performance of Reinforcement Learning (RL) agents in unsteady flows under varying memory lengths and flow conditions. Without any predefined models, the agents develop a flow-assisted casting strategy and adaptively adjust both the geometry of their search trajectories and the concentration threshold for initiating casting to maximize the success rate. The agent's average speed toward the odor source exhibits a non-monotonic dependence on memory length, which can be explained by the "sector-search" model.
| Subjects: | Machine Learning (cs.LG); Fluid Dynamics (physics.flu-dyn) |
| Cite as: | arXiv:2605.18881 [cs.LG] |
| (or arXiv:2605.18881v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.18881 arXiv-issued DOI via DataCite (pending registration) |
From: Gaojin Li [view email]
[v1]
Sat, 16 May 2026 03:32:48 UTC (46,288 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。