@MISC{Fujimura95searchin, author = {Kikuo Fujimura}, title = {Search in Temporal Domains}, year = {1995} }

Share

OpenURL

Abstract

Best-first search algorithms have been widely used to find a minimum cost path in graph search. To formulate certain problems involving temporal events, it is at times instrumental to use graphs whose edge costs are time-dependent. In such a graph, shortest paths are dependent on time at which traversal in the graph begins. Typically, structural changes in ß t occur at discrete points in t, where ß t is the shortest path with start time t. In this paper, a best-first algorithm is generalized to handle time-dependent graphs to find shortest paths together with their start time characteristics and some properties of the algorithm are investigated. Keywords: search algorithms, best-first search, time-dependent graphs. 1 Introduction Many heuristic search algorithms are designed to find a minimum cost solution from a given start node to a goal node in a directed graph [7, 10, 13]. Usually, a fixed (i.e., time-invariant) cost is assigned to each edge of the graph. When dealing with a tim...