Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176): Difference between revisions
From MaRDI portal
Latest revision as of 01:14, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games |
scientific article |
Statements
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (English)
0 references
23 March 2012
0 references
The main objective of this paper is to study a time bounded reachability problem. It is shown that there exist an optimal control that enjoys a simple structure, i.e., it is deterministic and depends only on the remaining time.
0 references
continuous time Markov decision process
0 references
zero-sum Markov game
0 references
optimal scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
