Artificial Intelligence
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
Speeding up the Convergence of Real-Time Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Properties of the DGS-Auction Algorithm
Computational Economics
Hi-index | 0.00 |
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edge-weighted graph and the task is to find a the shortest path for fixed source and target nodes such that initially the edge-weights are unknown, but they can be queried. Querying the cost of an edge is expensive and hence the goal is to minimize the total number of edge cost queries executed. In this article we characterize some common properties of sound SPD algorithms, propose a particular algorithm that is shown to be sound and effective. Experimental results on real-world OCR task demonstrate the usefulness of the approach whereas the proposed algorithm is shown to yield a substantial speed-up of the recognition process.