• Calendar

July 30, Tuesday
12:00 – 13:00

We will look at search problems from different domains of Artificial Intelligence: constraint satisfaction, adversarial game playing, and planning - and show how the techniques of rational meta-reasoning could help significantly decrease the search times. We will also discuss the difficulties of applying rational meta-reasoning in each of the case studies, and how they were overcome. Informed search algorithms employ heuristics to speed-up solving of certain problem instances. However, the cost of computing an heuristic can occasionally exceed the benefit, slowing down the search. For the best results, different heuristics should be applied at different search states, and sometimes a cheaper less informative heuristic, or even blind search, results in a shorter overall search time.