Information on the Consequence of a Move and Its Use for Route Improvisation Support
This paper proposes a new method of navigational assistance in unfamiliar environments. In such environments, major concerns would normally be how to find a good route to a selected destination and how to design and communicate directions to follow that route. This may not be the case, however, if route selection criteria are not complete or subject to change during a trip. To cope with such uncertainty, the proposed method calculates, for each possible move from the current position, a single value characterizing the consequence of that move, e.g., how long it will take to reach the destination if that move is made. The paper outlines a design of a route improvisation support system equipped with this method, and underlines the merit of letting the user build up a route progressively by taking into account highly local, temporary, or personal information that is not stored in the system but collected by the user while traveling.
KeywordsShort Path Navigation System Short Path Problem Short Path Length Short Path Algorithm
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs (1993)Google Scholar
- 4.Ellard, C.: You Are Here: Why We Can Find Our Way to the Moon, But Get Lost in the Mall. Doubleday, New York (2009)Google Scholar
- 5.Dehne, F., Omran, M.T., Sack, J.-R.: Shortest paths in time-dependent FIFO networks using edge load forecasts. In: Proceedings of the Second International Workshop on Computational Transportation Science, IWCTS 2009 (2009)Google Scholar
- 10.Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for ivhs application. IVHS Journal 1, 1–11 (1993)Google Scholar
- 14.Montello, D.R.: Navigation. In: Shah, P., Miyake, A. (eds.) The Cambridge Handbook of Visuospatial Thinking, pp. 257–294. Cambridge University Press, Cambridge (2005)Google Scholar
- 18.Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of ACM SIGMOD Conference, Vancouver, Canada, pp. 43–54 (2008)Google Scholar
- 19.Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB), Lyon, France, vol. 2, pp. 1210–1221 (2009)Google Scholar
- 25.Ziliaskopoulos, A., Mahmassani, H.S.: Time-dependent shortest path algorithm for real-time intelligent vehicle highway system applications. Transportation Research Record 1408, 94–100 (1993)Google Scholar