Related Experiment Video
Updated: Mar 30, 2026

Task Interruption and Resumption Paradigm for Testing the Activation and Pursuit of an Abstract Thinking Goal
Published on: April 18, 2017
A Theoretical Foundation of Goal Representation Heuristic Dynamic Programming.
Goal Representation Heuristic Dynamic Programming (GrHDP) offers robust control. This study provides the first theoretical analysis of its internal reinforcement signal, proving its boundedness and monotonic convergence for enhanced control performance.
Area of Science:
- Control Theory
- Dynamic Programming
- Reinforcement Learning
Background:
- Goal Representation Heuristic Dynamic Programming (GrHDP) is a recent control design.
- Its effectiveness has been shown in case studies and industrial applications.
- Prior research lacks theoretical analysis of the internal reinforcement signal.
Purpose of the Study:
- To provide a theoretical analysis of the GrHDP control design.
- To investigate the properties of the internal reinforcement signal in GrHDP.
- To establish the theoretical foundation for GrHDP's performance improvements.
Main Methods:
- Theoretical analysis under specific conditions.
- Mathematical proofs for signal boundedness and convergence.
- Simulation studies for validation.
Main Results:
- The internal reinforcement signal is proven to be bounded.
- The performance index converges monotonically to its optimal value.
- The existence of admissible control for GrHDP is demonstrated.
Conclusions:
- This study presents the first theoretical foundation for GrHDP's internal reinforcement signal.
- The internal reinforcement signal provides effective information for control performance enhancement.
- The theoretical findings are validated through extensive simulations.
Related Concept Videos
Statically Indeterminate Problem Solving
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
The Representativeness Heuristic
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Theorems of Pappus and Guldinus: Problem Solving
Principle of Virtual Work: Problem Solving
To apply the principle of virtual work,...