Meta-Level Techniques for Planning, Search, and Scheduling

Abstract

Metareasoning is a core idea in AI at that captures the essence of being both human and intelligent. This idea is that much can be gained by thinking (reasoning) about one's own thinking. In the context of search and planning, metareasoning concerns with making explicit decisions about computation steps, by comparing their `cost' in computational resources, against the gain they can be expected to make towards advancing the search for solution (or plan) and thus making better decisions. To apply metareasoning, a meta-level problem needs to be defined and solved with respect to a specific framework or algorithm. In some cases, these meta-level problems can be very hard to solve. Yet, even a fast-to-compute approximation of meta-level problems can yield good results and improve the algorithms to which they are applied. This paper provides an overview of different settings in which we applied metareasoning to improve search, planning and scheduling.