SEARCH · Engineering Papers

Results for “path”

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1961

Flight-Path Characteristics for Decelerating From Supercircular Speed

Characteristics of the following six flight paths for decelerating from a supercircular speed are developed in closed form: constant angle of attack, constant net acceleration, constant altitude" constant free-stream Reynolds number, and "modulated roll." The vehicles were required to remain in or near the atmosphere, and to stay within the aerodynamic capabilities of a vehicle with a maximum lift-drag ratio of 1.0 and within a maximum net acceleration G of 10 g's. The local Reynolds number for all the flight paths for a vehicle with a gross weight of 10,000 pounds and a 600 swept wing was found to be about 0.7 x 10(exp 6). With the assumption of a laminar boundary layer, the heating of the vehicle is studied as a function of type of flight path, initial G load, and initial velocity. The following heating parameters were considered: the distribution of the heating rate over the vehicle, the distribution of the heat per square foot over the vehicle, and the total heat input to the vehicle. The constant G load path at limiting G was found to give the lowest total heat input for a given initial velocity. For a vehicle with a maximum lift-drag ratio of 1.0 and a flight path with a maximum G of 10 g's, entry velocities of twice circular appear thermo- dynamically feasible, and entries at velocities of 2.8 times circular are aerodynamically possible. The predominant heating (about 85 percent) occurs at the leading edge of the vehicle. The total ablated weight for a 10,000-pound-gross-weight vehicle decelerating from an initial velocity of twice circular velocity is estimated to be 5 percent of gross weight. Modifying the constant G load flight path by a constant-angle-of-attack segment through a flight- to circular-velocity ratio of 1.0 gives essentially a "point landing" capability but also results in an increased total heat input to the vehicle.

Luidens, Roger W.↗

NASA NTRS1998

Multiobjective Evolutionary Path Planning via Sugeno-Based Tournament Selection

This paper introduces a new tournament selection algorithm that can be used for evolutionary path planning systems. The fuzzy (Sugeno) tournament selection algorithm (STSA) described in this paper selects candidate paths (CPs) to be parents and undergo reproduction based on: (1) path feasibility, (2) the euclidean distance of a path from the origin to its destination, and (3) the average change in the slope of a path. In this paper, we provide a detailed description of the fuzzy inference system used in the STSA as well as some examples of its usefulness. We then use 12 instances of our STSA to rank a population of CPs based on the above criteria. We also show how the STSA can obviate the need for the development of an explicit (lexicographic multiobjective) evaluation function and use it to develop multiobjective motion paths.

Dozier, Gerry↗

NASA NTRS1991

Aircraft flight path angle display system

A display system for use in an aircraft control wheel steering system provides the pilot with a single, quickened flight path angle display to overcome poor handling qualities due to intrinsic flight path angle response lags, while avoiding multiple information display symbology. The control law for the flight path angle control system is designed such that the aircraft's actual flight path angle response lags the pilot's commanded flight path angle by a constant time lag .tau., independent of flight conditions. The synthesized display signal is produced as a predetermined function of the aircraft's actual flight path angle, the time lag .tau. and command inputs from the pilot's column.

Lambregts, Antonius A.↗

NASA NTRS2008

Assessment of Crack Path Prediction in Non-Proportional Mixed-Mode Fatigue

Non-proportional mixed-mode loading is present in many systems and a growing crack can experience any manner of mixed-mode loading. Prediction of the resulting crack path is important when assessing potential failure modes or when performing a failure investigation. Current crack path selection criteria are presented along with data for Inconel 718 under non-proportional mixed-mode loading. Mixed-mode crack growth can transition between path deflection mechanisms with very different orientations. Non-proportional fatigue loadings lack a single parameter for input to current crack path criteria. Crack growth transitions were observed in proportional and non-proportional FCG tests. Different paths displayed distinct fracture surface morphologies. New crack path drivers & transition criteria must be developed.

Highsmith, Shelby, Jr.↗

NASA NTRS2015

Arrival Scheduling with Shortcut Path Options and Mixed Aircraft Performance

Previous work introduced the concept of using tactical shortcut options to improve schedule conformance in terminal airspace. When a scheduling point is congested, aircraft are scheduled to longer nominal paths, holding shortcut path options in reserve for tactical use if an aircraft is late, thereby improving the schedule conformance, reducing the required scheduling buffer, and increasing throughput. When the scheduling point is less congested, aircraft may be scheduled to the shorter path with original larger scheduling buffers. Previous work focused on a single generic merge point serving aircraft with uniform arrival precision. This paper extends the previous concept to enhance the performance of time-based arrival management and consider mixed aircraft performance. Aircraft equipped to achieve a high degree of schedule conformance may be scheduled to the shorter path under the same conditions that a less equipped aircraft would be scheduled to the longer path, giving the equipped aircraft an advantage that can be seamlessly integrated into the scheduler. The arrival scheduler with shortcut path options for mixed aircraft performance is applied to a model of first-come first-served terminal metering at Los Angeles International Airport. Whereas clear system benefits were found for tactical shortcut routing and higher percentages of equipped aircraft, very little advantage could be seen for equipped over unequipped aircraft that could be used to incentivize early equipage.

Equipage operations↗

NASA NTRS2020

Space Chicken: A Historical Look at How the Critical Path Changes over a Mission’s Development

The critical path in schedule analysis defines the series of tasks that have no schedule slack leading to the delivery of a system. The critical path for NASA science missions, which typically runs through a spacecraft subsystem or a scientific instrument, is dynamic and changes over the development lifetime of a project. Often the critical path at the start of preliminary design will be through a specific spacecraft subsystem while the final, delivered critical path item is often a scientific instrument that is delivered late. The research for this paper looks at the postulated critical path at different milestones, and the actual critical path item at final delivery, for a variety of NASA science missions to understand what elements are impacting the delivery schedule the most. Recommendations are made based on these quantitative results relative to what elements should potentially be considered more often in early development schedules to more robustly plan for development issues.

Bitten, Robert↗

NASA NTRS2021

Machine Learning Based Path Planning for Improved Rover Navigation

Enhanced AutoNav (ENav), the baseline surface navigation software for NASA’s Perseverance rover, sorts a list of candidate paths for the rover to traverse, then uses the Approximate Clearance Evaluation (ACE) algorithm to evaluate whether the most highly ranked paths are safe. ACE is crucial for maintaining the safety of the rover, but is computationally expensive. If the most promising candidates in the list of paths are all found to be infeasible, ENav must continue to search the list and run time-consuming ACE evaluations until a feasible path is found. In this paper, we present two heuristics that, given a terrain heightmap around the rover, produce cost estimates that more effectively rank the candidate paths before ACE evaluation. The first heuristic uses Sobel operators and convolution to incorporate the cost of traversing high-gradient terrain. The second heuristic uses a machine learning (ML) model to predict areas that will be deemed untraversable by ACE. We used physics simulations to collect training data for the ML model and to run Monte Carlo trials to quantify navigation performance across a variety of terrains with various slopes and rock distributions. Compared to ENav's baseline performance, integrating the heuristics can lead to a significant reduction in ACE evaluations and average computation time per planning cycle, increase path efficiency, and maintain or improve the rate of successful traverses. This strategy of targeting specific bottlenecks with ML while maintaining the original ACE safety checks provides an example of how ML can be infused into planetary science missions and other safety-critical software.

Yue, Yisong↗

NASA NTRS2003

Optical path control in the MAM testbed

Future space-based optical interferometers will require control of the optical path delay to accomplish some or all of the three objectives: balancing the optical path in the two arms to within a tolerance corresponding to the coherence length of the star light being observed, modulating the optical path in order to observe the phase of the star light interference fringe, and modulating the path length in order to reduce the effect of cyclic errors in the laser metrology system used to measure the optical path length in the two arms of the interferometer.

optical interferometers optical path MAM testbed M↗

NASA NTRS2002

Algorithms and Sensors for Small Robot Path Following

Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of robots to be able to automatically execute path following behaviors, with one or more followers tracking the path taken by a leader. The key challenges to enabling such a capability are (l) to develop sensor packages for such small robots that can accurately determine the path of the leader and (2) to develop path following algorithms for the subsequent robots. To date, we have integrated gyros, accelerometers, compass/inclinometers, odometry, and differential GPS into an effective sensing package. This paper describes the sensor package, sensor processing algorithm, and path tracking algorithm we have developed for the leader/follower problem in small robots and shows the result of performance characterization of the system. We also document pragmatic lessons learned about design, construction, and electromagnetic interference issues particular to the performance of state sensors on small robots.

path following↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

NASA NTRSDate not supplied

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

GNSS↗

DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗

DOE OSTI2025

Operation of helium sub-atmospheric multistage cryogenic centrifugal compressor trains: Part 2 – Transient modeling and pump-down path selection

Low-pressure conditions required for operation of helium cryogenic systems below the normal boiling point (i.e. 4.2 K) are established through a transient process, commonly referred to as ‘pump-down’. This process is defined as the transition from pressures above atmospheric conditions to the saturation pressure which corresponds to a specified operational temperature. The FRIB 2 K system consists of five cryogenic centrifugal compressors which are operated in series. Historically, the pump-down process path has been established through empirical methods and system operator experience. Investigation into the pump-down process at FRIB aimed to develop a pump-down methodology which relies on theoretical model predictions rather than empirically developed process paths. Ensuring stable operation during the pump-down process involved application of a centrifugal compressor performance prediction model, which is described in Part 1 of this paper. Compressor performance maps can be directly used to evaluate the stability of a selected pump-down path and anticipate the overall reliability of the selected path. In conjunction with the compressor performance maps, a system pressure model was developed to estimate the transient pressure response during the pump-down process. Lastly, an explicit equation was developed to establish a mass flow rate profile for the pump-down process. Implementation of the presented methodology (including the developed models) allows for the system operator to determine a continuous pump-down path which maintains compressor stability while conforming to overall system capabilities. Altogether, the methodology presented has resulted in simplification of transient pump-down operations and increased the reliability, stability and efficiency of the pump-down process.

Compressor train control↗

DOE OSTI2024

Path integrals, complex probabilities and the discrete Weyl representation

Abstract A discrete formulation of the real-time path integral as the expectation value of a functional of paths with respect to a complex probability on a sample space of discrete valued paths is explored. The formulation in terms of complex probabilities is motivated by a recent reinterpretation of the real-time path integral as the expectation value of a potential functional with respect to a complex probability distribution on cylinder sets of paths. The discrete formulation in this work is based on a discrete version of the Weyl algebra that can be applied to any observable with a finite number of outcomes. The origin of the complex probability in this work is the completeness relation. In the discrete formulation the complex probability exactly factors into products of conditional probabilities and exact unitarity is maintained at each level of approximation. The approximation of infinite dimensional quantum systems by discrete systems is discussed. The method is illustrated by applying it to scattering theory and quantum field theory. The implications of these applications for quantum computing is discussed.

Physics↗

DOE OSTI2025

Quantum Hamilton-Jacobi theory, spectral path integrals, and exact WKB analysis

We propose a new way to perform path integrals in quantum mechanics by using a quantum version of Hamilton-Jacobi (HJ) theory. In classical mechanics, Hamilton-Jacobi theory is a powerful formalism, however, its utility is not explored in quantum theory beyond approximation schemes. The canonical transformation enables one to set the new Hamiltonian to constant or zero, but keeps the information about solution in Hamilton’s characteristic function. To benefit from this in quantum theory, one must work with a formulation in which classical Hamiltonian is used. This uniquely points to phase space path integral. However, the main variable in HJ formalism is energy, not time. Thus, we are led to consider the Fourier transform of the path integral, the spectral path integral Z ˜ ( E ) . The evaluation of path integrals reduces to determining the quantum Hamilton characteristic functions (which can be achieved via an asymptotic analysis) and a discrete sum over the quantum period lattice, generalizing Gutzwiller’s sum. Published by the American Physical Society 2025

Türe, Mustafa (ORCID:0009000975968618)↗

DOE OSTI2022

Tri-Sectional Approximation of the Shortest Path to Long-Term Voltage Stability Boundary with Distributed Energy Resources

Ensuring long-term voltage stability is critical for reliable operations of power grids. High share of distributed energy resources (DERs) can create complicated system operation modes that may invalidate the traditional long-term voltage stability analysis based on typical operation modes. To address this challenge, this paper investigates how to compute the shortest path to the voltage stability boundary in the DER aggregated load space with large dispersion. Instead of working in the Euclidean space, we establish the analysis and computations on the algebraic power flow manifold to better capture the curvature change of the shortest path along the direction of losing stability. A modified optimal control framework is presented for obtaining the ground-truth of the smooth shortest path on the manifold. To efficiently and accurately solve for the shortest path, we further leverage the geometric features of the power flow manifold and propose a tri-sectional approximation model that is scalable for large-scale systems. Several numerical examples, up to the 1354-bus system, with different DER penetration levels and high dimensional renewable power injection variations are evaluated. The simulation results demonstrate that the tri-sectional approximation achieves high accuracy and efficiency to approximate the shortest path to the voltage stability boundary.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

Quantitative analysis of three-dimensional fatigue crack path selection in Mg alloy WE43 using high-energy X-ray diffraction microscopy

Fatigue short-cracks in Mg alloys display complex growth behavior due to high plastic anisotropy and crack path dependence on local microstructural features. In this study, the three-dimensional crystallography of short-crack paths in Mg alloy WE43 was characterized by mapping near-field high-energy X-ray diffraction microscopy (HEDM) reconstructed grain maps to high-resolution X-ray CT reconstructions of the fracture surfaces in the crack initiation and short-crack growth regions of six ultrasonic fatigue specimens. Crack–grain–boundary intersections were analyzed at 81 locations across the six crack paths. The basal intragranular, non-basal intragranular, or intergranular character of short-crack growth following each boundary intersection was correlated to crystallographic and geometric parameters of the trailing and leading grains, three-dimensional grain boundary plane, and advancing crack front. The results indicate that crack paths are dependent on the combined crystallographic and geometric character of the local microstructure, and crack path prediction can be improved by use of dimensionality reduction on subsets of high-linear-correlation microstructural parameters.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Modeling Partial Reflection Paths for Infrasound Analysis

Numerical methods enabling simulation of scattered and partially reflected infrasonic propagation paths produced by interaction with fine-scale structure in the middle atmosphere have been implemented in the infraGA ray tracing software. This capability enables simulation of ensonification in the classical stratospheric “shadow zone” that has been observed during the Humming Roadrunner and LSECE surface explosion campaigns as well as in other data sets. In the case of LSECE, a pair of stations roughly 140 kilometers east of the source location observed arrivals with celerities (horizontal group velocities) slightly slower than observed stratospheric paths at similar azimuths. The arrivals exhibited increasing trace velocity later in the wavetrain indicating a steepening of the arrival path for longer or slower propagation paths. Simulation of partially reflected paths using the updated infraGA software methods finds good agreement between observed and predicted infrasonic ensonification at these locations within the stratospheric shadow zone. Further development of the partial reflection physics and comparison with other data sets is needed to more robustly understand how such anomalous infrasonic signals can be predicted; however, the demonstration of this capability is a promising first step in such analyses.

97 MATHEMATICS AND COMPUTING↗