Dynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty

We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann–Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semicontinuous proximal solution of the Hamilton–Jacobi–Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-01-21
DOI
https://doi.org/10.1051/cocv/2025092/pdf
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty

Springer Link (Chiba Institute of Technology)
Optimization and Variational Analysis
article

Dynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty

article en

Abstract

We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann–Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semicontinuous proximal solution of the Hamilton–Jacobi–Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 98%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty · Springer Link (Chiba Institute of Technology) (2026) | TGRS Research Map | TGRS