paper-with-me

Papers

Combining Deep Architectures for Information Gain estimation and Reinforcement Learning for multiagent field exploration

2025-05-29 · Emanuele Masiero, Vito Trianni, Giuseppe Vizzari, Dimitri Ognibene

Precision agriculture requires efficient autonomous systems for crop monitoring, where agents must explore large-scale environments while minimizing resource consumption. This work addresses the problem as an active exploration task in a grid environment representing an agricultural field. Each cell may contain targets (e.g., damaged crops) observable from nine predefined points of view (POVs). Agents must infer the number of targets per cell using partial, sequential observations. We propose a two-stage deep learning framework. A pre-trained LSTM serves as a belief model, updating a probabilistic map of the environment and its associated entropy, which defines the expected information gain (IG). This allows agents to prioritize informative regions. A key contribution is the inclusion of a POV visibility mask in the input, preserving the Markov property under partial observability and avoiding revisits to already explored views. Three agent architectures were compared: an untrained IG-based agent selecting actions to maximize entropy reduction; a DQN agent using CNNs over local 3x3 inputs with belief, entropy, and POV mask; and a Double-CNN DQN agent with wider spatial context. Simulations on 20x20 maps showed that the untrained agent performs well despite its simplicity. The DQN agent matches this performance when the POV mask is included, while the Double-CNN agent consistently achieves superior exploration efficiency, especially in larger environments. Results show that uncertainty-aware policies leveraging entropy, belief states, and visibility tracking lead to robust and scalable exploration. Future work includes curriculum learning, multi-agent cooperation with shared rewards, transformer-based models, and intrinsic motivation mechanisms to further enhance learning efficiency and policy generalization.

📄 PDF Abstract BibTeX arXiv:2505.23865

Code (0)

등록된 구현이 없습니다.

Tasks

Visibility Tracking

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Tanh Activation 설명 없음
DQN A DQN, or Deep Q-Network, approximates a state-value function in a Q-Learning framework with a neural network. In the Atari…
Sigmoid Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Similar Papers 제목 키워드 기반

Sample-Efficient Reinforcement Learning of Partially Observable Markov Games

2022-06-02 · Qinghua Liu, Csaba Szepesvári, Chi Jin

This paper considers the challenging tasks of Multi-Agent Reinforcement Learning (MARL) under partial observability, where each agent only sees her own individual observations and actions that reveal incomplete informati…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Towards Information-Seeking Agents

2016-12-08 · Philip Bachman, Alessandro Sordoni, Adam Trischler

We develop a general problem setting for training and testing the ability of agents to gather information efficiently. Specifically, we present a collection of tasks in which success requires searching through a partiall…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Robust Expected Information Gain for Optimal Bayesian Experimental Design Using Ambiguity Sets

2022-05-20 · Jinwoo Go, Tobin Isaac

The ranking of experiments by expected information gain (EIG) in Bayesian experimental design is sensitive to changes in the model's prior distribution, and the approximation of EIG yielded by sampling will have errors s…

Experimental Design

Model-Free Reinforcement Learning with the Decision-Estimation Coefficient

2022-11-25 · NeurIPS 2023 11

We consider the problem of interactive decision making, encompassing structured bandits and reinforcement learning with general function approximation. Recently, Foster et al. (2021) introduced the Decision-Estimation Co…

Decision Makingreinforcement-learningReinforcement Learning

Combining imitation and deep reinforcement learning to accomplish human-level performance on a virtual foraging task

2022-03-11 · Vittorio Giammarino, Matthew F Dunne, Kylie N Moore, Michael E Hasselmo 외

We develop a simple framework to learn bio-inspired foraging policies using human data. We conduct an experiment where humans are virtually immersed in an open field foraging environment and are trained to collect the hi…

Deep Reinforcement LearningImitation LearningReinforcement Learning (RL)