# Safe Dynamic Programming

arXiv: https://arxiv.org/abs/2109.03307 · HTML: https://mlsanity.com/paper/2109.03307/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Sep 2021.

## Built on by (most cited first, 1 of 1)

- [On Bellman's principle of optimality and Reinforcement learning for safety-constrained Markov decision process](https://mlsanity.com/paper/2302.13152/) (2023)

## Abstract (arXiv)

We incorporate safety specifications into dynamic programming. Explicitly, we address the minimization problem of a Markov decision process up to a stopping time with safety constraints. To incorporate safety into dynamic programming, we establish a formalism leaning upon the evolution equation. We show how to compute the safety function with the method of dynamic programming. In the last part of the paper, we develop several algorithms for safe dynamic programming.