Introduction to algorithms
A gentle introduction to Haskell
ACM SIGPLAN Notices - Haskell special issue
Developing algorithms and software for geometric path planning problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Algebra of programming
SIAM Journal on Computing
A Method for the Solution of the Nth Best Path Problem
Journal of the ACM (JACM)
The spatial semantic hierarchy
Artificial Intelligence
On finding minimum routes in a network with turn penalties
Communications of the ACM
Weighting the path continuation in route planning
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Spatial Cognition and Computation
A Conceptual Model of Wayfinding Using Multiple Levels of Abstraction
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Search on transportation network for location-based service
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Optimal route selection with route planners: results of a desktop usability study
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
A fastest route planning for LBS based on traffic prediction
ICS'05 Proceedings of the 9th WSEAS International Conference on Systems
A Telematics Service System Based on the Linux Cluster
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Editing and versioning dynamic network models
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Versioning of Network Models in a Multiuser Environment
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
ACC'09 Proceedings of the 2009 conference on American Control Conference
Automatic generation of destination maps
ACM SIGGRAPH Asia 2010 papers
Easiest-to-reach neighbor search
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Applications of graph algorithms in GIS
SIGSPATIAL Special
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Information on the consequence of a move and its use for route improvisation support
COSIT'11 Proceedings of the 10th international conference on Spatial information theory
Integrated management of multi-level road network and transportation networks
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
High performance multimodal networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Shortest path search from a physical perspective
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Network and psychological effects in urban movement
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Incorporating landmarks with quality measures in routing procedures
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Generalized maneuvers in route planning
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
GPSView: A scenic driving route planner
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A probabilistic model for road selection in mobile maps
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Flexible route guidance through turn instruction graphs
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
Hi-index | 0.00 |
In this paper a model that handles costs of turns in route planning is defined, investigated and discussed. Costs are traditionally attached to edges in a graph. For some important route planning problems other costs can be identified, namely costs that appear when leaving one edge and entering the next. Examples are turn restrictions, the turning angle, or the simple necessity to turn. Such costs cannot be stored as attributes of nodes or edges in the graph, and they cannot be handled correctly by shortest path algorithms without modifications. Turn costs can be represented by a pseudo-dual graph in a way that shortest path algorithms run without modifications. Although the idea is not new, it has not found much interest in the literature. The pseudo-dual graph is defined here in a new way, it is systematically investigated, and some practical applications are shown. Concentrating strictly on topology, it turns out that the pseudo-dual graph is conceptually cleaner and more efficient in route planning than alternative, currently used ways to deal with turn costs. The discussed applications are from the field of pedestrian navigation, which gave rise to this research.