Cost-algebraic heuristic search

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1362-1367

  Edelkamp, Stefan ^a   Jabbar, Shahid ^a   Lafuente, Alberto Lluch ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC FORMALISM; HEURISTIC SEARCH; SHORTEST PATH PROBLEM; WEIGHTED GRAPHS;

ALGEBRA; ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE;

EID: 29344444363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bistarelli, S.; Montanari, U.; and Rossi, F. 1997. Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2):201-236.
2. Bistarelli, S.; Montanari, U.; and Rossi, F. 2002. Soft constraint logic programming and generalized shortest path problems. Journal of Heuristics 8(1):25-41.
3. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
4. Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2001. Introduction to Algorithms. MIT Press.
5. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(4):318-334.
6. Dechter, R., and Pearl, J. 1983. The optimality of A* revisited. In AAAI, 59-99.
7. Edelkamp, S.; Leue, S.; and Lluch Lafuente, A. 2003. Directed explicit-state model checking in the validation of communication protocols. STTT5(2-3):247-267.
8. Ferrari, G., and Lluch Lafuente, A. 2004. A logic for graphs with QoS. In 1st Workshop on Views On Designing Complex Architecture.
9. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics 4:100-107.
10. Jabbar, S. 2003. GPS-based navigation in static and dynamic environments. Master's thesis, University of Freiburg.
11. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
12. Lluch Lafuente, A., and Montanari, U. 2004. Quantitative mu-calculus and CTL based on constraint semirings. In 2nd Workshop on Quantitative Aspects of Programming Languages, volume 112 of ENTCS.
13. Mandow, L., and de la Cruz, J. L. P. 2005. A new approach to multiobjective A* search. In Proceedings of Nineteenth International Joint Conference on AI (IJCAI). to appear.
14. Müller, M. 2001. Partial order bounding: a new approach to evaluation in game tree search. Artificial Intelligence 129(1-2):279-311.
15. Pearl, J. 1985. Heuristics. Addison-Wesley.
16. Pijls, W., and Kolen, A. 1992. A general framework for shortest path algorithms. Technical Report 92-08, Erasmus Universiteit Rotterdam.
17. Rote, A. 1985. A systolic array algorithm for the algebraic path problem (shortest path; matrix inversion). Computing 34:191-219.
18. Sobrinho, J. L. 2002. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. IEEE/ACM Tran. on Networking 10(4):541-550.
19. Steward, B. S., and White, C. C. 2001. Multi-objective A*. J. of ACM 38(4):775-814.
20. Xiao, X., and Ni, L. 1999. Internet QoS: A big picture. IEEE Network Magazine.
21. Zhou, R., and Hansen, E. 2003. Sparse-memory graph search. In International Joint Conference on Artificial Intelligence (IJCAI), 1259-1268.