Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

We describe how to convert the heuristic search algorithm A* into an anytime algorithm that
finds a sequence of improved solutions and eventually converges to an optimal solution …

Navigation systems assist almost any kind of motion in the physical world including sailing,
flying, hiking, driving and cycling. On the other hand, traces supplied by global positioning …

The success of model checking is largely based on its ability to efficiently locate errors in
software designs. If an error is found, a model checker produces a trail that shows how the …

To harness modern multicore processors, it is imperative to develop parallel versions of
fundamental algorithms. In this paper, we compare different approaches to parallel best-first …

This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects
for recent progress in domain-independent action planning, namely heuristic search and …

Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …

We consider how to use external memory, such as disk storage, to improve the scalability of
heuristic search in statespace graphs. To limit the number of slow disk I/O operations, we …

We present a simple combination of A* and IDA*, which we call A*+ IDA*. It runs A* until
memory is almost exhausted, then runs IDA* below each frontier node without duplicate …

This paper provides a novel approach for optimal route planning by making efficient use of
the underlying geometrical structure. It combines classical artificial intelligence exploration …