Abstract
In this paper we present an approach to providing landmark-based routes using a shortest-path algorithm. We start from the assumption, that at one junction there can be several landmarks to choose among, in order to find an optimal description of a route. The landmark selection used for describing the route is optimized taking the quality measures for the landmarks into account. Therefore, it is necessary to define quality measures. In the paper different types of quality measures are introduced and their integration in the route graph, as well as in a routing algorithm is presented. The usability of the approach is demonstrated using test data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Daniel, M.-P., Denis, M.: Spatial descriptions as navigational aids: A cognitive analysis of route directions. Kognitionswissenschaft 7, 45–52 (1998)
Denis, M., Pazzaglia, F., Cornoldi, C., Bertolo, L.: Spatial discourse and navigation: An analysis of route directions in the city of venice. Applied Cognitive Psychology 13, 145–174 (1999)
Tversky, B., Lee, P.: Pictorial and verbal tools for conveying routes. In: Freksa, C., Mark, D. (eds.) Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science, pp. 51–64. Springer, Heidelberg (1999)
Sorrows, M., Hirtle, S.: The nature of landmarks for real and electronic spaces. In: Freksa, C., Mark, D. (eds.) Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science, pp. 37–50. Springer, Heidelberg (1999)
Nothegger, C., Winter, S., Raubal, M.: Computation of the salience of features. Spatial Cognition and Computation 4, 113–136 (2004)
Winter, S.: Route adaptive selection of salient features. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol. 2825, pp. 349–361. Springer, Heidelberg (2003)
Klippel, A., Winter, S.: Structural salience of landmarks for route directions. In: Cohn, A.G., Mark, D.M. (eds.) COSIT 2005. LNCS, vol. 3693, pp. 347–362. Springer, Heidelberg (2005)
Klippel, A., Tappe, H., Habel, C.: Pictorial representations of routes: Chunking route segments during comprehension. In: Freksa, C., Brauer, W., Habel, C., Wender, K.F. (eds.) Spatial Cognition III. LNCS, vol. 2685, pp. 11–33. Springer, Heidelberg (2003)
Elias, B.: Extracting landmarks with data mining methods. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol. 2825, pp. 375–389. Springer, Heidelberg (2003)
Elias, B., Brenner, C.: Automatic generation and application of landmarks in navigation data sets. In: Fisher, P. (ed.) Developments in Spatial Data Handling, pp. 469–480. Springer, Heidelberg (2004)
Elias, B.: Extraktion von Landmarken für die Navigation. Ph.D thesis, Universität Hannover (in press, 2006)
Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Numerische Mathematik, vol. 1, pp. 269–271. Springer, Heidelberg (1959)
Duckham, M., Kulik, L.: “Simplest” paths: Automated route selection for navigation. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol. 2825, pp. 169–185. Springer, Heidelberg (2003)
Caduff, D., Timpf, S.: The landmark spider: Representing landmark knowledge for wayfinding tasks. In: Barkowsky, T., Freksa, C., Hegarty, M., Lowe, R. (eds.) Reasoning with Mental and External Diagrams: Computational Modeling and Spatial Assistance, pp. 30–35. AAAI Press, Stanford (2005)
Winter, S.: Modeling costs of turns in route planning. GeoInformatica 6, 345–361 (2002)
Golledge, R.G.: Path selection and route preference in human navigation: A progress report. In: Kuhn, W., Frank, A.U. (eds.) COSIT 1995. LNCS, vol. 988, pp. 207–222. Springer, Heidelberg (1995)
Golledge, R.D.: Human wayfinding and cognitive maps. In: Wayfinding Behavior, pp. 5–45. John Hopkins Press (1999)
Dalton, R.C.: The secret is to follow your nose: Route path selection and angularity. Environment and Behavior 35, 107–131 (2003)
Miller, G.: The magical number seven, plus or minus two: Some limits on our capacity for processing information. The Psychological Review 63, 81–97 (1956)
Mark, D.M.: Automated route selection for navigation. IEEE Aerospace and Electronic Systems Magazine 1, 2–5 (1986)
Richter, K.-F., Klippel, A.: A model for context-specific route directions. In: Freksa, C., Knauff, M., Krieg-Brückner, B., Nebel, B., Barkowsky, T. (eds.) Spatial Cognition IV. LNCS, vol. 3343, pp. 58–78. Springer, Heidelberg (2005)
Richter, K.-F., Klippel, A., Freksa, C.: Shortest, fastest, - but what next? a different approach to route directions. In: Raubal, M., Sliwinski, A., Kuhn, W. (eds.) Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung. Beiträge zu den Münsteraner GI-Tagen 2004, IfGIprints, Institut für Geoinformatik; Münster, pp. 205–217 (2004)
Burnett, G., Smith, D., May, A.: Supporting the navigation task: Characteristics of ’good’ landmarks. In: Hanson, M.A. (ed.) Contempory Ergonomics 2001, pp. 441–446. Taylor and Francis, Abington (2001)
Maaß, W.: How spatial information connects visual perception and natural language generation in dynamic environments. In: Frank, A., Kuhn, W. (eds.) Spatial Information Theory, pp. 223–240. Springer, Heidelberg (1995)
Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)
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
Elias, B., Sester, M. (2006). Incorporating Landmarks with Quality Measures in Routing Procedures. In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds) Geographic Information Science. GIScience 2006. Lecture Notes in Computer Science, vol 4197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863939_5
Download citation
DOI: https://doi.org/10.1007/11863939_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44526-5
Online ISBN: 978-3-540-44528-9
eBook Packages: Computer ScienceComputer Science (R0)