EBL/DDB & Randomized Search
- Random-restart systematic searches place limits on the number of backtracks, and a limit on number of restarts [Gomes, Selman, Kautz; AAAI-99]
- Whenever the number of backtracks are exceeded, the search re-starts from the top of the search tree
- Randomization is used so that a different part of the search tree is explored on different restarts
- Implemented random-restart strategy for Graphplan
- Limit the number of inter-level backtracks
- Randomize the order in which the actions are considered for supporting a goal
- EBL/DDB can help by getting more mileage out of the given backtrack/restarts limit