Olfactory pursuit: catching a moving odor source in complex flows

• URL: http://arxiv.org/abs/2604.13121v1
• Date: Mon, 13 Apr 2026 15:52:24 GMT
• Title: Olfactory pursuit: catching a moving odor source in complex flows
• Abstract summary: Odor signals are intermittent, strongly mixed by turbulent-like transport, and typically lag behind the true target position.<n>We formulate olfactory pursuit as a partially observable Markov decision process in which an agent maintains a joint belief over the target's position and velocity.<n>Our results identify predictive inference of target motion as the key ingredient for effective olfactory pursuit.
• Score: 0.5541644538483947
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Locating and intercepting a moving target from possibly delayed, intermittent sensory signals is a paradigmatic problem in decision-making under uncertainty, and a fundamental challenge for, e.g., animals seeking prey or mates and autonomous robotic systems. Odor signals are intermittent, strongly mixed by turbulent-like transport, and typically lag behind the true target position, thereby complicating localization. Here, we formulate olfactory pursuit as a partially observable Markov decision process in which an agent maintains a joint belief over the target's position and velocity. Using a discrete run-and-tumble model, we compute quasi-optimal policies by numerically solving the Bellman equation and benchmark them against well-established information-theoretic strategies such as Infotaxis. We show that purely exploratory policies are near-optimal when the target frequently reorients, but fail dramatically when the target exhibits persistent motion. We thus introduce a computationally efficient hybrid policy that combines the information-gain drive of Infotaxis with a "greedy" value function derived from an associated fully observable control problem. Our heuristic achieves near-optimal performance across all persistence times and substantially outperforms purely exploratory approaches. Moreover, our proposal demonstrates strong robustness even in more complex search scenarios, including continuous run-and-tumble prey motion with moderate persistence time, model mismatch, and more accurate plume dynamics representation. Our results identify predictive inference of target motion as the key ingredient for effective olfactory pursuit and provide a general framework for search in information-poor, dynamically evolving environments.

Related papers

• Merging Reaction to Cognition: A Hybrid Cognitive Strategy for Odour Source Localisation in Natural Environments [0.0]
  Bio-inspired strategies rely on reactive behaviours triggered by detections.<n> Cognitive strategies integrate observations into a probabilistic belief over source location.<n>This work proposes a hybrid strategy that explicitly incorporates bio-inspired reactivity into belief-dependent motion planning.
  arXiv  Detail & Related papers  (2026-07-15T14:00:12Z)
• SegDiff: Segmented Trajectory Diffusion for Consistent and Adaptive Robot Manipulation [65.81476183180527]
  We introduce SegDiff, a closed-loop visuomotor policy that integrates the strengths of both paradigms.<n>SegDiff decomposes demonstrations into motion segments between keyposes and learns to predict the continuous trajectory from the current state to the next keypose.<n>SegDiff demonstrates significant performance gains over existing approaches across various simulated and real-world scenarios.
  arXiv  Detail & Related papers  (2026-07-13T02:48:03Z)
• FocalPolicy: Frequency-Optimized Chunking and Locally Anchored Flow Matching for Coherent Visuomotor Policy [75.32174422881958]
  FocalPolicy is a visuomotor policy that combines Frequency Locally-d Chunking with Anchored flow matching.<n>We introduce a foresight composite objective that supervises time-domain alignment within the proximal actions.<n>We design locally anchored sampling to target signal propagation consistency efficiency during flow matching training.
  arXiv  Detail & Related papers  (2026-05-15T13:27:55Z)
• Robust Multi-Agent Target Tracking in Intermittent Communication Environments via Analytical Belief Merging [2.3559161556025887]
  We formulate the decentralized belief merging problem as Forward and Reverse Kullback-Leibler (KL) divergence optimizations.<n>By deploying these derivations, we mathematically eliminate optimization artifacts, achieving perfect mathematical fidelity.<n>We propose a novel spatially-aware visit-weighted KL merging strategy that dynamically weighs agent beliefs based on their physical visitation history.
  arXiv  Detail & Related papers  (2026-04-08T20:27:48Z)
• Referring-Aware Visuomotor Policy Learning for Closed-Loop Manipulation [91.20850436220267]
  We introduce the Referring-Aware Visuomotor Policy (ReV)<n>ReV incorporates sparse referring points provided by a human or a high-level reasoning planner.<n>It is trained only by applying targeted perturbations to expert demonstrations.
  arXiv  Detail & Related papers  (2026-04-07T07:41:11Z)
• F2F-AP: Flow-to-Future Asynchronous Policy for Real-time Dynamic Manipulation [62.06267255986041]
  Asynchronous inference has emerged as a prevalent paradigm in robotic manipulation.<n>In this paper, we propose a novel framework that leverages predicted object flow to synthesize future observations.<n>Our approach significantly enhances responsiveness and success rates in complex dynamic manipulation tasks.
  arXiv  Detail & Related papers  (2026-04-02T17:57:15Z)
• SHARP: Short-Window Streaming for Accurate and Robust Prediction in Motion Forecasting [53.74101174559609]
  We propose a novel streaming-based motion forecasting framework that explicitly focuses on evolving scenes.<n>Our method incrementally processes incoming observation windows and leverages an instance-aware context streaming to maintain and update latent agent representations.<n>Our model achieves state-of-the-art performance in streaming inference on the Argoverse 2 multi-agent benchmark, while maintaining minimal latency, highlighting its suitability for real-world deployment.
  arXiv  Detail & Related papers  (2026-03-30T06:47:19Z)
• Robust and Generalized Humanoid Motion Tracking [17.58241987932198]
  Learning a general humanoid whole-body controller is challenging because practical reference motions can exhibit noise and inconsistencies after being transferred to the robot domain.<n>We propose a dynamics-conditioned command aggregation framework that uses a causal temporal encoder to summarize recent proprioception and a multi-head cross-attention command encoder to selectively aggregate a context window.<n>The proposed method is evaluated under diverse reference inputs and challenging motion regimes, demonstrating zero-shot transfer to unseen motions as well as robust sim-to-real transfer on a physical humanoid robot.
  arXiv  Detail & Related papers  (2026-01-30T15:27:43Z)
• Optimization-Guided Diffusion for Interactive Scene Generation [52.23368750264419]
  We present OMEGA, an optimization-guided, training-free framework that enforces structural consistency and interaction awareness during diffusion-based sampling.<n>We show that OMEGA improves generation realism, consistency, and controllability, increasing the ratio of physically and behaviorally valid scenes.<n>Our approach can also generate $5times$ more near-collision frames with a time-to-collision under three seconds.
  arXiv  Detail & Related papers  (2025-12-08T15:56:18Z)
• Multi-agent Traffic Prediction via Denoised Endpoint Distribution [23.767783008524678]
  Trajectory prediction at high speeds requires historical features and interactions with surrounding entities. We present the Denoised Distribution model for trajectory prediction. Our approach significantly reduces model complexity and performance through endpoint information.
  arXiv  Detail & Related papers  (2024-05-11T15:41:32Z)
• An Index Policy Based on Sarsa and Q-learning for Heterogeneous Smart Target Tracking [13.814608044569967]
  We propose a new policy, namely ISQ, to maximize the long-term tracking rewards. Numerical results demonstrate that the proposed ISQ policy outperforms conventional Q-learning-based methods.
  arXiv  Detail & Related papers  (2024-02-19T10:13:25Z)
• Time-series Generation by Contrastive Imitation [87.51882102248395]
  We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy. At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
  arXiv  Detail & Related papers  (2023-11-02T16:45:25Z)
• Bellman Meets Hawkes: Model-Based Reinforcement Learning via Temporal Point Processes [8.710154439846816]
  We consider a sequential decision making problem where the agent faces the environment characterized by discrete events. This problem exists ubiquitously in social media, finance and health informatics but is rarely investigated by the conventional research in reinforcement learning. We present a novel framework of model-based reinforcement learning where the agent's actions and observations are asynchronous discrete events occurring in continuous-time.
  arXiv  Detail & Related papers  (2022-01-29T11:53:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.