Showing papers on "Admissible heuristic published in 1994"
18 Sep 1994
TL;DR: Several optimality theorems hold for the A* algorithm, one important says: A* dominates every other admissible heuristic search algorithm assumed that the underlying heuristic function is monotone.
Abstract: Several optimality theorems hold for the A* algorithm, one important says: A* dominates every other admissible heuristic search algorithm assumed that the underlying heuristic function is monotone. An analogous result is proved for the bidirectional case. A bidirectional heuristic search algorithm, named OBDS, is presented which is admissible and dominates every other admissible bidirectional heuristic search algorithm B assumed that the underlying heuristic function is bi-monotone.
5 citations
02 Oct 1994
TL;DR: In this paper, the authors considered the problem of path selection for a generalized HAZMAT routing problem where there were multiple destinations and where there are multiple and nonseparable objectives and proposed two related algorithms, BU* and DU*, which are guaranteed to terminate with the optimal path given an admissible heuristic set.
Abstract: Considers the problem of path selection for a generalized HAZMAT routing problem where there are multiple destinations and where there are multiple and nonseparable objectives. This problem may be modeled as an OR-graph where the authors assume that arc cost estimates are given but actual arc cost determination requires some computational effort. To solve this problem the authors use two related algorithms, BU* and DU*, which are guaranteed to terminate with the optimal path given an admissible heuristic set. Computational results indicate that the algorithms' graph-pruning power significantly reduces both the number of arc cost determination steps and node expansion steps. >
2 citations