3D Road Network Modeling and Road Structure Recognition in Internet of Vehicles

Internet of Vehicles (IoV) is a new system that enables individual vehicles to connect with nearby vehicles,people, transportation infrastructure, and networks, thereby realizing amore intelligent and efficient transportationsystem. The movement of vehicles and the three-dimensional (3D) nature of the road network cause the topologicalstructure of IoV to have the high space and time complexity.Network modeling and structure recognition for 3Droads can benefit the description of topological changes for IoV. This paper proposes a 3Dgeneral roadmodel basedon discrete points of roads obtained from GIS. First, the constraints imposed by 3D roads on moving vehicles areanalyzed. Then the effects of road curvature radius (Ra), longitudinal slope (Slo), and length (Len) on speed andacceleration are studied. Finally, a general 3D road network model based on road section features is established.This paper also presents intersection and road section recognition methods based on the structural features ofthe 3D road network model and the road features. Real GIS data from a specific region of Beijing is adopted tocreate the simulation scenario, and the simulation results validate the general 3D road network model and therecognitionmethod. Therefore, thiswork makes contributions to the field of intelligent transportation by providinga comprehensive approach tomodeling the 3Droad network and its topological changes in achieving efficient trafficflowand improved road safety.

Autonomous Vehicle Platoons In Urban Road Networks:A Joint Distributed Reinforcement Learning and Model Predictive Control Approach

In this paper, platoons of autonomous vehicles operating in urban road networks are considered. From a methodological point of view, the problem of interest consists of formally characterizing vehicle state trajectory tubes by means of routing decisions complying with traffic congestion criteria. To this end, a novel distributed control architecture is conceived by taking advantage of two methodologies: deep reinforcement learning and model predictive control. On one hand, the routing decisions are obtained by using a distributed reinforcement learning algorithm that exploits available traffic data at each road junction. On the other hand, a bank of model predictive controllers is in charge of computing the more adequate control action for each involved vehicle. Such tasks are here combined into a single framework:the deep reinforcement learning output(action) is translated into a set-point to be tracked by the model predictive controller;conversely, the current vehicle position, resulting from the application of the control move, is exploited by the deep reinforcement learning unit for improving its reliability. The main novelty of the proposed solution lies in its hybrid nature: on one hand it fully exploits deep reinforcement learning capabilities for decisionmaking purposes;on the other hand, time-varying hard constraints are always satisfied during the dynamical platoon evolution imposed by the computed routing decisions. To efficiently evaluate the performance of the proposed control architecture, a co-design procedure, involving the SUMO and MATLAB platforms, is implemented so that complex operating environments can be used, and the information coming from road maps(links,junctions, obstacles, semaphores, etc.) and vehicle state trajectories can be shared and exchanged. Finally by considering as operating scenario a real entire city block and a platoon of eleven vehicles described by double-integrator models, several simulations have been performed with the aim to put in light the main f eatures of the proposed approach. Moreover, it is important to underline that in different operating scenarios the proposed reinforcement learning scheme is capable of significantly reducing traffic congestion phenomena when compared with well-reputed competitors.

Monitoring subsidence rates along road network by persistent scatterer SAR interferometry with high-resolution TerraSAR-X imagery

Ground subsidence is one of the key factors damaging transportation facilities, e.g., road networks consisting of highways and railways. In this paper, we propose to apply the persistent scatterer synthetic aperture radar interferometry （PS-InSAR） approach that uses high- resolution TerraSAR-X （TSX） imagery to extract the regional scale subsidence rates （i.e., average annual sub- sidence in mm/year） along road networks. The primary procedures involve interferometric pair selection, interfer- ogram generation, persistent scatterer （PS） detection, PS networking, phase parameterization, and subsidence rate estimation. The Xiqing District in southwest Tianjin （China） is selected as the study area. This district contains one railway line and several highway lines. A total of 15 TSX images covering this area between April 2009 and June 2010 are utilized to obtain the subsidence rates by using the PS-InSAR （PSI） approach. The subsidence rates derived from PSI range from -68.7 to -1.3 mm/year. These findings show a significantly uneven subsidence pattern along the road network. Comparison between the PSI-derived subsidence rates and the leveling data obtained along the highways shows that the mean and standard deviation （SD） of the discrepancies between the two types of subsidence rates are 0.1 and 4-3.2 mm/year, respectively. The results indicate that the high-resolution TSX PSI is capable of providing comprehensive and detailed subsidence information regarding road networks with millimeter-level accuracy. Further inspections under geo- logical conditions and land-use categories in the study area indicate that the observed subsidence is highly related to aquifer compression due to groundwater pumping. Therefore, measures should be taken to mitigate groundwater extraction for the study area.

Seismic damage to road networks subjected to earthquakes in Nepal,2015

The Gorkha earthquake in Nepal led to many landslides and severe damage to the transportation infrastructure. After careful comparison of the aerial photographs and satellite images before and after the earthquake, partially verified by a field study, more than 2,064 landslides and many road failures were observed. Many bridges, especially steel-truss and suspension bridges, suffered little damage from inertia loads during the earthquake, but were severely damaged due to rockfalls. Potential geological hazards hindered the delivery of supplies in mountainous areas, and road closures impeded the overall speed of rehabilitation.

Effects of aggregating forests, establishing forest road networks, and mechanization on operational efficiency and costs in a mountainous region in Japan

We investigated forest road networks and forestry operations before and after mechanization on aggregated forestry operation sites. We developed equations to estimate densities of road networks with average slope angles, operational efficiency of bunching operations with road network density, and average forwarding distances with operation site areas. Subsequently, we analyzed the effects of aggregating forests, establishing forest road networks, and mechanization on operational efficiency and costs. Six ha proved to be an appropriate operation site area with minimum operation expenses. The operation site areas of the forest owners＇ cooperative in this region aggregated approximately 6 ha and the cooperative conducted forestry operations on aggregated sites. Therefore, 6 ha would be an appropriate operation site area in this region. Regarding road network density, higher-density road networks increased operational expenses due to the higher direct operational expenses of strip road establishment. Therefore, road network density should be reduced to approximately 200 m.

Privacy Protection with Dynamic Pseudonym-Based Multiple Mix-Zones Over Road Networks

In this research we proposed a strategy for location privacy protection which addresses the issues related with existing location privacy protection techniques. Mix-Zones and pseudonyms are considered as the basic building blocks for location privacy; however, continuously changing pseudonyms process at multiple locations can enhance user privacy. It has been revealed that changing pseudonym at improper time and location may threat to user's privacy. Moreover, certain methods related to pseudonym change have been proposed to attain desirable location privacy and most of these solutions are based upon velocity, GPS position and direction of angle. We analyzed existing methods related to location privacy with mix zones, such as RPCLP, EPCS and MODP, where it has been observed that these methods are not adequate to attain desired level of location privacy and suffered from large number of pseudonym changes. By analyzing limitations of existing methods, we proposed Dynamic Pseudonym based multiple mix zone(DPMM) technique, which ensures highest level of accuracy and privacy. We simulate our data by using SUMO application and analysis results has revealed that DPMM outperformed existing pseudonym change techniques and achieved better results in terms of acquiring high privacy with small number of pseudonym change.

Joint Optimization of Latency and Energy Consumption for Mobile Edge Computing Based Proximity Detection in Road Networks

In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.

The Shortest Path Analysis Based on Road Network

Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.

Automatic Matching of Multi-scale Road Networks under the Constraints of Smaller Scale Road Meshes

In this paper,we propose a new method to achieve automatic matching of multi-scale roads under the constraints of smaller scale data.The matching process is:Firstly,meshes are extracted from two different scales road data.Secondly,several basic meshes in the larger scale road network will be merged into a composite one which is matched with one mesh in the smaller scale road network,to complete the N∶1(N>1)and 1∶1 matching.Thirdly,meshes of the two different scale road data with M∶N(M>1,N>1)matching relationships will be matched.Finally,roads will be classified into two categories under the constraints of meshes:mesh boundary roads and mesh internal roads,and then matchings between the two scales meshes will be carried out within their own categories according to the matching relationships.The results show that roads of different scales will be more precisely matched using the proposed method.

Road Distance Computation Using Homomorphic Encryption in Road Networks

Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the most fundamental operations of road networks computation.To alleviate privacy concerns about location privacy leaks during road distance computation,it is desirable to have a secure and efficient road distance computation approach.In this paper,we propose two secure road distance computation approaches,which can compute road distance over encrypted data efficiently.An approximate road distance computation approach is designed by using Partially Homomorphic Encryption and road network set embedding.An exact road distance computation is built by using Somewhat Homomorphic Encryption and road network hypercube embedding.We implement our two road distance computation approaches,and evaluate them on the real cityscale road network.Evaluation results show that our approaches are accurate and efficient.

Emergency road network structure and planning optimization in mountainous regions in Southwest China under earthquake scenarios

Emergency road networks(ERNs),an important part of local disaster prevention systems,can provide security to residents and their property.Exploring the ERNs structure is of great significance in terms of promoting disaster prevention and establishing road safety in dangerous mountainous areas.This study considered the ERNs of the Kangding section of the Dadu River Basin as the area for a case study.Complex Network Analysis was used to examine the relationship between the four characteristic indicators of mountain roads and the degree of earthquake impacts under the Lushan,Wenchuan,and Kangding Earthquake scenarios.Based on the analysis results,the southwest mountain road network was evaluated;then,computer simulations were used to evaluate the structural changes in the road network after index changes.The network was optimized,and the corresponding emergency avoidance network was proposed to provide a reference for the establishment of the mountainous ERN.The results show that the overall completeness of the mountainous ERNs in Southwest China is poor and prone to traffic accidents.Moreover,the local stability is poor,and the network is susceptible to natural hazards.The overall structure of the road network is balanced,but that of certain road sections is not.Road sections with different attributes present a“gathering-scattering”spatial distribution,i.e,some sections are clustered together while others are far apart.Accordingly,a planning optimization strategy is proposed to better understand the complexity and systematic nature of the mountainous ERN as a whole and to provide a reference for disaster prevention and mitigation planning in mountainous regions in Southwest China.

Development of a support system for creating disaster prevention maps focusing on road networks and hazardous elements

As a disaster prevention measure based on self-assistance and mutual assistance,disaster prevention maps are being created with citizen participation throughout Japan.The process of creating disaster prevention maps is itself a disaster prevention measure that contributes to raising awareness of disaster prevention by promoting exchange and cooperation within the region.By focusing on relations between road networks and hazardous elements,we developed a system to support disaster prevention map creation that visualizes roads at high risk during a disaster and facilitates the study of evacuation simulations.This system leads to a completed disaster prevention map in three phases.In the first phase,we use a device with GPS logging functions to collect information related to hazardous elements.In the second phase,we use Google Maps(“online map,”below)to visualize roads with high evacuation risk.In the final phase,we perform a regional evaluation through simulations of disaster-time evacuations.In experimental verifications,by conducting usability tests after creating a disaster prevention map in the target area,we evaluated the system in terms of simple operability and visibility.We found that by implementing this series of processes,even users lacking specialized knowledge regarding disaster prevention can intuitively discover evacuation routes while considering the relations between visualized road networks and hazardous elements.These results show that compared with disaster prevention maps having simple site notations using existing WebGIS systems,disaster prevention maps created by residents while inspecting the target area raise awareness of risks present in the immediate vicinity even in normal times and are an effective support system for prompt disaster prevention measures and evacuation drills.

Optimization of Development Intensity Index of Regulatory Land under the Constraint of Bearing Capacity of Road Network:A Case Study of Xingtang County

In the process of urban development in China,the vast majority of urban construction is faced with the prominent contradiction between scarce land resources and vigorous construction demand.Moreover,high-density and high-intensity development is ubiquitous.However,the overall development amount of a city is restricted by the bearing capacity of road network to some extent,and there is an upper limit.Based on this,Xingtang County of Shijiazhuang City is taken as the research object,and bearing capacity of road network is selected as research emphasis.With the aid of traffi c planning software TransCAD,simulation and quantitative analysis are conducted,and traffi c demand is forecasted,to analyze impact relationship between land-use planning and traffic planning in regulatory planning.It facilitates later modifi cation and optimization of volume rate in the land development intensity index,thus providing rational basis for programme adjustment,preparation and management of regulatory planning in Xingtang County.

Extracting Campus’Road Network from Walking GPS Trajectories

Road network extraction is vital to both vehicle navigation and road planning.Existing approaches focus on mining urban trunk roads from GPS trajectories of floating cars.However,path extraction,which plays an important role in earthquake relief and village tour,is always ignored.Addressing this issue,we propose a novel approach of extracting campus’road network from walking GPS trajectories.It consists of data preprocessing and road centerline generation.The patrolling GPS trajectories,collected at Hunan University of Science and Technology,were used as the experimental data.The experimental evaluation results show that our approach is able to effectively and accurately extract both campus’trunk roads and paths.The coverage rate is 96.21%while the error rate is 3.26%.

Road Network Analysis with GIS and GRASS-GIS:A Probabilistic Approach

In this paper we show how it can be useful to the probability of intersections in the determination of a classification rule for raster conversions in Geographical Information System(GIS)and GRASS GIS for the Road Network Analysis(RNA).We use a geometric probabilities approach for irregular path considering these results for transportation planning operations.We study two particular problems with irregular tessellations,in order to have a situation more realistic respect to map GIS and considering also the maximum value of probability to narrow the range of possible probability values.

Short-Term Traffic Flow Prediction Based on Road Network Topology

Accurate short-term traffic flow prediction plays a crucial role in intelligent transportation system (ITS), because it can assist both traffic authorities and individual travelers make better decisions. Previous researches mostly focus on shallow traffic prediction models, which performances were unsatisfying since short-term traffic flow exhibits the characteristics of high nonlinearity, complexity and chaos. Taking the spatial and temporal correlations into consideration, a new traffic flow prediction method is proposed with the basis on the road network topology and gated recurrent unit (GRU). This method can help researchers without professional traffic knowledge extracting generic traffic flow features effectively and efficiently. Experiments are conducted by using real traffic flow data collected from the Caltrans Performance Measurement System (PEMS) database in San Diego and Oakland from June 15, 2017 to September 27, 2017. The results demonstrate that our method outperforms other traditional approaches in terms of mean absolute percentage error (MAPE), symmetric mean absolute percentage error (SMAPE) and root mean square error (RMSE).

Spatial Accessibility of Road Network in Wuhan Metropolitan Area Based on Spatial Syntax

Based on space syntax theory, the spatial accessibility of the road network in Wuhan Metropolitan Area has been quantitatively analyzed by building a series of accessibility variables. Topologic connectivity in the accessible rings appears to be broken;traffic axis network is in spatial structure of hub-and-spoke and fishbone-like. Meanwhile, the differences in classified road network have led to inefficiency of its network servo and its ever-worsening capability to respond to traffic jams. Besides, two band-like integrated cores of which one is east to west along the Yangtze River and the other is north to south along Beijing to Guangzhou Railway, have become the first level traffic axis in the whole network, which is responsible for the connectivity of the entire metropolitan area network. This consequently has strengthened the dominant position of Wuhan which is located on the bands’ crossing. In short, the spatial accessibility of that classified space morphology, the urban system, the transport infrastructure as well as the social and economic development of Wuhan Metropolitan Area are highly interrelated to each other, especially to the high level highway network featured by freeways, the development level of which is well in line with that of road network accessibility.

Hierarchical Area Partitioning Method of Urban Road Networks Matching

In view of the “Node-Arc” data model of road network in the aspect of structured expressing the deficiencies, the hierarchical area partitioning of road network based on the principle of stroke, which made road network space structure characteristics of the expression with the hierarchical feature was designed. Based on road hierarchy and connected relationship with the area domain boundaries, the road in the area was hierarchically divided. A hierarchical model was established based on “whole-part-object” data model. Finally, the model of urban road network matching is proposed, which used consistency evaluation model selected matching objects from high-grade road to the low-level road. The experiment results indicated that the method was suitable to solve the road matching problem with typical urban features.

A Decision Support System Web—Application for the Management of Forest Road Network

The present study contributes to the development of an online FRMP(Forest Road Management Platform)that aims to assist in the management of forest road network in a holistic way.This is achieved by the proposed methodology which serves as a database using geoprocessing and geospatial technologies for the handling,and the identification of critical issues in the infrastructure of forest road networks,visualization of forest roads,and the optimization of the management of the forest road network by proposing alternative strategies.In this paper,the development of the decision making web-tool,and presented examples to demonstrate effectively its application and resulting advantages are described.The developed web-application may provide assistance to various forest organizations in the management of forest road networks and associated problems in an effective and sustainable way.

Reshaping Tribal Road Network Using Public Information

The area with the fastest growing Native American population in North Dakota is the Fort Berthold Reservation. State and federal road information available to the public is not identical in terms of the number of physical road segments or in the attribute information provided for the road network. In this study we develop: 1) a navigable road network achieved by improving connectivity among road segments, updating road information, and making a comprehensive network;and 2) a standard process for integrating the state and federal local road information. The standard process broadly consists of three Parts: 1) combining road segments from each source;2) providing legitimacy to snapping distance;and 3) performing a snapping based on the result of Part 2 to connect those road segments, which remained unconnected from Part 1. The findings show that data on local roads on the Fort Berthold Reservation from the two different sources are joined through the standard process, and the process saves considerable time and resources required for fixing the road network. The standard process that has been developed here can be applied to a variety of other Indian road information integration projects to join not only physical road segments, but also plural attribute information. The process will also be useful for a variety of other projects integrating road information, which is available to the public, in order to overcome financial and time limitations.