How to tell people where to go: comparing navigational aids
International Journal of Man-Machine Studies
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On finding minimum routes in a network with turn penalties
Communications of the ACM
Modeling Costs of Turns in Route Planning
Geoinformatica
Elements of Good Route Directions in Familiar and Unfamiliar Environments
COSIT '99 Proceedings of the International Conference on Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science
Enriching Wayfinding Instructions with Local Landmarks
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Knowledge-based wayfinding maps for small display cartography
Journal of Location Based Services - 4th International Conference on LBS and TeleCartography Hong Kong
Optimizing active ranges for consistent dynamic map labeling
Computational Geometry: Theory and Applications
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Pictorial representations of routes: chunking route segments during comprehension
Spatial cognition III
Hi-index | 0.00 |
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.