On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
A performance analysis of hierarchical shortest path algorithms
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Shortest Path Algorithms in Transportation models: classical and innovative aspects
Shortest Path Algorithms in Transportation models: classical and innovative aspects
Optimizing Graph Algorithms for Improved Cache Performance
IEEE Transactions on Parallel and Distributed Systems
Domain-independent data cleaning via analysis of entity-relationship graph
ACM Transactions on Database Systems (TODS)
Scaling games to epic proportions
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Adaptive graphical approach to entity resolution
Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
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
Encyclopedia of GIS
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Supporting scalable activity modeling in simulators
Supporting scalable activity modeling in simulators
A hybrid spatial model for representing indoor environments
W2GIS'06 Proceedings of the 6th international conference on Web and Wireless Geographical Information Systems
Middleware solutions for integrated simulation environments
Proceedings of the 7th Middleware Doctoral Symposium
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
This paper considers the problem of Multi-Geography Route Planning (MGRP) where the geographical information may be spread over multiple heterogeneous interconnected maps. We first design a flexible and scalable representation to model individual geographies and their interconnections. Given such a representation, we develop an algorithm that exploits precomputation and caching of geographical data for path planning. A utility-based approach is adopted to decide which paths to precompute and store. To validate the proposed approach we test the algorithm over the workload of a campus level evacuation simulation that plans evacuation routes over multiple geographies: indoor CAD maps, outdoor maps, pedestrian and transportation networks, etc. The empirical results indicate that the MGRP algorithm with the proposed utility based caching strategy significantly outperforms the state of the art solutions when applied to a large university campus data under varying conditions.