Weighting the path continuation in route planning
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
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
When and Why Are Visual Landmarks Used in Giving Directions?
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
Enriching Wayfinding Instructions with Local Landmarks
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Finding Fastest Paths on A Road Network with Speed Patterns
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
A uniform handling of different landmark types in route directions
COSIT'07 Proceedings of the 8th international conference on Spatial information theory
Algorithms for reliable navigation and wayfinding
SC'06 Proceedings of the 2006 international conference on Spatial Cognition V: reasoning, action, interaction
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Pictorial representations of routes: chunking route segments during comprehension
Spatial cognition III
Incorporating landmarks with quality measures in routing procedures
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Towards k-nearest neighbor search in time-dependent spatial network databases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
A model for context-specific route directions
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
Hi-index | 0.00 |
Studies in cognitive science have shown that people have different optimization goals in mind for route selection: beyond shortest travel distance (or time), criteria such as smallest number of turns or straightest path are often considered. A common query that a traveller in a foreign city may ask is "where is a facility of type X". When multiple facilities of the same type are available in the nearby area, usually not the nearest neighbor but the one which is easiest to find is preferred for giving instructions by locals, especially in an unfamiliar and complex urban environment. This paper studies a novel type of neighboring object selection problem, taking cognitive complexity of navigation into account. The main difficulty arises from incorporating spatial chunking and landmark information into neighbor comparisons. We propose an algorithm based on network expansion, which uses incremental processing of graph transformation that models instruction complexity. Our approach can efficiently find the easiest-to-reach neighbor with the guaranteed smallest navigation cost. Through experimental evaluation on real road networks, the performance of the proposed algorithm is demonstrated under various settings. Our comparison results reveal that on average the travel distance of the easiest-to-reach neighbor is only 19.3% longer than that of the nearest neighbor, whereas the navigation cost can achieve a 64.8% reduction.