StochSIPP plans a contingent route on a temporal road map with uncertain, locally sensed blockages, using SIPP macro-actions and bounded AND/OR search to minimize expected arrival time.
Deterministic POMDPs Revisited
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study a subclass of POMDPs, called Deterministic POMDPs, that is characterized by deterministic actions and observations. These models do not provide the same generality of POMDPs yet they capture a number of interesting and challenging problems, and permit more efficient algorithms. Indeed, some of the recent work in planning is built around such assumptions mainly by the quest of amenable models more expressive than the classical deterministic models. We provide results about the fundamental properties of Deterministic POMDPs, their relation with AND/OR search problems and algorithms, and their computational complexity.
fields
cs.RO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
StochSIPP: Safe Interval Path Planning in Stochastic Dynamic Environments
StochSIPP plans a contingent route on a temporal road map with uncertain, locally sensed blockages, using SIPP macro-actions and bounded AND/OR search to minimize expected arrival time.