Jie Shao
ABSTRACT
Research on cognitive science indicates that humans often use different criteria for route selection. An alternative type of spatial proximity search on road networks recently has been proposed to find the easiest-to-reach neighboring object with the smallest navigation complexity. This paper presents an evaluation to compare the effectiveness of easiest-to-reach neighbor query against a classic nearest neighbor query in a real-world setting. Our user study demonstrates usability of the new spatial query type and suggests people may not always care about travel distance most. To provide flexibility to accommodate different requirements, we also show how to achieve tradeoff between navigation complexity and travel distance for advanced navigational assistance.
- M. Duckham and L. Kulik. "Simplest" paths: Automated route selection for navigation. In Spatial Information Theory. Foundations of Geographic Information Science, International Conference, COSIT 2003, Ittingen, Switzerland, September 24-28, 2003, Proceedings, pages 169--185, 2003.Google Scholar
- R. G. Golledge. Path selection and route preference in human navigation: A progress report. In Spatial Information Theory: A Theoretical Basis for GIS, International Conference COSIT '95, Semmering, Austria, September 21-23, 1995, Proceedings, pages 207--222, 1995.Google Scholar
- S. Haque, L. Kulik, and A. Klippel. Algorithms for reliable navigation and wayfinding. In Spatial Cognition V: Reasoning, Action, Interaction, International Conference Spatial Cognition 2006, Bremen, Germany, September 24-28, 2006, Revised Selected Papers, pages 308--326, 2006. Google ScholarDigital Library
- X. Huang, C. S. Jensen, H. Lu, and S. Saltenis. S-grid: A versatile approach to efficient query processing in spatial networks. In Advances in Spatial and Temporal Databases, 10th International Symposium, SSTD 2007, Boston, MA, USA, July 16-18, 2007, Proceedings, pages 93--111, 2007. Google ScholarDigital Library
- B. Jiang and X. Liu. Computing the fewest-turn map directions based on the connectivity of natural roads. International Journal of Geographical Information Science, 25(7):1069--1082, 2011. Google ScholarDigital Library
- A. Klippel, H. Tappe, and C. Habel. Pictorial representations of routes: Chunking route segments during comprehension. In Spatial Cognition III, Routes and Navigation, Human Memory and Learning, Spatial Representation and Spatial Learning, pages 11--33, 2003. Google ScholarDigital Library
- M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of the 2004 International Conference on Very Large Data Bases, pages 840--851, 2004. Google ScholarDigital Library
- D. M. Mark. Automated route selection for navigation. IEEE Aerospace and Electronic Systems Magazine, 1(9):2--5, 1986.Google ScholarCross Ref
- D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In Proceedings of the 2003 International Conference on Very Large Data Bases, pages 802--813, 2003. Google ScholarDigital Library
- K.-F. Richter and M. Duckham. Simplest instructions: Finding easy-to-describe routes for navigation. In Geographic Information Science, 5th International Conference, GIScience 2008, Park City, UT, USA, September 23-26, 2008. Proceedings, pages 274--289, 2008. Google ScholarDigital Library
- H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In Proceedings of the 2008 ACM International Conference on Management of Data, pages 43--54, 2008. Google ScholarDigital Library
- J. Shao, L. Kulik, and E. Tanin. Easiest-to-reach neighbor search. In Proceedings of the 2010 ACM International Conference on Advances in Geographic Information Systems, pages 360--369, 2010. Google ScholarDigital Library
- S. Winter. Weighting the path continuation in route planning. In Proceedings of the 2001 ACM International Symposium on Advances in Geographic Information Systems, pages 173--176, 2001. Google ScholarDigital Library
- S. Winter. Modeling costs of turns in route planning. GeoInformatica, 6(4):363--380, 2002. Google ScholarDigital Library
Index Terms
- Travel distance versus navigation complexity: a study on different spatial queries on road networks
Recommendations
Robot Navigation with Distance Queries
We consider the problem of online robot navigation in an unfamiliar two-dimensional environment, using comparatively limited sensing information. In particular, the robot has local sensors to detect the proximity of obstacles and permit boundary-...
Endcoding complexity versus minimum distance
A bound on the minimum distance of a binary error-correcting code is established given constraints on the computational time-space complexity of its encoder where the encoder is modeled as a branching program. The bound obtained asserts that if the ...
Distance-only based navigation of Wheeled Mobile Robots with obstacle avoidance
ROBIO '09: Proceedings of the 2008 IEEE International Conference on Robotics and BiomimeticsWe consider the problem of wheeled mobile robot navigation towards an unknown stationary or maneuvering target with real time obstacle avoidance using range-only measurements. We study a method for navigation and guidance termed Equiangular Navigation ...
Comments