Sciweavers

Share
AIPS
2010

Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement

10 years 8 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become increasingly important. The most recent planning competition IPC-2008 used the cost of the best known plan divided by the cost of the generated plan as an evaluation metric. This paper proposes and evaluates two simple but effective methods for plan improvement: Action Elimination improves an existing plan by repeatedly removing sets of irrelevant actions. Plan Neighborhood Graph Search finds a new, shorter plan by creating a plan neighborhood graph PNG() of a given plan , and then extracts a shortest path from PNG(). Both methods are implemented in the ARAS postprocessor and are empirically shown to improve the result of several planners, including the top four planners from IPC-2008, under competition conditions. Improving Plan Quality Satisficing deterministic planners can solve much harder instances than op...
Hootan Nakhost, Martin Müller 0003
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2010
Where AIPS
Authors Hootan Nakhost, Martin Müller 0003
Comments (0)
books