Search
Skip to Search Results- 3Artificial Intelligence
- 3Planning
- 1Action Elimination
- 1Heuristic Search
- 1Plan Neighborhood Graph Search
- 1Plan improvement
-
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
Download2010
Nakhost, Hootan, Müller, Martin
Technical report TR10-01. 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...
-
2013
Valenzano, Richard, Müller, Martin, Xie, Fan
Most of the satisficing planners which are based on heuristic search iteratively improve their solution quality through an anytime approach. Typically, the lowest-cost solution found so far is used to constrain the search. This avoids areas of the state space which cannot directly lead to lower...
-
Spring 2016
This thesis proposes, analyzes and tests different exploration-based techniques in Greedy Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration-based techniques by combining GBFS and random walk exploration locally. We then conduct deep analysis on how...