The paper constructs a layered homogeneous model equivalent to the non-homogeneous semi-Markov reach-avoid model and proposes a value iteration algorithm for the maximal reach-avoid probability and an ε-optimal policy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Reach-avoid semi-Markov decision processes with time-varying obstacles
The paper constructs a layered homogeneous model equivalent to the non-homogeneous semi-Markov reach-avoid model and proposes a value iteration algorithm for the maximal reach-avoid probability and an ε-optimal policy.