scholarly journals Exploring the Spatial Distribution Characteristics and Correlation Factors of Wayfinding Performance on City-Scale Road Networks Based on Massive Trajectory Data

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Jun Li ◽  
Yan Zhu ◽  
Zhenwei Li ◽  
Wenle Lu ◽  
Yang Ji ◽  
...  
Keyword(s):  
Spatial Distribution ◽  
Road Network ◽  
Evaluation Method ◽  
Road Networks ◽  
Small Samples ◽  
Trajectory Data ◽  
Index Set ◽  
Taxi Drivers ◽  
Path Distance ◽  
Correlation Factors

Understanding how urban residents process road network information and conduct wayfinding is important for both individual travel and intelligent transportation. However, most existing research is limited to the heterogeneity of individuals’ expression and perception abilities, and the results based on small samples are weakly representative. This paper proposes a quantitative and population-based evaluation method of wayfinding performance on city-scale road networks based on massive trajectory data. It can accurately compute and visualize the magnitude and spatial distribution differences of drivers’ wayfinding performance levels, which is not achieved by conventional methods based on small samples. In addition, a systematic index set of road network features are constructed for correlation analysis. This is an improvement on the current research, which focuses on the influence of single factors. Finally, taking 20,000 taxi drivers in Beijing as a case study, experimental results show the following: (1) Taxi drivers’ wayfinding performances show a spatial pattern of a high level on arterial road networks and a low level on secondary networks, and they are spatially autocorrelated. (2) The correlation factors of taxi drivers’ wayfinding performances mainly include anchor point, road grade, road importance, road complexity, origin-destination length, and complexity, and each factor has a different influence. (3) The path complexity has a higher correlation with the wayfinding performance level than with the path distance. (4) There is a critical point in the taxi drivers’ wayfinding performances in terms of path distance. When the critical value is exceeded, it is difficult for a driver to find a good route based on personal cognition. This research can provide theoretical and technical support for intelligent driving and wayfinding research.

Forest path condition monitoring based on crowd-based trajectory data analysis

2020 ◽  
pp. 1-18
Author(s):  
Francisco Arcas-Tunez ◽  
Fernando Terroso-Saenz
Keyword(s):  
Information Acquisition ◽  
Road Network ◽  
Road Networks ◽  
Trajectory Data ◽  
Country Road ◽  
Wide Range ◽  
Sport Activities ◽  
Path Condition ◽  
Spatio Temporal ◽  
The City

The development of Road Information Acquisition Systems (RIASs) based on the Mobile Crowdsensing (MCS) paradigm has been widely studied for the last years. In that sense, most of the existing MCS-based RIASs focus on urban road networks and assume a car-based scenario. However, there exist a scarcity of approaches that pay attention to rural and country road networks. In that sense, forest paths are used for a wide range of recreational and sport activities by many different people and they can be also affected by different problems or obstacles blocking them. As a result, this work introduces SAMARITAN, a framework for rural-road network monitoring based on MCS. SAMARITAN analyzes the spatio-temporal trajectories from cyclists extracted from the fitness application Strava so as to uncover potential obstacles in a target road network. The framework has been evaluated in a real-world network of forest paths in the city of Cieza (Spain) showing quite promising results.

scholarly journals RealTE: Real-time Trajectory Estimation Over Large-Scale Road Networks

2022 ◽  
Author(s):  
Qibin Zhou ◽  
Qingang Su ◽  
Dingyu Yang
Keyword(s):  
Travel Time ◽  
Real Time ◽  
High Speed ◽  
Road Network ◽  
Large Scale ◽  
Road Networks ◽  
Trajectory Data ◽  
Real Time Traffic ◽  
Histogram Estimation ◽  
Traffic Estimation

Real-time traffic estimation focuses on predicting the travel time of one travel path, which is capable of helping drivers selecting an appropriate or favor path. Statistical analysis or neural network approaches have been explored to predict the travel time on a massive volume of traffic data. These methods need to be updated when the traffic varies frequently, which incurs tremendous overhead. We build a system RealTER⁢e⁢a⁢l⁢T⁢E, implemented on a popular and open source streaming system StormS⁢t⁢o⁢r⁢m to quickly deal with high speed trajectory data. In RealTER⁢e⁢a⁢l⁢T⁢E, we propose a locality-sensitive partition and deployment algorithm for a large road network. A histogram estimation approach is adopted to predict the traffic. This approach is general and able to be incremental updated in parallel. Extensive experiments are conducted on six real road networks and the results illustrate RealTE achieves higher throughput and lower prediction error than existing methods. The runtime of a traffic estimation is less than 11 seconds over a large road network and it takes only 619619 microseconds for model updates.

scholarly journals α-Probabilistic flexible aggregate nearest neighbor search in road networks using landmark multidimensional scaling

2020 ◽  
Author(s):  
Moonyoung Chung ◽  
Woong-Kee Loh
Keyword(s):  
Multidimensional Scaling ◽  
Shortest Path ◽  
Road Network ◽  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Search Algorithm ◽  
Road Networks ◽  
Path Distance ◽  
Aggregate Nearest Neighbor ◽  
Shortest Path Distance

AbstractIn spatial database and road network applications, the search for the nearest neighbor (NN) from a given query object q is the most fundamental and important problem. Aggregate nearest neighbor (ANN) search is an extension of the NN search with a set of query objects $$Q = \{ q_0, \dots , q_{M-1} \}$$ Q = { q 0 , ⋯ , q M - 1 } and finds the object $$p^*$$ p ∗ that minimizes $$g \{ d(p^*, q_i), q_i \in Q \}$$ g { d ( p ∗ , q i ) , q i ∈ Q } , where g (max or sum) is an aggregate function and d() is a distance function between two objects. Flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search with the introduction of a flexibility factor $$\phi \, (0 < \phi \le 1)$$ ϕ ( 0 < ϕ ≤ 1 ) and finds the object $$p^*$$ p ∗ and the set of query objects $$Q^*_\phi $$ Q ϕ ∗ that minimize $$g \{ d(p^*, q_i), q_i \in Q^*_\phi \}$$ g { d ( p ∗ , q i ) , q i ∈ Q ϕ ∗ } , where $$Q^*_\phi $$ Q ϕ ∗ can be any subset of Q of size $$\phi |Q|$$ ϕ | Q | . This study proposes an efficient $$\alpha $$ α -probabilistic FANN search algorithm in road networks. The state-of-the-art FANN search algorithm in road networks, which is known as IER-$$k\hbox {NN}$$ k NN , used the Euclidean distance based on the two-dimensional coordinates of objects when choosing an R-tree node that most potentially contains $$p^*$$ p ∗ . However, since the Euclidean distance is significantly different from the actual shortest-path distance between objects, IER-$$k\hbox {NN}$$ k NN looks up many unnecessary nodes, thereby incurring many calculations of ‘expensive’ shortest-path distances and eventually performance degradation. The proposed algorithm transforms road network objects into k-dimensional Euclidean space objects while preserving the distances between them as much as possible using landmark multidimensional scaling (LMDS). Since the Euclidean distance after LMDS transformation is very close to the shortest-path distance, the lookup of unnecessary R-tree nodes and the calculation of expensive shortest-path distances are reduced significantly, thereby greatly improving the search performance. As a result of performance comparison experiments conducted for various real road networks and parameters, the proposed algorithm always achieved higher performance than IER-$$k\hbox {NN}$$ k NN ; the performance (execution time) of the proposed algorithm was improved by up to 10.87 times without loss of accuracy.

scholarly journals Generating Road Networks for Old Downtown Areas Based on Crowd-Sourced Vehicle Trajectories

Sensors ◽  
2021 ◽  
Vol 21 (1) ◽  
pp. 235
Author(s):  
Caili Zhang ◽  
Yali Li ◽  
Longgang Xiang ◽  
Fengwei Jiao ◽  
Chenhao Wu ◽  
...  
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Road Networks ◽  
Low Frequency ◽  
Trajectory Data ◽  
Vehicle Trajectories ◽  
Intersection Detection ◽  
Density Peaks ◽  
Road Network Extraction ◽  
Representative Points

With the popularity of portable positioning devices, crowd-sourced trajectory data have attracted widespread attention, and led to many research breakthroughs in the field of road network extraction. However, it is still a challenging task to detect the road networks of old downtown areas with complex network layouts from high noise, low frequency, and uneven distribution trajectories. Therefore, this paper focuses on the old downtown area and provides a novel intersection-first approach to generate road networks based on low quality, crowd-sourced vehicle trajectories. For intersection detection, virtual representative points with distance constraints are detected, and the clustering by fast search and find of density peaks (CFDP) algorithm is introduced to overcome low frequency features of trajectories, and improve the positioning accuracy of intersections. For link extraction, an identification strategy based on the Delaunay triangulation network is developed to quickly filter out false links between large-scale intersections. In order to alleviate the curse of sparse and uneven data distribution, an adaptive link-fitting scheme, considering feature differences, is further designed to derive link centerlines. The experiment results show that the method proposed in this paper preforms remarkably better in both intersection detection and road network generation for old downtown areas.

scholarly journals An Intersection-First Approach for Road Network Generation from Crowd-Sourced Vehicle Trajectories

2019 ◽  
Vol 8 (11) ◽  
pp. 473 ◽  
Author(s):  
Caili Zhang ◽  
Longgang Xiang ◽  
Siyu Li ◽  
Dehao Wang
Keyword(s):  
Road Network ◽  
Rapid Development ◽  
Road Networks ◽  
Uneven Distribution ◽  
Trajectory Data ◽  
Network Generation ◽  
The Road ◽  
Lower Accuracy ◽  
Road Intersections ◽  
Vehicle Trajectory

Extracting highly detailed and accurate road network information from crowd-sourced vehicle trajectory data, which has the advantages of being low cost and able to update fast, is a hot topic. With the rapid development of wireless transmission technology, spatial positioning technology, and the improvement of software and hardware computing ability, more and more researchers are focusing on the analysis of Global Positioning System (GPS) trajectories and the extraction of road information. Road intersections are an important component of roads, as they play a significant role in navigation and urban planning. Even though there have been many studies on this subject, it remains challenging to determine road intersections, especially for crowd-sourced vehicle trajectory data with lower accuracy, lower sampling frequency, and uneven distribution. Therefore, we provided a new intersection-first approach for road network generation based on low-frequency taxi trajectories. Firstly, road intersections from vector space and raster space were extracted respectively via using different methods; then, we presented an integrated identification strategy to fuse the intersection extraction results from different schemes to overcome the sparseness of vehicle trajectory sampling and its uneven distribution; finally, we adjusted road information, repaired fractured segments, and extracted the single/double direction information and the turning relationships of the road network based on the intersection results, to guarantee precise geometry and correct topology for the road networks. Compared with other methods, this method shows better results, both in terms of their visual inspections and quantitative comparisons. This approach can solve the problems mentioned above and ensure the integrity and accuracy of road intersections and road networks. Therefore, the proposed method provides a promising solution for enriching and updating navigable road networks and can be applied in intelligent transportation systems.

scholarly journals Large-scale simulation of traffic flow using Markov model

PLoS ONE ◽  
2021 ◽  
Vol 16 (2) ◽  
pp. e0246062
Author(s):  
Renátó Besenczi ◽  
Norbert Bátfai ◽  
Péter Jeszenszky ◽  
Roland Major ◽  
Fanny Monori ◽  
...  
Keyword(s):  
Stationary Distribution ◽  
Road Network ◽  
Large Scale ◽  
Transition Probability ◽  
Weighted Least Squares ◽  
Estimation Method ◽  
Road Networks ◽  
Likelihood Method ◽  
Trajectory Data ◽  
On The Road

Modeling and simulating movement of vehicles in established transportation infrastructures, especially in large urban road networks is an important task. It helps in understanding and handling traffic problems, optimizing traffic regulations and adapting the traffic management in real time for unexpected disaster events. A mathematically rigorous stochastic model that can be used for traffic analysis was proposed earlier by other researchers which is based on an interplay between graph and Markov chain theories. This model provides a transition probability matrix which describes the traffic’s dynamic with its unique stationary distribution of the vehicles on the road network. In this paper, a new parametrization is presented for this model by introducing the concept of two-dimensional stationary distribution which can handle the traffic’s dynamic together with the vehicles’ distribution. In addition, the weighted least squares estimation method is applied for estimating this new parameter matrix using trajectory data. In a case study, we apply our method on the Taxi Trajectory Prediction dataset and road network data from the OpenStreetMap project, both available publicly. To test our approach, we have implemented the proposed model in software. We have run simulations in medium and large scales and both the model and estimation procedure, based on artificial and real datasets, have been proved satisfactory and superior to the frequency based maximum likelihood method. In a real application, we have unfolded a stationary distribution on the map graph of Porto, based on the dataset. The approach described here combines techniques which, when used together to analyze traffic on large road networks, has not previously been reported.

scholarly journals Comprehensive Evaluation of Urban Road Network Resilience Facing Earthquakes

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Lin Gao ◽  
Mingzhen Wang ◽  
Anshuang Liu ◽  
Huafeng Gong
Keyword(s):  
Road Network ◽  
Evaluation Method ◽  
Comprehensive Evaluation ◽  
Road Networks ◽  
Urban Road Network ◽  
Urban Road ◽  
The Road ◽  
Whole Process ◽  
Node Importance ◽  
Research Goal

The road network’s transport capacity and traffic function will be directly reduced if urban roads are damaged by earthquakes. To effectively improve the resistance and recovery ability of urban road networks facing earthquake disasters, the establishment of an aseismic resilience evaluation method for the urban road network is the research goal. This paper’s novelty introduces the concept of engineering resilience into the aseismic performance evaluation of urban road networks. It reveals the internal influence principle of nodes and independent pathways on the aseismic resilience of the network. This paper’s significant contribution is to establish a reasonable and comprehensive urban road network aseismic resilience evaluation method. This method can realize the calculation of the aseismic resilience for the existing network, reconstruction network, and new network and propose the optimization, transformation, and layout for the network. The MATLAB program for the whole process calculation of aseismic resilience is developed. The overall network’s aseismic resilience is obtained by the sum of the product of the node importance and the average number of the reliable independent pathways.

scholarly journals Modeling of Emergency Supply Scheduling Problem Based on Reliability and Its Solution Algorithm under Variable Road Network after Sudden-Onset Disasters

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15 ◽  
Author(s):  
Tinggui Chen ◽  
Shiwen Wu ◽  
Jianjun Yang ◽  
Guodong Cong ◽  
Gongfa Li
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Sudden Onset ◽  
The Road ◽  
Bee Colony ◽  
Proposed Model ◽  
Effectiveness And Efficiency ◽  
In Transit ◽  
Emergency Supply

It is common that many roads in disaster areas are damaged and obstructed after sudden-onset disasters. The phenomenon often comes with escalated traffic deterioration that raises the time and cost of emergency supply scheduling. Fortunately, repairing road network will shorten the time of in-transit distribution. In this paper, according to the characteristics of emergency supplies distribution, an emergency supply scheduling model based on multiple warehouses and stricken locations is constructed to deal with the failure of part of road networks in the early postdisaster phase. The detailed process is as follows. When part of the road networks fail, we firstly determine whether to repair the damaged road networks, and then a model of reliable emergency supply scheduling based on bi-level programming is proposed. Subsequently, an improved artificial bee colony algorithm is presented to solve the problem mentioned above. Finally, through a case study, the effectiveness and efficiency of the proposed model and algorithm are verified.

Patterned Villagescapes and Road Networks in Ancient Southwestern Amazonia

2020 ◽  
pp. 1-15
Author(s):  
Sanna Saunaluoma ◽  
Justin Moat ◽  
Francisco Pugliese ◽  
Eduardo G. Neves
Keyword(s):  
Material Culture ◽  
Unmanned Aerial Vehicle ◽  
Spatial Planning ◽  
Road Network ◽  
Road Networks ◽  
Archaeological Sites ◽  
Remotely Sensed Imagery ◽  
Aerial Vehicle ◽  
Human Transport ◽  
Southwestern Amazonia

Our recent data, collected using remotely sensed imagery and unmanned aerial vehicle surveys, reveal the extremely well-defined patterning of archaeological plaza villages in the Brazilian Acre state in terms of size, layout, chronology, and material culture. The villages comprise various earthen mounds arranged around central plazas and roads that radiate outward from, or converge on, the sites. The roads connected the villages situated 2–10 km from each other in eastern Acre. Our study attests to the existence of large, sedentary, interfluvial populations sharing the same sociocultural identities, as well as structured patterns of movement and spatial planning in relation to operative road networks during the late precolonial period. The plaza villages of Acre show similarity with the well-documented communities organized by road networks in the regions of the Upper Xingu and Llanos de Mojos. Taking into consideration ethnohistorical and ethnographic evidence, as well as the presence of comparable archaeological sites and earthwork features along the southern margin of Amazonia, we suggest that the plaza villages of Acre were linked by an interregional road network to other neighboring territories situated along the southern Amazonian rim and that movement along roads was the primary mode of human transport in Amazonian interfluves.

Sign in / Sign up

Export Citation Format

Share Document