External A * External A *

In this paper we study External A*, a variant of the internal A* algorithm that employs external memory. The approach applies to implicit, undirected, unweighted state space problem graphs with consistent estimates. The complexity of the External algorithm is almost linear in external sorting time and accumulates to O(sort(|E|) + scan(|V |)) I/Os, where V… CONTINUE READING