A Voronoi-Based Hybrid Navigation System for Road Network Database

2008 ◽  
Author(s):  
Daehoon Kim ◽  
Eenjun Hwang
Keyword(s):  
Navigation System ◽  
Road Network ◽  
Network Database ◽  
Road Network Database

scholarly journals An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Tien-Khoi Phan ◽  
HaRim Jung ◽  
Ung-Mo Kim
Keyword(s):  
Efficient Algorithm ◽  
Road Network ◽  
Euclidean Distance ◽  
Optimal Location ◽  
External Memory ◽  
Distance Metric ◽  
Network Database ◽  
Road Network Database

Given a set of positive-weighted points and a query rectangler(specified by a client) of given extents, the goal of a maximizing range sum (MaxRS) query is to find the optimal location ofrsuch that the total weights of all the points covered byrare maximized. All existing methods for processing MaxRS queries assume the Euclidean distance metric. In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial) road network; that is, the client cannot move freely in space. This paper addresses the problem of processing MaxRS queries in a road network. We propose the external-memory algorithm that is suited for a large road network database. In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations. Through simulations, we evaluate the performance of the proposed algorithm.

On Transforming a Road Network Database to a Graph for Localization Purpose

2016 ◽  
Vol 13 (2) ◽  
pp. 46-55
Author(s):  
Xiangli Meng ◽  
Pascal Rebreyend
Keyword(s):  
Road Network ◽  
Specific Area ◽  
Population Data ◽  
Transformation Process ◽  
Distance Measures ◽  
Facility Locations ◽  
The Road ◽  
Network Database ◽  
National Road ◽  
Road Network Database

The problems of finding best facility locations require complete and accurate road networks with the corresponding population data in a specific area. However the data obtained from road network databases usually do not fit in this usage. In this paper the authors propose a procedure of converting the road network database to a road graph which could be used for localization problems. Several challenging problems exist in the transformation process which are commonly met also in other data bases. The procedure of dealing with those challenges are proposed. The data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The residential points are also processed in ordered to match the graph. The reduction of the graph is done maintaining the accuracy of distance measures in the network.

The NIST road network database:

2004 ◽  
Author(s):  
Craig Schlenoff ◽  
Stephen Balakirsky ◽  
Anthony Barbera ◽  
Chris Scrapper ◽  
Jerome Ajot ◽  
...  
Keyword(s):  
Road Network ◽  
Network Database ◽  
Road Network Database

Towards a standardized European road network database

1990 ◽  
Vol 17 (3) ◽  
pp. 301-312
Author(s):  
Luc Heres ◽  
Niek de Winter
Keyword(s):  
Road Network ◽  
Network Database ◽  
Road Network Database

A High-Efficient Data Model of Road Network in Vehicle Navigation System

2011 ◽  
Vol 135-136 ◽  
pp. 37-42 ◽  
Author(s):  
Yan Li ◽  
Yang Gao
Keyword(s):  
Navigation System ◽  
Data Model ◽  
Road Network ◽  
Spatial Index ◽  
Access Time ◽  
Vehicle Navigation ◽  
Quad Tree ◽  
Vehicle Navigation System ◽  
Tree Index ◽  
Topology Model

Vehicle navigation system (VNS) is a world acknowledged efficient way of solving the urban traffic problem, and road network database is one of the core component parts in the system. In order to improve performance of VNS, this paper conducts a research on data organization technique of road network, and proposes a novel data model of road network, which includes spatial index and topology structure. Firstly, some common spatial index structures, such as regular grid index, R-tree index and quad-tree index, are studied, and a novel spatial index structure based on “hierarchical quad-tree and R-tree” index of two ranks is proposed. This structure can greatly reduce the access time of map data and raise index performance. Secondly, a topology model of road network based on arc-relation is presented, which can effectively solve turn penalty problems in the conventional topology model based on vertex-relation and represent real road network. Thirdly, a real topology storage structure using adjacency list is designed and a corresponding creating algorithm is put forward. Finally, the tests on the practical system prove that the proposed model effectively support kinds of data-processing and greatly raise the performance of the system.

scholarly journals Analysis of spatiotemporal data to predict traffic conditions aiming at a smart navigation system for sustainable urban mobility

2019 ◽  
Vol 52 (4) ◽  
pp. 27-46 ◽  
Author(s):  
Kalliopi Kyriakou ◽  
Konstantinos Lakakis ◽  
Paraskevas Savvaidis ◽  
Socrates Basbas
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Navigation System ◽  
Road Network ◽  
Spatiotemporal Data ◽  
Transport Systems ◽  
Economic Losses ◽  
Urban Mobility ◽  
Traffic Conditions ◽  
Sustainable Urban Mobility

Urban traffic congestion created by unsustainable transport systems and considered as a crucial problem for the urbanised areas provoking air pollution, heavy economic losses due to the time and fuel wasted and social inequity. The mitigation of this problem can improve efficiency, connectivity, accessibility, safety and quality of life, which are crucial parameters of sustainable urban mobility. Encouraging sustainable urban mobility through smart solutions is essential to make the cities more liveable, sustainable and smarter. In this context, this research aims to use spatiotemporal data that taxi vehicles adequately provide, to develop an intelligent system able to predict traffic conditions and provide navigation based on these predictions. GPS (Global Positioning System) data from taxi are analysed for the case of Thessaloniki city. Trough data mining and map-matching process, the most appropriate data are selected for travel time calculations and predictions. Several algorithms are investigated to find the optimum for traffic states prediction for the specific case study concluding that ANN (Artificial Neural Networks) outperforms. Then, a new road network map is created by producing spatiotemporal models for every road segment under investigation through a linear regression implementation. Moreover, the possibility to predict vehicle emissions from travel times is investigated. Finally, an application with a graphical user interface is developed, that navigates the users with the criteria of the shortest path in terms of trip length, travel time shortest path and “eco” path. The outcome of this research is an essential tool for drivers to avoid congestion spots saving time and fuel, for stakeholders to reveal the problematic of the road network that needs amendments and for emergency vehicles to arrive at the emergency spot faster. Besides that, according to an indicator-based qualitative assessment of the proposed navigation system, it is concluded that it contributes significantly to environmental protection and economy enhancing sustainable urban mobility.

An Efficient Constrained Shortest Path Algorithm for Traffic Navigation

2011 ◽  
Vol 356-360 ◽  
pp. 2880-2885
Author(s):  
Zong Hui Wang ◽  
Shu Su Shi ◽  
Li Cheng Yu ◽  
Wen Zhi Chen
Keyword(s):  
Shortest Path ◽  
Navigation System ◽  
Road Network ◽  
Prototype System ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
A Algorithm ◽  
The Road ◽  
Low Efficiency ◽  
Key Techniques

FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of the key techniques of a traffic navigation system. Since classical Dijkstra algorithm and heuristic A* algorithm cannot support some constrained conditions in practice, and existing algorithms supporting constraints require the road network to be modified ahead and have low efficiency. The paper studies the model of road network, and analyzes two types of constraints, one-way street and intersection turning prohibitions, then proposes the constrained A* algorithm and gives the Heuristic function. Finally, the paper tests and analyzes the algorithm, and evaluation performance of the prototype system which employs it. The result shows that the algorithm’s efficiency is fairly good.

Sign in / Sign up

Export Citation Format

Share Document