Search
Skip to Search Results- 2Sturtevant, Nathan R.
- 2Valenzano, Richard
- 2Xie, Fan
- 1Felner, Ariel
- 1Holte, Robert C.
- 1Müller, Martin
-
2013
Sturtevant, Nathan R., Valenzano, Richard, Schaeffer, Jonathan
While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause...
-
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...