Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

88
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
88
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

107
An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
107
Next-generation Sequencing03:00

Next-generation Sequencing

91.9K
The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
91.9K
Basic Discrete Time Signals01:16

Basic Discrete Time Signals

253
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is...
253
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

11.3K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
11.3K
Linear time-invariant Systems01:23

Linear time-invariant Systems

316
A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
316

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026

Related Experiment Video

Updated: Aug 9, 2025

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans
09:23

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

8.2K

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

Peter N Loxley1, Ka-Wai Cheung1

  • 1School of Science and Technology, University of New England, Armidale, NSW 2351, Australia.

Entropy (Basel, Switzerland)
|February 25, 2023
PubMed
Summary

This study introduces a dynamic programming algorithm for optimal informative measurements, enabling autonomous agents to plan efficient search paths. The method significantly reduces measurements needed, outperforming greedy approaches.

Keywords:
active learningapproximate dynamic programmingautonomous agentinformation theoryreinforcement learning

More Related Videos

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

1.2K
Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology
06:24

Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology

Published on: December 15, 2017

10.1K

Related Experiment Videos

Last Updated: Aug 9, 2025

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans
09:23

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

8.2K
Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

1.2K
Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology
06:24

Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology

Published on: December 15, 2017

10.1K

Area of Science:

  • Robotics and Artificial Intelligence
  • Information Theory
  • Decision Science

Background:

  • Efficient information acquisition is crucial for understanding unknown states.
  • Autonomous agents require optimal strategies for sequential measurements.
  • Existing greedy methods may not yield the most efficient search paths.

Purpose of the Study:

  • To derive a general-purpose dynamic programming algorithm for optimal informative measurement sequences.
  • To enable autonomous agents to plan efficient measurement paths.
  • To provide a framework applicable to diverse state spaces and dynamics.

Main Methods:

  • A first-principles derivation of a dynamic programming algorithm.
  • Sequential maximization of the entropy of measurement outcomes.
  • Integration with approximate dynamic programming and reinforcement learning techniques (e.g., Monte Carlo tree search) for real-time application.
  • Development of a variant for Gaussian processes in active sensing.

Main Results:

  • The algorithm generates optimal, non-myopic measurement sequences.
  • Demonstrated substantial performance improvements over greedy approaches.
  • Reduced measurement count by approximately half in a global search task.
  • Applicability to continuous/discrete states and stochastic/deterministic dynamics.

Conclusions:

  • The proposed dynamic programming algorithm offers a superior method for planning informative measurements.
  • Enables efficient real-time decision-making for autonomous agents in complex environments.
  • Provides a robust framework for active sensing and information gathering tasks.