Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “road network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Image feature based GPS trace filtering for road network generation and road segmentation

We propose a new method to infer road networks from GPS trace data and accurately segment road regions in high-resolution aerial images. Unlike previous efforts that rely on GPS traces alone, we exploit image features to infer road networks from noisy trace data. The inferred road network is used to guide road segmentation. We show that the number of image segments spanned by the traces and the trace orientation validated with image features are important attributes for identifying GPS traces on road regions. Based on filtered traces , we construct road networks and integrate them with image features to segment road regions. Lastly, our experiments show that the proposed method produces more accurate road networks than the leading method that uses GPS traces alone, and also achieves high accuracy in segmenting road regions even with very noisy GPS data.

58 GEOSCIENCES↗

GIS Data Based Automatic High-Fidelity 3D Road Network Modeling

3D road models are widely used in many computer applications such as racing games and driving simulations_ However, almost all high-fidelity 3D road models were generated manually by professional artists at the expense of intensive labor. There are very few existing methods for automatically generating 3D high-fidelity road networks, especially those existing in the real world. This paper presents a novel approach thai can automatically produce 3D high-fidelity road network models from real 2D road GIS data that mainly contain road. centerline in formation. The proposed method first builds parametric representations of the road centerlines through segmentation and fitting . A basic set of civil engineering rules (e.g., cross slope, superelevation, grade) for road design are then selected in order to generate realistic road surfaces in compliance with these rules. While the proposed method applies to any types of roads, this paper mainly addresses automatic generation of complex traffic interchanges and intersections which are the most sophisticated elements in the road networks

Wang, Jie↗

Optimizing Traffic Signal Control to Enhance Transportation Efficiency and Maximize Pedestrian Benefits in the Road Network

Increasing urban mobility requirements demand efficient transportation system strategies for both vehicular and pedestrian movement. This study enhances the Decentralized Graph-based Multi-Agent Reinforcement Learning (DGMARL) approach, originally tailored for vehicular traffic signal timing, to incorporate pedestrian traffic dynamics. The improved algorithm considers crucial metrics such as Eco_PI, assesses vehicle fuel consumption by factoring in stops and delays, and addresses pedestrian waiting time, crucial for system efficiency while acknowledging driver waiting time impact. Utilizing Digital Twin simulation along the MLK Smart Corridor in Chattanooga, Tennessee, the algorithm's performance is compared for various pedestrian control scenarios. To evaluate the effectiveness of DGMARL, this study compared DGMARL-enabled signal management with automated pedestrian traffic detection and an actuated signal management system (real-word baseline) with pedestrian recall, which predetermingly enforces a pedestrian phase every cycle. Findings indicate substantial improvements with DGMARL, showing a 28.29% enhancement in vehicle Eco_PI, a 60.55 % reduction in pedestrian waiting time, and a 55.74% decrease in driver stop delay, on average, compared to the baseline actuated signal timing plan.

Kumarasamy, Vijayalakshmi K [The University of Ten↗

Development of Automated Pipeline for Time-Resolved Link-Wise Vehicular Energy Consumption in the Chattanooga, TN Road Network

The Department of Energy (DOE) has shown strong interest in detecting energy inefficiencies in regional road networks, so as to derive energy consumed at a high spatial temporal resolution. We have developed a workflow to automate the estimation of time-resolved vehicular energy consumption over each link in a road network of interest. The road network used in the current work is centered around the city of Chattanooga, Tennessee and its bordering regions. Utilizing the most mature road network for the Chattanooga, TN region, vehicle speed & count data from TomTom in conjunction with machine learning methods, we have developed an automated pipeline to estimate energy consumption for every link in the network. The first step in the pipeline is ingesting vehicle probe counts and speed estimates from TomTom API. In the next step, the probe counts, speed profiles and other exogenous data (i.e. road types, weather data, ground-truth volume counts and more) were used as input to a supervised learning algorithm to estimate the number of vehicles throughout the entire region for each road segment. These volume estimates were then mapped to a unified road network that contained additional important information such as percentage change in gradient across a link, number of lanes and link lengths that are features in pre-trained single vehicle energy-consumption models available with the RouteE software developed at NREL. The per vehicle energy consumption on each road link predicted using appropriate RouteE vehicular models were multiplied by the volume estimate for the corresponding link over a given time period to predict energy consumed per link for the time interval of interest. Currently, work is underway to improve both the RouteE per vehicle energy estimate and the volume estimates derived from TomTom probe counts. We have also explored the correlation of the link-wise energy estimates with the features of the pre-trained RouteE machine learning model in order to gain insight into what factors contribute most to the link-wise energy consumption.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION,↗

Automatic Lane-Level Road Network Extraction from Aerial Imagery for Transportation Digital Twins

Accurate road networks are essential for credible traffic microsimulation and transportation digital twins, yet high-definition maps are often difficult to obtain due to limited availability, high cost, or proprietary restrictions. Some build networks from crowdsourced data, such as OpenStreetMap, but these sources often contain geometric and semantic inconsistencies. Others create networks manually, a process that is labor-intensive and difficult to scale. To address these limitations, this work presents an end-to-end pipeline that automatically extracts georeferenced, lane-level road networks from publicly available high-resolution satellite imagery and converts them into simulation-ready assets. The developed end-to-end pipeline has three primary modules: (1) A computer-vision-based module first detects directed lane geometries and intersection layouts. (2) A heuristic-based topology construction module then identifies approach and exit legs and establishes conflict-free lane-to-lane connections. (3) Finally, an automatic simulation-building module converts the extracted network into standard formats, e.g., OpenDRIVE, and generates routable SUMO networks. The framework supports both complete network construction from scratch and local-scale refinement of existing networks through lane-count correction, transition recovery, and geometric regularization. The proposed pipeline provides a practical pathway to generate traffic simulation networks from satellite imagery, significantly reducing manual reconstruction effort and enabling scalable, continuously updated transportation digital twins.

Guo, Hetian [University of Georgia, Athens] (ORCID↗

A two-level Markov random field for road network extraction and its application with optical, SAR, and multitemporal data

This article introduces a method for road network extraction from satellite images. The proposed approach covers a new fusion method (using data from multiple sources) and a new Markov random field (MRF) defined on connected components along with a multilevel application (two-level MRF). Our method allows the detection of roads with different characteristics and decreases by around 30% the size of the used graph model. Results for synthetic aperture radar (SAR) images and optical images obtained using the TerraSAR-X and Quickbird sensors, respectively, are presented demonstrating the improvement brought by the proposed approach. In a second part, an analysis of different types of data fusion combining optical/radar images, radar/radar images, and multitemporal SAR (TerraSAR-X and COSMO-SkyMed) images is described. Overall, the qualitative and quantitative results show that the fusion approach improves considerably the results of the road network extraction.

47 OTHER INSTRUMENTATION↗

Biomass transport cost from field to conversion facility when biomass yield density and road network vary with transport radius

Biomass transport cost from field to a conversion facility is a major component of biofuel production cost. Several studies have provided a general framework, independent of location, for maximising cost competitiveness of bioenergy plants. The majority of these studies assume uniform spatial distribution of biomass and road network, independent of the size of the biorefinery. Although this assumption simplifies the theoretical derivation, it may not be suitable for practical cases. Here, we develop a more generic biomass transport model that allows biomass yield density and road network vary with transport radius, and then derive a formula for determining biomass transport cost, which more accurately represents changes in biomass transport cost with conversion plant capacity. The formula can be used to evaluate locations and investment opportunities in large scale biofuel production.

Biomass availability↗

Data-Driven Optimal Control of Traffic Signals for Urban Road Networks

This paper studies the issue of data-driven optimal control design for traffic signals of oversaturated urban road networks. The signal control system based on the store and forward model is generally uncontrollable for which the controllable decomposition is needed. Instead of identifying the unknown parameters like saturation rates and turning ratios, a finite number of measured trajectories can be used to parametrize the system and help directly construct a transformation matrix for Kalman controllable decomposition through the fundamental lemma of J. C. Willems. On top of that, an infinite-horizon linear quadratic regulator (LQR) problem is formulated considering the constraints of green times for traffic signals. The problem can be solved through a two-phase data-driven learning process, where one solves an infinite-horizon unconstrained LQR problem and the other solves a finite-horizon constrained LQR problem. The simulation result shows the theoretical analysis is effective and the proposed data-driven controller can yield desired performance for reducing traffic congestion.

Liu, Tong↗

Emissions minimization on road networks via Generic Second Order Models

In this paper we consider the problem of estimating emissions due to vehicular traffic on complex networks, and minimizing their effect by regulating traffic at junctions. For the traffic evolution, we consider a Generic Second Order Model, which encompasses the majority of two-equations (i.e., second-order) models available in the literature, and extend it to road networks with merge and diverge junctions. The dynamics on the whole network is determined by selecting a solution to the Riemann Problems at junctions, i.e., the Cauchy problems with constant initial data on each incident road. The latter are solved by assuming the maximization of the flow and assigning a traffic distribution coefficient for outgoing roads of diverges, and a priority rule for incoming roads of merges. A general emission model is considered and its parameters are tuned to the $ {\mathrm{NO_{x}}} $ emission rate. The minimization of emissions is then formulated in terms of the traffic distribution and priority parameters, taking into account travel times. A comparison is provided between roundabouts with optimized parameters and traffic lights, which correspond to time-varying traffic priorities. Our approach can be adapted to manage traffic in complex networks in order to reduce emissions while keeping travel time at acceptable levels.

33 ADVANCED PROPULSION SYSTEMS↗

Three-Dimensional Road Network by Fusion of Polarimetric and Interferometric SAR Data

In this paper a fuzzy classification procedure is applied to polarimetric radar measurements, and street pixels are detected. These data are successively grouped into consistent roads by means of a dynamic programming approach based on the fuzzy membership function values. Further fusion of the 2D road network extracted and 3D TOPSAR measurements provides a powerful way to analyze urban infrastructures.

Gamba, P.↗

A spatial DB model to simulate the road network efficiency in hydrogeological emergency

We deal with the theme of the simulation of risk analysis using a technological approach based on the integration of exclusively free and open source tools: PostgreSQL as Database Management System (DBMS) and Quantum GIS-GRASS as Geographic Information System (GIS) platform. The case study is represented by a seismic land in Sicily characterized by steep slopes and frequent instability phenomena. This area includes a city of about 30.000 inhabitants (Enna) that lies on the top of a mountain at about 990 m a.s.l.. The access to the city is assured by few and very winding roads that are also highly vulnerable to seismic and hydrogeological hazards. When exceptional rainfall events occur, the loss of efficiency of these roads should compromise timeliness and effectiveness of rescue operations. The data of the sample area have been structured into the adopted DBMS, and the connection to the GIS functionalities allows simulating the exceptional events. We analyzed the hazard, vulnerability and exposure related to these events and calculated the final risk defining three classes for each scenario: low (L), medium (M) and high (H). This study can be a valuable tool to prioritize risk levels and set priorities for intervention to the main road networks.

54 ENVIRONMENTAL SCIENCES↗

Truck platooning in the U.S. national road network: A system-level modeling approach

Truck platooning enables a group of trucks to move close together, which helps reduce truck fuel use and increase effective road capacity. In this paper, a system-level equilibrium model is developed to characterize spontaneous truck platooning with coexistence of non-platooning vehicles in a network, by explicitly accounting for the interlocking relationship among platoon formation time, truck fuel saving, and increase in effective road capacity. To equilibrate the relationships, an algorithm is proposed which involves a diagonalization approach and a bush based algorithm to solve decomposed subproblems. The condition of proportionality is imposed to obtain unique traffic flows for each class of vehicles on road links. In addition, a spatially constrained multivariate clustering technique is employed to construct origin/destination zones that are smaller than the coarse Freight Analysis Framework (FAF) zones, while maintaining reasonable computational burden for network traffic assignment. Model implementation in the U.S. shows that platooning could lead to 7.9% fuel saving among platoonable trucks in 2025 and a comparable increase in effective capacity of platoonable road links, which would account for 60% of rural interstate roads. The fuel saving and road capacity improvement translate into an annual cost reduction of $\$$868 million for the U.S. intercity trucking sector and reduced road infrastructure investment needs worth $\$$4.8 billion. Extensive sensitivity analysis further reveals that fuel saving of platoonable trucks increases with platoon size but decreases with inter-truck distance in a platoon. Fuel saving potential suggests that priority should be given to rural rather than urban roads in deploying platooning technologies. As we expected, greater market penetration of platooning technologies means higher fuel saving and greater increase in effective road capacity.

33 ADVANCED PROPULSION SYSTEMS↗

Guaranteed Road Network Search with Small Unmanned Aircraft

The use of teams of small unmanned aircraft in real-world rapid-response missions is fast becoming a reality. One such application is search and detection of an evader in urban areas. This paper draws on results in graph-based pursuit-evasion, developing mappings from these abstractions to primitive motions that may be performed by aircraft, to produce search strategies providing guaranteed capture of road-bound targets. The first such strategy is applicable to evaders of arbitrary speed and agility, offering a conservative solution that is insensitive to motion constraints pursuers may possess. This is built upon to generate two strategies for capture of targets having a known speed bound that require searcher teams of much smaller size. The efficacy of these algorithms is demonstrated by evaluation in extensive simulation using realistic vehicle models across a spectrum of environment classes.

unmanned aircraft systems↗

Road Network State Estimation Using Random Forest Ensemble Learning

Network-scale travel time prediction not only enables traffic management centers (TMC) to proactively implement traffic management strategies, but also allows travelers make informed decisions about route choices between various origins and destinations. In this paper, a random forest estimator was proposed to predict travel time in a network. The estimator was trained using two years of historical travel time data for a case study network in St. Louis, Missouri. Both temporal and spatial effects were considered in the modeling process. The random forest models predicted travel times accurately during both congested and uncongested traffic conditions. The computational times for the models were low, thus useful for real-time traffic management and traveler information applications.

30 DIRECT ENERGY CONVERSION↗

Efficient Extraction of High Centrality Vertices in Distributed Graphs

Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.

97 MATHEMATICS AND COMPUTING↗

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) and the criticality index is found to be effective for one test network to identify the vulnerable nodes.

99 GENERAL AND MISCELLANEOUS↗

Visualization of Traffic Accidents

Traffic accidents have tremendous impact on society. Annually approximately 6.4 million vehicle accidents are reported by police in the US and nearly half of them result in catastrophic injuries. Visualizations of traffic accidents using geographic information systems (GIS) greatly facilitate handling and analysis of traffic accidents in many aspects. Environmental Systems Research Institute (ESRI), Inc. is the world leader in GIS research and development. ArcGIS, a software package developed by ESRI, has the capabilities to display events associated with a road network, such as accident locations, and pavement quality. But when event locations related to a road network are processed, the existing algorithm used by ArcGIS does not utilize all the information related to the routes of the road network and produces erroneous visualization results of event locations. This software bug causes serious problems for applications in which accurate location information is critical for emergency responses, such as traffic accidents. This paper aims to address this problem and proposes an improved method that utilizes all relevant information of traffic accidents, namely, route number, direction, and mile post, and extracts correct event locations for accurate traffic accident visualization and analysis. The proposed method generates a new shape file for traffic accidents and displays them on top of the existing road network in ArcGIS. Visualization of traffic accidents along Hampton Roads Bridge Tunnel is included to demonstrate the effectiveness of the proposed method.

Wang, Jie↗