This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Djidjev HN (1997) Efficient Algorithms for Shortest Path Queries in Planar Digraphs. Lecture Notes in Computer Science 1973:51–165
Dubois N, Semet F (1995) Estimation and determination of shortest path length in a road network with obstacles. European Journal of Operational Research 83:105–116
Gelperin D (1977) On the Optimality of A*. Artificial Intelligence 8:69–76.
Hahne F (2000) Kürzeste und schnellste Wege in digitalen Straßenkarten. Dissertation, Universität Hildesheim
Hart PE, Nilson, NJ, Raphael, B (1968) A formal basis for the heuristic determination of minimal cost paths. IEEE transactions on SSC 4:100–107.
Hart PE, Nilson NJ, Raphael, B (1972) Correction to: „A formal basis for the heuristic determination of minimal cost paths“. Sigart newsletters 37:28–29
Nilsson N (1971) Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York
Schäfer A (1998) Kürzeste Wege in digitalen Straßenkarten unter Berücksichtigung von Gedächtnissen, Diplomarbeit, Universität Hildesheim
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hahne, F. (2006). Analyse der Beschleunigung des A*-Verfahrens durch verbesserte Schätzer für die Restdistanz. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_62
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)