A fewest-turn-and-shortest path algorithm based on breadth-first search
暂无分享,去创建一个
Di He | Yan Zhou | Zhe Wang | Weisheng Wang
[1] Jacob Shapiro,et al. Level graphs and approximate shortest path algorithms , 1992, Networks.
[2] Alasdair Turner,et al. The role of angularity in route choice: an analysis of motorcycle courier GPS traces , 2009, COSIT 2009.
[3] Werner Kuhn,et al. Spatial Information Theory. Foundations of Geographic Information Science , 2003, Lecture Notes in Computer Science.
[4] Reginald G. Golledge,et al. Path Selection and Route Preference in Human Navigation: A Progress Report , 1995, COSIT.
[5] L A Streeter,et al. A Profile of Drivers' Map-Reading Abilities , 1986, Human factors.
[6] M. Denis,et al. Spatial discourse and navigation: an analysis of route directions in the city of Venice , 1999 .
[7] T. Gärling,et al. Cognitive Maps and Urban Travel , 2002 .
[8] Bin Jiang,et al. Computing the fewest-turn map directions based on the connectivity of natural roads , 2010, Int. J. Geogr. Inf. Sci..
[9] Lars Kulik,et al. "Simplest" Paths: Automated Route Selection for Navigation , 2003, COSIT.
[10] Bing Liu. Using Knowledge to Isolate Search in Route Finding , 1995, IJCAI.
[11] Lynn A. Streeter,et al. How to Tell People Where to Go: Comparing Navigational Aids , 1985, Int. J. Man Mach. Stud..
[12] Christophe Claramunt,et al. Spatial Information Theory, 9th International Conference, COSIT 2009, Aber Wrac'h, France, September 21-25, 2009, Proceedings , 2009, COSIT.