Edelkamp, Stefan and Jabbar, Shahid and Lluch-Lafuente, Alberto Cost-Algebraic Heuristic Search. In: AAAI-05, Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA. AAAI Press / The MIT Press, pp. 1362-1367. ISBN 1-57735-236-X (2005)Full text not available from this repository.
Heuristic search is used to efficiently solve the single-node shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions, like typical Quality of Service attributes. We thus generalize A*, the popular heuristic search algorithm, for solving optimal-path problem. The paper provides an answer to a fundamental question for AI search, namely to which general notion of cost, heuristic search algorithms can be applied. We proof correctness of the algorithms and provide experimental results that validate the feasibility of the approach.
|Item Type:||Book Section|
|Identification Number:||AAAI-05 / 1362|
|Additional Information:||Copyright 2005, American Association for Artificial Intelligence (www.aaai.org). All rights reserved.|
|Funders:||Supported by the German Research Foundation (DFG) projects Heuristic Search Ed 74/3 and Directed Model Checking Ed 74/2. †Supported by the European Research Training Network SEGRAVIS.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||24 Mar 2011 10:18|
|Last Modified:||11 Jul 2011 14:34|
Actions (login required)