Abstract The Algorithm Selection Problem is concerned with selecting the best algorithm to
solve a given problem on a case-by-case basis. It has become especially relevant in the last …

In many applications of shortest-path algorithms, it is impractical to find a provably optimal
solution; one can only hope to achieve an appropriate balance between search time and …

The obvious way to use several admissible heuristics in searching for an optimal solution is
to take their maximum. In this paper, we aim to reduce the time spent on computing …

In this paper we discuss and experiment with Lazy A*, a variant of A* where heuristics are
evaluated lazily and with Rational Lazy A*, which decides whether to compute the more …

Real-time heuristic search addresses the setting in which planning andacting can proceed
concurrently. We explore the use of metareasoning at two decision points within a real-time …

Intelligent agents perform computations to help them decide how to act. But which
computations will best inform these decisions? How long should an agent think before …

In the past, we adapted metareasoning techniques to decide on whether to evaluate a costly
heuristic in A*[6]. Since IDA*[3] is a linear-space simulation of A*, similar techniques are …

Meta-reasoning can improve numerous search algorithms, but necessitates collection of
statistics to be used as probability distributions, and involves restrictive meta-reasoning …

We consider two fundamental questions in concurrent planning and execution. First, if the
domain has an 'identity action'that allows the agent to postpone acting, remain in the same …

Heuristic search is a technique used pervasively in artificial intelligence and automated
planning. Often an agent is given a task that it would like to solve as quickly as possible. It …