• Home
  • Search
  • A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements.
  • Cite Icon4
  • https://doi.org/10.3390/e25020251Copy DOI Icon

A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements.

  • Jan 30, 2023
  • Entropy
  • Peter N Loxley +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

An informative measurement is the most efficient way to gain information about an unknown state. We present a first-principles derivation of a general-purpose dynamic programming algorithm that returns an optimal sequence of informative measurements by sequentially maximizing the entropy of possible measurement outcomes. This algorithm can be used by an autonomous agent or robot to decide where best to measure next, planning a path corresponding to an optimal sequence of informative measurements. The algorithm is applicable to states and controls that are either continuous or discrete, and agent dynamics that is either stochastic or deterministic; including Markov decision processes and Gaussian processes. Recent results from the fields of approximate dynamic programming and reinforcement learning, including on-line approximations such as rollout and Monte Carlo tree search, allow the measurement task to be solved in real time. The resulting solutions include non-myopic paths and measurement sequences that can generally outperform, sometimes substantially, commonly used greedy approaches. This is demonstrated for a global search task, where on-line planning for a sequence of local searches is found to reduce the number of measurements in the search by approximately half. A variant of the algorithm is derived for Gaussian processes for active sensing.

Similar Papers
  • Research Article

Hedging of financial derivative contracts via Monte Carlo tree search

  • Jan 01, 2023
  • The Journal of Computational Finance
  • Oleg Szehr
  • Research Article
  • Citations9

WebPilot: A Versatile and Autonomous Multi-Agent System for Web Task Execution with Strategic Exploration

  • Apr 11, 2025
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Yao Zhang +5
  • Book Chapter
  • Citations5

MCTS Experiments on the Voronoi Game

  • Jan 01, 2012
  • Bruno Bouzy +2
  • Conference Article
  • Citations5

A Tutorial Introduction to Monte Carlo Tree Search

  • Dec 14, 2020
  • Michael C Fu
  • Conference Article
  • Citations24

MapZero: Mapping for Coarse-grained Reconfigurable Architectures with Reinforcement Learning and Monte-Carlo Tree Search

  • Jun 17, 2023
  • Xiangyu Kong +9
  • Research Article

Scaling Safe Policy Improvement: Monte Carlo Tree Search and Policy Iteration Strategies

  • Nov 11, 2025
  • Journal of Artificial Intelligence Research
  • Federico Bianchi +5
  • Conference Article

Playing Fight the Landlord with Tree Search and Hidden Information Evaluation

  • Dec 09, 2022
  • Zeya He +4
  • Research Article
  • Citations14

A reinforcement learning application of a guided Monte Carlo Tree Search algorithm for beam orientation selection in radiation therapy

  • May 13, 2021
  • Machine Learning: Science and Technology
  • Azar Sadeghnejad-Barkousaraie +3
  • Research Article

Application of Reinforcement Learning to Solve Rubrik’s Cube with Markov Decision Process

  • Oct 08, 2025
  • Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
  • Defni +6
  • Research Article
  • Citations20

Simulation-Based Algorithms for Markov Decision Processes: Monte Carlo Tree Search from AlphaGo to AlphaZero

  • Dec 01, 2019
  • Asia-Pacific Journal of Operational Research
  • Michael C Fu
  • Research Article
  • Citations8

Measurement Maximizing Adaptive Sampling with Risk Bounding Functions

  • Jul 17, 2019
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Benjamin Ayton +2
  • Research Article
  • Citations3

Optimal Vehicle-to-Grid Charge Scheduling for Electric Vehicles Based on Dynamic Programming

  • Feb 24, 2025
  • Energies
  • Heeyun Lee +3
  • Conference Article

Dynamic Programming for POMDP with Jointly Discrete and Continuous State-Spaces

  • Jul 01, 2019
  • Donghwan Lee +2
  • Research Article
  • Citations7

Analysis of Hyper-Parameters for AlphaZero-Like Deep Reinforcement Learning

  • Sep 24, 2022
  • International Journal of Information Technology & Decision Making
  • Hui Wang +3
  • Conference Article
  • Citations8

Learning Reward Models for Cooperative Trajectory Planning with Inverse Reinforcement Learning and Monte Carlo Tree Search

  • Jun 05, 2022
  • Karl Kurzer +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.