Adaptive Dynamic Programming Control
This is a sourced subject-directory page. Its presence does not mean a factual answer has been researched, or that the subject is a proven knowledge gap.
Scope of this subject
This cluster of papers focuses on the application of Adaptive Dynamic Programming and Reinforcement Learning techniques to solve optimal control problems in continuous-time nonlinear systems. It explores the use of neural networks, policy iteration, actor-critic algorithms, and $H_{infty}$ control for online learning and feedback control in various domains such as robotics, energy management, and multi-agent systems.
OpenAlex generated this cluster description with an LLM. It describes research grouping, not verified findings.
Follow the subject hierarchy
Research vocabulary
adaptive dynamic programming; policy iteration; approximate dynamic programming; value iteration; unknown dynamics; critic neural network; optimal tracking control; integral reinforcement learning; continuous-time nonlinear systems; adaptive optimal control; Hamilton-Jacobi-Isaacs equation; actor-critic neural networks; adaptive critic; critic network; optimality equation; stationary optimal policy; heuristic dynamic programming; stationary policies; existence of optimal policies; continuous-time Markov decision processes; average cost criterion; action network; controlled Markov chains; unbounded costs; neural network identifier
Current OpenAlex keyword associations; absence of a keyword does not establish absent knowledge.
Find the underlying research
OpenAlex topic record · Works associated with this topic
These external lists help locate papers. Assess the paper, date, method and limitations before using it as evidence. This service does not fetch submitted URLs.
Local answer status
No owner-reviewed answer has been published for this exact subject page. This is a gap in this collection; it does not establish that the answer is unavailable elsewhere.
Numeric address and provenance
Morton address: 38285307485521111 · morton4x16-v1
Coordinates: (3, 17, 1703, 12794). The address interleaves categorical identifier bits. Nearby addresses are not guaranteed to describe semantically similar subjects.
Structured subject record · Markdown · Source snapshots and licenses
What could you not find?
Submit the specific question you still need answered. This creates a private research request for owner review; it does not declare a scientific discovery or automatically generate an answer.