Act-then-measure: Reinforcement Learning For Partially Observable Environments With Active Measuring

Abstract

We study Markov decision processes (MDPs), where agents have direct control over when and how they gather information, as formalized by action-contingent noiselessly observable MDPs (ACNO-MPDs). In these models, actions consist of two components: a control action that affects the environment, and a measurement action that affects what the agent can observe. To solve ACNO-MDPs, we introduce the act-then-measure (ATM) heuristic, which assumes that we can ignore future state uncertainty when choosing control actions. We show how following this heuristic may lead to shorter policy computation times and prove a bound on the performance loss incurred by the heuristic. To decide whether or not to take a measurement action, we introduce the concept of measuring value. We develop a reinforcement learning algorithm based on the ATM heuristic, using a Dyna-Q variant adapted for partially observable domains, and showcase its superior performance compared to prior methods on a number of partially-o

Stats

• citations2
• S2 citations—
• github stars0
• HF likes0
• heat score3.58
• arxiv keykrale2023act

Related papers

• Reinforcement Learning Under Partial Observability Guided By Learned Environment Models (2022)6.34
• Active Inference And Reinforcement Learning: A Unified Inference On Continuous State And Action Spaces Under Partial Observability (2022)5.84
• Provably Efficient Reinforcement Learning In Partially Observable Dynamical Systems (2022)0.00
• Optimizing Algorithms For Mobile Health Interventions With Active Querying Optimization (2025)0.00
• Optimal Decision-making In Mixed-agent Partially Observable Stochastic Environments Via Reinforcement Learning (2019)0.00
• On Improving Deep Reinforcement Learning For Pomdps (2017)0.00
• Dynamic Deep-reinforcement-learning Algorithm In Partially Observable Markov Decision Processes (2023)0.00
• Provable Representation With Efficient Planning For Partial Observable Reinforcement Learning (2023)0.00