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

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Loxley, Peter N., Cheung, Ka-Wai
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955913/
https://www.ncbi.nlm.nih.gov/pubmed/36832617
http://dx.doi.org/10.3390/e25020251

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955913/
https://www.ncbi.nlm.nih.gov/pubmed/36832617
http://dx.doi.org/10.3390/e25020251

Ejemplares similares