80 citations · 252 across the 21 of their papers we have counts for
22 papers
A Formal Metareasoning Model of Concurrent Planning and Execution
Amihay Elboher, Ava Bensoussan, Erez Karpas +3
Agents that plan and act in the real world must deal with the fact that time passes as they are planning. When timing is tight, there may be insufficient time to complete the searc…
On Existence of Must-Include Paths and Cycles in Undirected Graphs
Yefim Dinitz, Solomon Eyal Shimony
Given an undirected graph and vertices , we study finding whether there exists a simple path from to such that . As a sub-pro…
Estimating the Probability of Meeting a Deadline in Hierarchical Plans
Liat Cohen, Solomon Eyal Shimony, Gera Weiss
Given a hierarchical plan (or schedule) with uncertain task times, we propose a deterministic polynomial (time and memory) algorithm for estimating the probability that its meets a…
Rational Deployment of Multiple Heuristics in IDA*
David Tolpin, Oded Betzalel, Ariel Felner +1
Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissi…
Selecting Computations: Theory and Applications
Nicholas Hay, Stuart Russell, David Tolpin +1
Sequential decision problems are often approximately solvable by simulating possible future action sequences. Metalevel decision procedures have been developed for selecting which…
Generic Preferences over Subsets of Structured Objects
Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak +1
Various tasks in decision making and decision support systems require selecting a preferred subset of a given set of items. Here we focus on problems where the individual items are…