We will be performing routine ERA maintenance starting 3PM Tuesday Feb 19 until 3PM Wednesday Feb 20. ERA searches and downloads will perform as usual, but the "Deposit" and "Edit" function will be suspended during the maintenance period. When the work is complete, we'll remove this notice. Thanks for your understanding!
SearchSkip to Search Results
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...
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...