Search NASA⌕ Search

SEARCH · Search NASA

Results for “Routing algorithm”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Structural refinement of Pbnm-type perovskite films from analysis of half-order diffraction peaks

Engineering structural modifications of epitaxial perovskite thin films is an effective route to induce new functionalities or enhance existing properties due to the close relation of the electronic ground state to the local bonding environment. As such, there is a necessity to systematically refine and precisely quantify these structural displacements, particularly those of the oxygen octahedra, which is a challenge due to the weak scattering factor of oxygen and the small diffraction volume of thin films. In this paper, we present an optimized algorithm to refine the octahedral rotation angles using specific unit-cell-doubling half-order diffraction peaks for the a - a - c + Pbnm structure. The oxygen and A-site positions can be obtained by minimizing the squared-error between calculated and experimentally determined peak intensities using the (1/2 1/2 3/2) and (1/2 1/2 5/2) reflections to determine the rotation angle α about in-plane axes and the (1/2 5/2 1), (1/2 3/2 1), and (1/2 3/2 2) reflections to determine the rotation angle γ about the out-of-plane axis, whereas the convoluting A-site displacements associated with the octahedral rotation pattern can be determined using (1 1 1/2) and (1/2 1/2 1/2) reflections to independently determine A-site positions. The validity of the approach is confirmed by applying the refinement procedure to determine the A-site and oxygen displacements in a NdGaO 3 single crystal. Finally, the ability to refine both the oxygen and A-site displacements relative to the undistorted perovskite structure enables a deeper understanding of how structural modifications alter functionality properties in epitaxial films exhibiting this commonly occurring crystal structure.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRSDate not supplied

Terminal Area Size and Switching Technique Analysis for Unmanned Aircraft Systems Operations

Unmanned Aircraft Systems (UAS) need to be able to comply with the Code of Federal Regulations Part 91 ‘see and avoid’ requirement. Detect and avoid (DAA) is an essential enabler for integrating UAS into the National Airspace System. A DAA system is a suite of sensors, trackers, and alerting and guidance algorithms that assists a remote pilot in maintaining separation from airborne traffic. Previous works have focused on operations transiting to and from Class A or special use airspace. More recent efforts have defined DAA system requirements for operations in and around the airport terminal environment. In continuation of this effort, this paper defines the DAA Terminal Area (DTA) size and switching technique for the DAA Well Clear (DWC) volume while transitioning between en route and the terminal area.

Unmanned Aircraft Systems↗
NASA NTRS2022

Trajectory Specification Applied to Terminal Airspace

Despite major efforts to automate air traffic control (ATC), it is still performed by humans today. The complexity and safety-criticality of ATC makes it very difficult to safely automate, but it must be automated to increase airspace capacity (the density of traffic that can be safely managed) and airport throughput (the number of arrivals and departures that an airport can safely handle in a given period of time) beyond what is possible with human controllers. This paper presents the Trajectory Specification (TS) concept, which can help to safely automate ATC. TS is a method of specifying aircraft trajectories such that the position at any given time in flight is restricted to a precisely defined bounding space, removing all ambiguity as to where the flight is allowed to be. The bounding space or volume is determined by tolerances relative to a reference trajectory (position as a function of time). The tolerances are dynamic and are based on the aircraft navigation capabilities and the traffic situation. The tolerances can be a piecewise linear function of time or distance along the route, allowing the tolerances to vary as needed, typically increasing with time for departures and decreasing for arrivals. A Trajectory Specification Language (TSL) is proposed for communicating trajectories from aircraft to ATC as requests and from ATC to aircraft as assignments. The TS concept requires a new generation of airborne Flight Management Systems (FMS) that understand the TSL and can fly the assigned trajectories, but this paper focuses on the ATC functions and the prototype ATC algorithms and software that were developed to test the TS concept. Assuming conformance, TS can guarantee safe separation for an arbitrary length of time even in the event of an ATC system or communication outage. It can help to achieve the high level of safety and reliability needed for ATC automation, and it can also reduce the reliance on ATC backup systems for tactical conflict detection and resolution during normal operation. TS can be applied to any controlled airspace, including enroute, terminal, and urban airspace, but this paper presents algorithms and software for arrival spacing and conflict detection and resolution in the terminal airspace serving a major airport. In a fast-time simulation of a full day of traffic in a major terminal airspace, all conflicts were resolved in near real time, demonstrating the computational feasibility and the preliminary operational feasibility of the TS concept. This paper is a compilation of previous papers, and it adds significant information that was omitted from those papers due to length limitations. It also updates some of the results of those earlier papers due to algorithm refinements and corrections of minor software errors.

air traffic control, trajectory↗
DOE OSTI2020

Repair and Resource Scheduling in Unbalanced Distribution Systems Using Neighborhood Search

—This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed. We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignmentbased method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.

Outage management↗
DOE OSTI2020

Determining flow directions in river channel networks using planform morphology and topology

Abstract. The abundance of global, remotely sensed surface water observations has accelerated efforts toward characterizing and modeling how water moves across the Earth's surface through complex channel networks. In particular, deltas and braided river channel networks may contain thousands of links that route water, sediment, and nutrients across landscapes. In order to model flows through channel networks and characterize network structure, the direction of flow for each link within the network must be known. In this work, we propose a rapid, automatic, and objective method to identify flow directions for all links of a channel network using only remotely sensed imagery and knowledge of the network's inlet and outlet locations. We designed a suite of direction-predicting algorithms (DPAs), each of which exploits a particular morphologic characteristic of the channel network to provide a prediction of a link's flow direction. DPAs were chained together to create “recipes”, or algorithms that set all the flow directions of a channel network. Separate recipes were built for deltas and braided rivers and applied to seven delta and two braided river channel networks. Across all nine channel networks, the recipe-predicted flow directions agreed with expert judgement for 97 % of all tested links, and most disagreements were attributed to unusual channel network topologies that can easily be accounted for by pre-seeding critical links with known flow directions. Our results highlight the (non)universality of process–form relationships across deltas and braided rivers.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗
DOE OSTI2024

Fail-Safe Logic Design Strategies Within Modern FPGA Architectures

Fail-safe computing refers to computing systems that revert to a non-operational safe state when a fault occurs. In this paper, we investigate a circuit level technique as mitigation for single event upsets (SEUs) and fault injection attacks on field programmable gate arrays (FPGAs), and analyze the effectiveness of the technique as a fail-safe monitor for an encryption algorithm. The propagation of fault effects through FPGA primitives including lookup tables (LUTs) and programmable interconnect points (PIPs) is assessed within an FPGA architecture created using an open source tool, and validated using fault injection experiments on an FPGA. The analysis reveals additional vulnerabilities exist within reconfigurable architectures over those in equivalent fail-safe application specific integrated circuit (ASIC), thus requiring a more elaborate network of redundant circuits and checking logic. The configuration memory bits (CMBs), which configure routing and designate logic functions within the LUTs of the FPGA, add complexity to fail-safe design strategies by introducing additional fault conditions and fault propagation paths. A resource-efficient fail-safe circuit design technique called DEsign for Fail-safe in reCONfigurable systems (DEFCON) is proposed. The benefits and limitations associated with DEFCON are described in the context of fault injection experiments carried out as simulations and in FPGA hardware.

Bhakta, Priya A. [Univ. of New Mexico, Albuquerque↗
NASA NTRS2016

Performance Evaluation of the Approaches and Algorithms for Hamburg Airport Operations

The German Aerospace Center (DLR) and the National Aeronautics and Space Administration (NASA) have been independently developing and testing their own concepts and tools for airport surface traffic management. Although these concepts and tools have been tested individually for European and US airports, they have never been compared or analyzed side-by-side. This paper presents the collaborative research devoted to the evaluation and analysis of two different surface management concepts. Hamburg Airport was used as a common test bed airport for the study. First, two independent simulations using the same traffic scenario were conducted: one by the DLR team using the Controller Assistance for Departure Optimization (CADEO) and the Taxi Routing for Aircraft: Creation and Controlling (TRACC) in a real-time simulation environment, and one by the NASA team based on the Spot and Runway Departure Advisor (SARDA) in a fast-time simulation environment. A set of common performance metrics was defined. The simulation results showed that both approaches produced operational benefits in efficiency, such as reducing taxi times, while maintaining runway throughput. Both approaches generated the gate pushback schedule to meet the runway schedule, such that the runway utilization was maximized. The conflict-free taxi guidance by TRACC helped avoid taxi conflicts and reduced taxiing stops, but the taxi benefit needed be assessed together with runway throughput to analyze the overall performance objective.

air traffic management↗
NASA NTRS2016

Performance Evaluation of the Approaches and Algorithms using Hamburg Airport Operations

The German Aerospace Center (DLR) and the National Aeronautics and Space Administration (NASA) have been independently developing and testing their own concepts and tools for airport surface traffic management. Although these concepts and tools have been tested individually for European and US airports, they have never been compared or analyzed side-by-side. This paper presents the collaborative research devoted to the evaluation and analysis of two different surface management concepts. Hamburg Airport was used as a common test bed airport for the study. First, two independent simulations using the same traffic scenario were conducted: one by the DLR team using the Controller Assistance for Departure Optimization (CADEO) and the Taxi Routing for Aircraft58; Creation and Controlling (TRACC) in a real-time simulation environment, and one by the NASA team based on the Spot and Runway Departure Advisor (SARDA) in a fast-time simulation environment. A set of common performance metrics was defined. The simulation results showed that both approaches produced operational benefits in efficiency, such as reducing taxi times, while maintaining runway throughput. Both approaches generated the gate pushback schedule to meet the runway schedule, such that the runway utilization was maximized. The conflict-free taxi guidance by TRACC helped avoid taxi conflicts and reduced taxiing stops, but the taxi benefit needed be assessed together with runway throughput to analyze the overall performance objective.

Airport surface operations↗
NASA NTRS2016

Performance Evaluation of the Approaches and Algorithms Using Hamburg Airport Operations

The German Aerospace Center (DLR) and the National Aeronautics and Space Administration (NASA) have been independently developing and testing their own concepts and tools for airport surface traffic management. Although these concepts and tools have been tested individually for European and US airports, they have never been compared or analyzed side-by-side. This paper presents the collaborative research devoted to the evaluation and analysis of two different surface management concepts. Hamburg Airport was used as a common test bed airport for the study. First, two independent simulations using the same traffic scenario were conducted; one by the DLR team using the Controller Assistance for Departure Optimization (CADEO) and the Taxi Routing for Aircraft: Creation and Controlling (TRACC) in a real-time simulation environment, and one by the NASA team based on the Spot and Runway Departure Advisor (SARDA) in a fast-time simulation environment. A set of common performance metrics was defined. The simulation results showed that both approaches produced operational benefits in efficiency, such as reducing taxi times, while maintaining runway throughput. Both approaches generated the gate pushback schedule to meet the runway schedule, such that the runway utilization was maximized. The conflict-free taxi guidance by TRACC helped avoid taxi conflicts and reduced taxiing stops, but the taxi benefit needed be assessed together with runway throughput to analyze the overall performance objective.

nasa-dlr research collaboration↗
DOE OSTI2021

Toward autonomous design and synthesis of novel inorganic materials

Autonomous experimentation driven by artificial intelligence (AI) provides an exciting opportunity to revolutionize inorganic materials discovery and development. Herein, we review recent progress in the design of self-driving laboratories, including robotics to automate materials synthesis and characterization, in conjunction with AI to interpret experimental outcomes and propose new experimental procedures. We focus on efforts to automate inorganic synthesis through solution-based routes, solid-state reactions, and thin film deposition. In each case, connections are made to relevant work in organic chemistry, where automation is more common. Characterization techniques are primarily discussed in the context of phase identification, as this task is critical to understand what products have formed during synthesis. The application of deep learning to analyze multivariate characterization data and perform phase identification is examined. To achieve “closed-loop” materials synthesis and design, we further provide a detailed overview of optimization algorithms that use active learning to rationally guide experimental iterations. Lastly, we highlight several key opportunities and challenges for the future development of self-driving inorganic materials synthesis platforms.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Static and dynamic magnetic properties of honeycomb lattice antiferromagnets Na 2 M 2 TeO 6 , M = Co and Ni

The magnetic structures and spin dynamics of Na 2 CO 2 TeO 6 and Na 2 Ni 2 TeO 6 are investigated by means of elastic and inelastic neutron scattering measurements and the results are discussed in the context of a generalized Kitaev-Heisenberg model on a honeycomb lattice with strong spin-orbit coupling. The large number of parameters involved in the Hamiltonian model is evaluated by using an iterative optimization algorithm capable of extracting model solutions and simultaneously estimating their uncertainty. The analyses indicate that both Co 2+ (d 7 ) and Ni 2+ (d 8 ) antiferromagnets realize bond-dependent anisotropic nearest-neighbor interactions and support the theoretical predictions for the realization of Kitaev physics in 3 d electron systems with effective spins S = 1/2 and 1. By studying the Na-doped system Na 2.4 Ni 2 TeO 6 , we show that the control of Na content can provide an effective route for fine-tuning the magnetic lattice dimensionality, as well as to controlling the bond-dependent anisotropic interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2015

PlanetSense: A Real-time Streaming and Spatio-temporal Analytics Platform for Gathering Geo-spatial Intelligence from Open Source Data

Geospatial intelligence has traditionally relied on the use of archived and unvarying data for planning and exploration purposes. In consequence, the tools and methods that are architected to provide insight and generate projections only rely on such datasets. Albeit, if this approach has proven effective in several cases, such as land use identification and route mapping, it has severely restricted the ability of researchers to inculcate current information in their work. This approach is inadequate in scenarios requiring real-time information to act and to adjust in ever changing dynamic environments, such as evacuation and rescue missions. In this work, we propose PlanetSense, a platform for geospatial intelligence that is built to harness the existing power of archived data and add to that, the dynamics of real-time streams, seamlessly integrated with sophisticated data mining algorithms and analytics tools for generating operational intelligence on the fly. The platform has four main components – i) GeoData Cloud – a data architecture for storing and managing disparate datasets; ii) Mechanism to harvest real-time streaming data; iii) Data analytics framework; iv) Presentation and visualization through web interface and RESTful services. Using two case studies, we underpin the necessity of our platform in modeling ambient population and building occupancy at scale.

big data architecture↗
DOE OSTI2026

Blueprint for DOE Quantum Supercomputing: Ensuring U.S. Leadership in the Quantum Decade

Quantum computing stands at the threshold of a transformative decade, where the field will evolve from small-scale demonstrations toward practical scientific computing at scale. This Blueprint identifies fault-tolerant quantum computers (FTQCs) as a viable, scalable, and broadly applicable path to achieving “quantum scientific utility,” defined as solving scientifically valuable problems beyond the reach of conventional, classical computers. This capability is expected to show scientific demonstrations in the late 2020s and to mature in the early-to-mid 2030s. This Blueprint outlines a strategy to prepare the U.S. Department of Energy (DOE) for FTQCs and their integration into the U.S. national scientific computing infrastructure. Its purpose is to identify the steps, milestones, and research directions necessary for DOE to enable initial deployment of FTQCs in 2028 as a scientific tool for the nation and mature this capability into the 2030s. DOE has a long history of supporting quantum information science and technology, contributing significantly to research advancements, training a quantum-ready workforce, and providing access to early small-scale quantum hardware. Given recent demonstrations of logical operations on error-corrected logical qubits and the advancement of commercial hardware roadmaps, DOE should begin preparations for large-scale, fault-tolerant quantum computing deployment for DOE science missions. This Blueprint proposes that DOE focus on (1) deploying first-generation scientifically relevant quantum computers with at least 100 logical qubits and performing at least 10,000 to 100,000 hard logical operations in scientifically relevant calculations; (2) developing essential FTQC programming competencies, system software, and facility readiness; and (3) investing in cutting edge focused R&D that fosters breakthroughs in scientific applications, algorithms, and logical architectures needed to accelerate the advent of scientific utility. This effort will position DOE to transition to larger systems: production-scale quantum computers that comprise 1,000 to 10,000 logical qubits, perform 1 to 10 billion hard logical operations, and execute scientifically useful computations at scale. Achieving these goals will require DOE facilities to evolve with urgency to support scientific campaigns that integrate quantum and classical computing resources into efficient workflows, novel software and firmware environments for compiling and routing quantum programs on FTQC machines, and suitable infrastructure for quantum hardware. It will also require further development and optimization of scientific applications from the fields of materials science, quantum chemistry, and high-energy and nuclear physics. The Blueprint calls for transformative R&D and collective action to accelerate the advent of scientific quantum utility and bring it within reach by 2028.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2015

Scalable Lunar Surface Networks and Adaptive Orbit Access

Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.

Wang, Xudong↗
DOE OSTI2020

Accurate prediction of core-level spectra of radicals at density functional theory cost via square gradient minimization and recoupling of mixed configurations

State-specific orbital optimized approaches are more accurate at predicting core-level spectra than traditional linear-response protocols, but their utility had been restricted due to the risk of "variational collapse" down to the ground state. We employ the recently developed square gradient minimization algorithm to reliably avoid variational collapse and study the effectiveness of orbital optimized density functional theory (DFT) at predicting second period element 1s core-level spectra of open-shell systems. Several density functionals (including SCAN, B3LYP, and ωB97X-D3) are found to predict excitation energies from the core to singly occupied levels with high accuracy (≤0.3 eV RMS error) against available experimental data. Higher excited states are, however, more challenging by virtue of being intrinsically multiconfigurational. We thus present a configuration interaction inspired route to self-consistently recouple single determinant mixed configurations obtained from DFT, in order to obtain approximate doublet states. This recoupling scheme is used to predict the C K-edge spectra of the allyl radical, the O K-edge spectra of CO + , and the N K-edge of NO 2 with high accuracy relative to experiment, indicating substantial promise in using this approach for the computation of core-level spectra for doublet species [vs more traditional time dependent DFT, equation of motion coupled cluster singles and doubles (EOM-CCSD), or using unrecoupled mixed configurations]. Finally, we also present general guidelines for computing core-excited states from orbital optimized DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Processing Particle Data Flows with SmartNICs

Many distributed applications implement complex data flows and need a flexible mechanism for routing data between producers and consumers. Recent advances in programmable network interface cards, or SmartNICs, represent an opportunity to offload data-flow tasks into the network fabric, thereby freeing the hosts to perform other work. System architects in this space face multiple questions about the best way to leverage SmartNICs as processing elements in data flows. In this paper, we advocate the use of Apache Arrow as a foundation for implementing data-flow tasks on SmartNICs. We report on our experiences adapting a partitioning algorithm for particle data to Apache Arrow and measure the on-card processing performance for the BlueField-2 SmartNIC. Our experiments confirm that the BlueField-2’s (de)compression hardware can have a significant impact on in-transit workflows where data must be unpacked, processed, and repacked.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Automated Airspace Management: Concept, Development, and Testing

For many decades, researchers at NASA Ames Research Center have worked to make the air-transportation system more efficient, predictable, and effective. Since about 2005 one important aspect of this research has been the development of an autonomous system for air-traffic control. This system, known as the Autoresolver, is designed to perform most of the roles that air-traffic controllers perform including ensuring separation between aircraft, creating routes around weather and other avoidance volumes, and sequencing and scheduling aircraft across points in space. The recent, rapid expansion of new aircraft operations and types, including urban air mobility aircraft and small unmanned aerial systems, have only increased the need for highly automated systems to control the predicted traffic demand. This talk will focus on the development of the Autoresolver - from concept to testing. It will also discuss the National Airspace (NAS) Digital Twin simulation platform, created to facilitate rapid testing and improvement of the algorithm and with the hope of proving the automation in a high-fidelity environment. An open question that will be discussed is how to ensure that the system-level emergent behavior of independently developed autonomous algorithms is what is desired.

autonomy↗