Probabilistic Temporal Planning with Uncertain Durations

Few temporal planners handle both concurrency and uncertain durations, but these features commonly co-occur in real-world domains. In this paper, we discuss the challenges caused by concurrent, durative actions whose durations are uncertain. We present five implemented algorithms, including ΔDUR

Authors

• Mausam Mausam University of Washington

Keywords

No keywords are indexed for this paper.