[go: up one dir, main page]

George et al., 2006 - Google Patents

Time-aggregated graphs for modeling spatio-temporal networks

George et al., 2006

View PDF
Document ID
1615337852323600096
Author
George B
Shekhar S
Publication year
Publication venue
International Conference on Conceptual Modeling

External Links

Snippet

Given applications such as location based services and the spatio-temporal queries they may pose on a spatial network (eg. road networks), the goal is to develop a simple and expressive model that honors the time dependence of the road network. The model must …
Continue reading at conservancy.umn.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/28—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30—Map- or contour-matching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G06F17/30129—Details of further file system functionalities
    • G06F17/30144—Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical

Similar Documents

Publication Publication Date Title
George et al. Time-aggregated graphs for modeling spatio-temporal networks
George et al. Spatio-temporal network databases and routing algorithms: A summary of results
George et al. Time-aggregated graphs for modeling spatio-temporal networks
Hua et al. Probabilistic path queries in road networks: traffic uncertainty aware path selection
Ding et al. Finding time-dependent shortest paths over large graphs
Demiryurek et al. Online computation of fastest path in time-dependent spatial networks
Zheng et al. Probabilistic range queries for uncertain trajectories on road networks
US8566030B1 (en) Efficient K-nearest neighbor search in time-dependent spatial networks
Lefebvre et al. Fast shortest path computation in time-dependent traffic networks
Gamper et al. Defining isochrones in multimodal spatial networks
Seshadhri et al. Fast triangle counting through wedge sampling
Li et al. A hybrid link‐node approach for finding shortest paths in road networks with turn restrictions
Ardakani et al. Decremental algorithm for adaptive routing incorporating traveler information
Nejad et al. Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS
Cruz et al. K-nearest neighbors queries in time-dependent road networks
Cao et al. An accurate solution to the cardinality-based punctuality problem
Chabini Analytical dynamic network loading problem: Formulation, solution algorithms, and computer implementations
Stanojevic et al. W-edge: Weighing the edges of the road network
Liu et al. Vulnerability of road networks
George et al. Spatio-temporal sensor graphs (stsg): A data model for the discovery of spatio-temporal patterns
Gentile Linear user cost equilibrium: a new algorithm for traffic assignment
Krylatov et al. Travel demand estimation in urban road networks as inverse traffic assignment problem
Ganapathy et al. Travel time based traffic rerouting by augmenting traffic flow network with temporal and spatial relations for congestion management
Al Saleh et al. First-order mean-field games on networks and Wardrop equilibrium
Golasowski et al. Alternative paths reordering using probabilistic time-dependent routing