Remarks on the A** algorithm
References
- [1] R. Dechter, J. Pearl, Generalized best-first search strategies and optimality of A ∗, Journal ACM, 32, 3, (1985) 505-536. ⇒192, 199, 204
- [2] I. Fekete, T. Gregorics, L. Zs. Varga, Corrections to graph-search algorithms. Proc. of the Fourth Conference of Program Designers, ELTE, Budapest, June 1-3, 1988. ⇒191
- [3] T. Gregorics, Which of graphsearch versions is the best? Annales Univ. Sci. Budapest., Sect. Comput. 15 (1995) 93-108. ⇒191, 202
- [4] A. Martelli, On the complexity of admissible search algorithms. Artificial Intelligence, 8, 1 (1977) 1-13. ⇒198, 201, 204
- [5] N. J. Nilsson, Principles of Artificial Intelligence. Springer-Verlag, 1982. ⇒190, 191, 195, 196, 197, 198, 204
- [6] S. J. Russell, P. Norvig, Artificial Intelligence. A Modern Approach. Prentice Hall Inc., 1995. ⇒193, 204
DOI: https://doi.org/10.1515/ausi-2015-0003 | Journal eISSN: 2066-7760
Language: English
Page range: 190 - 205
Submitted on: Oct 7, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Keywords:
Related subjects:
© 2015 Tibor Gregorics, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.