SEARCH · Engineering Papers
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.
Current references were surveyed for the application of remote sensing to traffic and transportation studies. The major problems are presented that concern traffic engineers and transportation managers, and the literature references that discuss remote sensing applications are summarized.
Modern industrial automation systems increasingly depend on network infrastructures for time-critical communication, driving the need for solutions that guarantee timely and reliable data delivery. IEEE 802.1 Time-Sensitive Networking (TSN) holds significant promise for converging Information Technology (IT) and Operational Technology (OT) networks, enabling interoperability and supporting the coexistence of mixed-critical traffic crucial for Industry 4.0 and IIoT. To achieve deterministic communication, TSN employs various traffic shapers such as the Time-Aware Shaper (TAS), Asynchronous Traffic Shaper (ATS), and Credit-Based Shaper (CBS). However, the effective deployment of TSN in industrial automation faces several challenges. These include the non-trivial mapping of diverse industrial traffic types to specific shapers, the complexity of optimizing shaper configurations. We present a model for effective traffic engineering within TSN enabled OT Network. Our experiments also demonstrate how shaping of certain traffic types get affected in absence of precise time synchronization and propose possible solutions based on experiment results. Based on our experimental results we provide recommendations on how traffic type assignments should be done and which traffic shaping mechanisms should be used for a particular traffic type.
The purpose of the project was to explore the performance of entanglement protocols based on microresonator Kerr optical frequency combs. We have addressed these challenges by developing a rigorous frequency-bin approach that allowed us to determine an explicit steady-state density operator for quantum microcombs below threshold. Our novel approach has allowed us to derived an explicit formula for the density operator on the frequency-bin basis, and to propose a complete description of quantum Kerr combs regardless of the number of sidemodes or loss-induced coupling to the environment. This formalism also allows for the explicit determination of their fidelity, purity, and entropy. These results are expected to permit the exploitation of the full potential of entangled microcombs for quantum technology.
Traffic simulation is an effective tool for urban planners, traffic engineers, and researchers to study traffic. In particular, microscopic traffic simulation, which simulates individual vehicles’ movements within a transportation network, has demonstrated its importance in analyzing and managing transportation systems. However, integrating data from various sources, generating traffic scenarios, and importing information into traffic simulators to conduct microscopic simulations have always been a challenge. This paper presents a solution to overcome this challenge: RealTwin, a comprehensive tool for automated scenario generation for microscopic traffic simulation. Following a streamlined scenario generation and calibration workflow, RealTwin effectively bridges gaps between traffic data from various sources and traffic simulators, making microscopic traffic simulation more accessible for researchers and engineers across various levels of expertise. Using RealTwin to generate a real-world traffic scenario in Simulation of Urban Mobility (SUMO), VISSIM, and AIMSUN, RealTwin’s ability is demonstrated in the construction of realistic and consistent traffic scenarios in different simulators. Furthermore, this paper introduces and illustrates RealTwin’s capability for technology (e.g., autonomous vehicle) scenario generation. This feature can contribute to more comprehensive microscopic simulations, facilitating the analysis of potential effects of various technological innovations on mobility, energy efficiency, and safety. Finally, RealTwin is used to calibrate a simulation in SUMO. In conclusion, the calibration module enhances RealTwin’s ability to generate consistent simulations across different platforms and more realistic simulations that reflect real-world traffic operations.
Effective control of traffic signals plays a critical role in ensuring smooth vehicle flow in urban areas. Expertly engineered traffic signal controllers can considerably minimize travel delays and enhance sustainability. In this paper, the team proposes the Model Predictive Control (MPC) traffic signal control strategy using real-time traffic flow data from a vision-based camera as feedback information. Also, a realistic signal timing plan that considers National Electrical Manufacturers Association (NEMA) constraints has been developed to be applied to real-world scenarios. The primary aim is to reduce the number of vehicles across all links in the controlled area, thereby optimizing traffic flow and reducing energy consumption. To validate the proposed method, several real-life experiments were conducted at 24 intersections in Chattanooga, Tennessee, by collaborating with traffic field engineers. These experiments demonstrated significant performance improvements in comparison to the existing method.
Abstract In software‐defined networks (SDN) for 6G technologies, the controller should accurately and efficiently measure the flow traffic in switches for traffic engineering. Fine‐grained flow measurement can more accurately describe the traffic in the network, but it also consumes much more resources. To reduce the overhead incurred in the measurement process and obtain the approximate fine‐grained measurements, we propose a novel lightweight measurement scheme that runs in the controller. The novel lightweight measurement architecture consists of two parts: coarse‐grained measurement and interpolation‐optimization. In the first part, based on the SDN architecture, we use the pull‐based random sampling method to quickly obtain the coarse‐grained measurement of flow traffic through OpenFlow protocol. In the second part, we insert some discrete values into the coarse‐grained measurement with the interpolation theory, then we optimize interpolation results until finding the optimal fine‐grained flow traffic measurement by utilizing the multiconstraint method. We verified the feasibility of the proposed measurement method, and simulation results show that the measurement error of the proposed method is under 25%, but the flow measurement overhead of this method occupies only 3.3% compared with that of the fine‐grained method.
Traffic intersections are crucial and challenging nodes in transportation networks where multiple lanes of vehicles and pedestrians converge. Traffic accidents often occur at traffic intersections, including a large proportion of traffic fatalities and about one-half of all traffic injuries in the United States. Object detection data were collected in 2024 across three intersections in Colorado Springs, CO, USA, over the course of multiple days and various times to induce a heterogeneous mix of traffic conditions and behaviors. The purpose of the data collection exercises was to learn various attributes about infrastructure sensors and to build a repository of high-resolution, object-level data that can be used for research and development (e.g., to develop multisensor data fusion algorithms). The Infrastructure Perception and Control:Multi-Sensor Object tracking (IPC-MSOT) dataset was collected as part of the U.S. Department of Transportation's Strengthening Mobility and Revolutionizing Transportation (SMART) project, where the city of Colorado Springs, Colorado, and the National Renewable Energy Laboratory collaborated to collect object-level trajectory data from road users using multiple types of infrastructure sensors deployed at different intersections. This dataset allows for testing of late-stage sensor fusion algorithms and their ability to ingest multimodal sensor data, and it can be utilized by traffic engineers to design and evaluate trajectory-based signal control strategies.
Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.
The potential uses of remotely sensed data as applied to the transportation planning process are presented. By utilizing the remote sensing technology developed by the National Aeronautics and Space Administration in the various space programs, it is hoped that both the expense and errors inherent in the conventional data collection techniques can be avoided. Additional bonuses derived from the use of remotely sensed data are those of the permanent record nature of the data and the traffic engineering data simultaneously made available. The major mathematical modeling phases and the role remotely sensed data might play in replacing conventionally collected data are discussed. Typical surveys undertaken in the overall planning process determine the nature and extent of travel desires, land uses, transportation facilities and socio-economic characteristics. Except for the socio-economic data, data collected in the other surveys mentioned can be taken from photographs in sufficient detail to be useful in the modeling procedures.
Under this SBIR Phase II, Reservoir Labs has developed G2 Analytics, a new technology that allows network operators to analyze bottleneck and flow performance with high precision. G2 delivers a new analytical approach and framework to resolve a variety of key problems found in modern communication networks, including: traffic engineering, routing, flow scheduling, network design, capacity planning, resiliency analysis, network slicing, or service level agreement (SLA) management, among others. G2 leverages the bottleneck structure of congestion-controlled communication networks, a recent mathematical discovery by the Reservoir team [RL19b, RL20a, RL20b, RL21a]. Bottleneck structures reveal how perturbations on flows and links propagate through the network, providing an analytical framework to measure (qualitatively and quantitatively) the ripple effects induced as they traverse the network. Leveraging the mathematics of bottleneck structures, Reservoir Labs is developing the G2 technology to provide network operators with a framework to design, optimize and troubleshoot network performance. This delivery includes the G2 software stack.
Techniques based on the Theory of Bottleneck Ordering can reveal the bottleneck structure of a network, and the Theory of Flow ordering can take advantage of the revealed bottleneck structure to manage and configure network flows so as to improve the overall network performance. These two techniques provide insights into the inherent topological properties of a network at least in three areas: (1) identification of the regions of influence of each bottleneck; (2) the order in which bottlenecks (and flows traversing them) may converge to their steady state transmission rates in distributed congestion control algorithms; and (3) the design of optimized traffic engineering policies.
NASA is working to develop an integrated set of advanced technologies to enable efficient arrival operations in high-density terminal airspace for the Next Generation Air Transportation System. This integrated arrival solution is being validated and verified in laboratories and transitioned to a field prototype for an operational demonstration at a major U.S. airport. Within NASA, this is a collaborative effort between Ames and Langley Research Centers involving a multi-year iterative experimentation process. Designing and analyzing a series of sequential batch computer simulations and human-in-the-loop experiments across multiple facilities and simulation environments involves a number of statistical challenges. Experiments conducted in separate laboratories typically have different limitations and constraints, and can take different approaches with respect to the fundamental principles of statistical design of experiments. This often makes it difficult to compare results from multiple experiments and incorporate findings into the next experiment in the series. A statistical engineering approach is being employed within this project to support risk-informed decision making and maximize the knowledge gained within the available resources. This presentation describes a statistical engineering case study from NASA, highlights statistical challenges, and discusses areas where existing statistical methodology is adapted and extended.
NASA's Traffic Aware Planner (TAP) is a cockpit decision support tool that provides aircrew with vertical and lateral flight-path optimizations with the intent of achieving significant fuel and time savings, while automatically avoiding traffic, weather, and restricted airspace conflicts. A key step towards the maturation and deployment of TAP concerned its operational evaluation in a representative flight environment. This Systems Engineering Management Plan (SEMP) addresses the test-vehicle design, systems integration, and flight-test planning for the first TAP operational flight evaluations, which were successfully completed in November 2013. The trial outcomes are documented in the Traffic Aware Planner (TAP) flight evaluation paper presented at the 14th AIAA Aviation Technology, Integration, and Operations Conference, Atlanta, GA. (AIAA-2014-2166, Maris, J. M., Haynes, M. A., Wing, D. J., Burke, K. A., Henderson, J., & Woods, S. E., 2014).
Traffic intersections are crucial and challenging nodes in transportation networks where multiple lanes of vehicles and pedestrians converge. About one-quarter of traffic fatalities and about one-half of all traffic injuries in the United States happen at traffic intersections . Effective management of these intersections is important to ensure safety and efficiency of all users - vehicles, pedestrians, cyclists, and vulnerable road users (VRUs). With advancements in sensor perception technologies such as radar, light detection and ranging (lidar), and cameras, traffic intersections are developing into dynamic and data-rich environments. By using these data to create a real-time digital twin, we can enable real-time data-driven decision making and a range of applications such as sharing perception information to connected vehicles (CVs) and connected autonomous vehicles (CAVs), safety affirmative signaling, and curb optimizing to improve efficiency and enhance safety.This paper presents an overview of the concept and examines the challenges involved in implementing an infrastructure-based cooperative perception engine at a traffic intersection. In addition to outlining the physical components, this study also addresses important challenges involved in a multi-sensor system. We present results from deploying the National Renewable Energy Laboratory's (NREL's) Infrastructure Perception and Control (IPC) mobile trailer at a traffic intersection in the city of Colorado Springs, Colorado, USA that employed multiple radars and lidars to capture the data. This study provides necessary practical learning for the Cooperative Driving Automation (CDA) and traffic engineering communities for next-generation infrastructure-based cooperative perception that promises improvements in signal control for optimized traffic flow, among other applications, and documents findings for ongoing research and development efforts in other areas.
With the advent of the next-generation traffic monitoring systems, there has been a significant increase in the spatial-temporal resolution of vehicle mobility data in many cities. Effective analysis and visualization of such data can provide transportation planners with data-driven insights, which can facilitate the understanding of multiscale traffic dynamics. In this paper, we present a web-based traffic emulator for emulating and visualizing near-real-time and historical traffic flows on highways using data from road-side sensors. To construct a continuous traffic flow, the emulator adopts an analytical pipeline that can (a) integrate traffic data collected from discrete road-side radar detection sensors, (b) interpolate traffic conditions (vehicle speed and volume) on unmeasured road segments based on traffic flow theory, and (c) generate lane-specific vehicle trajectories and movements using a mathematically optimized representation of the road network. Our app also provides an integrated visual workflow that allows users to explore the interconnected traffic dynamics using an appropriate traffic flow visualization selected based on the level of detail. We devise two innovative geo-visualization techniques that utilize an animated strips-network representation and a lane usage matrix to visualize lane performances. To ensure a smooth emulation of large-scale traffic flow in an easy-to-access web environment, we implement the emulator using client-side GPU-accelerated techniques. Lastly, we close with a case study that visualizes traffic dynamics of two scenarios - an afternoon peak hour and a traffic accident - in Chattanooga, Tennessee. Our app visualizes the responses of traffic dynamics during different traffic conditions, and to the presence of the traffic accident at different spatial scales.
By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.
The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.