The Hamilton–Jacobi–Bellman (HJB) equation is a continuous-time object, while multistage stochastic programming (SP) and reinforcement learning (RL) are both discrete-time. This note derives both from HJB through a common ancestor: the Bellman recursion obtained by discretizing time. From there the two fields diverge, because each approximates the three hard objects in that recursion (an expectation, a minimization, and a value function) in a different way and under different assumptions.
Costs are minimized throughout, following the SP convention. RL's reward is simply