Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9175224900245668
0 references
0.9056510925292968
0 references
0.8685457110404968
0 references
0.8607500195503235
0 references
0.8604844212532043
0 references
