Run-and-tumble chemotaxis using reinforcement learning

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Pramanik, Ramesh, Mishra, Shradha, Chatterjee, Sakuntala
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910775621189632
author Pramanik, Ramesh
Mishra, Shradha
Chatterjee, Sakuntala
author_facet Pramanik, Ramesh
Mishra, Shradha
Chatterjee, Sakuntala
contents Bacterial cells use run-and-tumble motion to climb up attractant concentration gradient in their environment. By extending the uphill runs and shortening the downhill runs the cells migrate towards the higher attractant zones. Motivated by this, we formulate a reinforcement learning (RL) algorithm where an agent moves in one dimension in the presence of an attractant gradient. The agent can perform two actions: either persistent motion in the same direction or reversal of direction. We assign costs for these actions based on the recent history of the agent's trajectory. We ask the question: which RL strategy works best in different types of attractant environment. We quantify efficiency of the RL strategy by the ability of the agent (a) to localize in the favorable zones after large times, and (b) to learn about its complete environment. Depending on the attractant profile and the initial condition, we find an optimum balance is needed between exploration and exploitation to ensure the most efficient performance.
format Preprint
id arxiv_https___arxiv_org_abs_2501_03687
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Run-and-tumble chemotaxis using reinforcement learning
Pramanik, Ramesh
Mishra, Shradha
Chatterjee, Sakuntala
Cell Behavior
Machine Learning
Biological Physics
Bacterial cells use run-and-tumble motion to climb up attractant concentration gradient in their environment. By extending the uphill runs and shortening the downhill runs the cells migrate towards the higher attractant zones. Motivated by this, we formulate a reinforcement learning (RL) algorithm where an agent moves in one dimension in the presence of an attractant gradient. The agent can perform two actions: either persistent motion in the same direction or reversal of direction. We assign costs for these actions based on the recent history of the agent's trajectory. We ask the question: which RL strategy works best in different types of attractant environment. We quantify efficiency of the RL strategy by the ability of the agent (a) to localize in the favorable zones after large times, and (b) to learn about its complete environment. Depending on the attractant profile and the initial condition, we find an optimum balance is needed between exploration and exploitation to ensure the most efficient performance.
title Run-and-tumble chemotaxis using reinforcement learning
topic Cell Behavior
Machine Learning
Biological Physics
url https://arxiv.org/abs/2501.03687