REVIEW 1 cited by
Deterministic POMDPs Revisited
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Deterministic POMDPs Revisited
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.