relation: http://eprints.imtlucca.it/163/
title: Cost-Algebraic Heuristic Search
creator: Edelkamp, Stefan
creator: Jabbar, Shahid
creator: Lluch-Lafuente, Alberto
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: AAAI Press / The MIT Press
contributor: M. Veloso, Manuela
contributor: Kambhampati, Subbarao
date: 2005
type: Book Section
type: PeerReviewed
identifier:   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)  
relation: http://www.aaai.org/Papers/AAAI/2005/AAAI05-216.pdf
relation: AAAI-05 / 1362