ERA users may experience an intermittent Deposit/Save error. We apologize for any inconvenience this may cause. Thank you for your patience while we work to resolve the issue. When the work is completed, we'll remove this notice.
SearchSkip to Search Results
- 2Artificial Intelligence
- 2Heuristic Search
- 1Active Stratified Sampling
- 1Learning Heuristic Functions
Many important problems can be cast as state-space problems. In this dissertation we study a general paradigm for solving state-space problems which we name Cluster-and-Conquer (C&C). Algorithms that follow the C&C paradigm use the concept of equivalent states to reduce the number of states...
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...