A Polynomial All Outcome Determinization for Probabilistic Planning

Published on 2011-07-213496 Views

Thomas Keller

Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. In this paper, we prese

ICAPS 2011 - Freiburg

Related categories

Planning and Scheduling

Presentation

A Polynomial All Oucomes Determinization for Probabilistic Planning00:00

Outline00:10

Probabilistic Planning Task00:39

Effects01:27

Example: Canadian Traveler’s Problem (CTP)02:10

Example: Part of the State Transition System (1)02:53

Example: Part of the State Transition System (2)03:31

Motivation: Determinization (1)03:48

Motivation: Determinization (2)04:08

Motivation: Determinization (3)04:38

Motivation: Determinization (4)05:00

Determinization Strategies (1)05:15

Example: Single Outcome Determinization (1)05:45

Example: Single Outcome Determinization (2)05:53

Determinization Strategies (2)06:12

Example: 1ND-based All Outcomes Determinization06:37

Polynomial Determinization07:30

Forked Normal Form (FNF)08:24

Example: FNF-based All Outcomes Determinization (1)09:37

Example: FNF-based All Outcomes Determinization (2)10:37

Example: FNF-based All Outcomes Determinization (3)11:09

Example: FNF-based All Outcomes Determinization (4)12:06

Evaluation: CTP12:33

Conclusion14:16