Revisiting Partial-Order Probabilistic Plannin

Nilufer Onder and Li Li

We present a partial-order probabilistic planning algorithm that adapts plan-graph based heuristics implemented in Repop. We describe our implemented planner, Reburidan, named after its predecessors Repop and Buridan. Reburidan uses plan-graph based heuristics to first generate a base plan. It then improves this plan using plan refinement heuristics based on the success probability of subgoals. Our initial experiments show that these heuristics are effective in improving Buridan significantly.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.