Search NASA⌕ Search

SEARCH · Search NASA

Results for “Heuristic algorithms”

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 109 records · Page 6

Optimizing Aerobot Exploration of Venus

Venus Flyer Robot (VFR) is an aerobot; an autonomous balloon probe designed for remote exploration of Earth's sister planet in 2003. VFR's simple navigation and control system permits travel to virtually any location on Venus, but it can survive for only a limited duration in the harsh Venusian environment. To help address this limitation, we develop: (1) a global circulation model that captures the most important characteristics of the Venusian atmosphere; (2) a simple aerobot model that captures thermal restrictions faced by VFR at Venus; and (3) one exact and two heuristic algorithms that, using abstractions (1) and (2), construct routes making the best use of VFR's limited lifetime. We demonstrate this modeling by planning several small example missions and a prototypical mission that explores numerous interesting sites recently documented in the plane tary geology literature.

SPACE EXPLORATION↗

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

User Centered, Application Independent Visualization of National Airspace Data

This paper describes an application independent software tool, IV4D, built to visualize animated and still 3D National Airspace System (NAS) data specifically for aeronautics engineers who research aggregate, as well as single, flight efficiencies and behavior. IV4D was origin ally developed in a joint effort between the National Aeronautics and Space Administration (NASA) and the Air Force Research Laboratory (A FRL) to support the visualization of air traffic data from the Airspa ce Concept Evaluation System (ACES) simulation program. The three mai n challenges tackled by IV4D developers were: 1) determining how to d istill multiple NASA data formats into a few minimal dataset types; 2 ) creating an environment, consisting of a user interface, heuristic algorithms, and retained metadata, that facilitates easy setup and fa st visualization; and 3) maximizing the user?s ability to utilize the extended range of visualization available with AFRL?s existing 3D te chnologies. IV4D is currently being used by air traffic management re searchers at NASA?s Ames and Langley Research Centers to support data visualizations.

Murphy, James R.↗

Detecting Edges in Images by Use of Fuzzy Reasoning

A method of processing digital image data to detect edges includes the use of fuzzy reasoning. The method is completely adaptive and does not require any advance knowledge of an image. During initial processing of image data at a low level of abstraction, the nature of the data is indeterminate. Fuzzy reasoning is used in the present method because it affords an ability to construct useful abstractions from approximate, incomplete, and otherwise imperfect sets of data. Humans are able to make some sense of even unfamiliar objects that have imperfect high-level representations. It appears that to perceive unfamiliar objects or to perceive familiar objects in imperfect images, humans apply heuristic algorithms to understand the images

Dominguez, Jesus A.↗

Modeling Deicing Operations in Departure Scheduling Using Fast Time Simulation

In winter snow conditions, aircraft need inspection for deicing service before takeoff. Deicing service is a procedure to remove frost, ice, slush, or snow from aircraft for safe operation. Deicing operations vary by airport in many ways. Some airports have designated deicing zones, whereas some use a closed runway or terminal area to perform the procedure. Nonetheless, deicing operations add extra workloads to controllers, and cause increased taxi traffic on the ground. NASA and Korea Aerospace Research Institute (KARI) have been collaborating to model deicing operations at Incheon International Airport (ICN). This paper describes the deicing model and the study of deicing operations in departure scheduling using fast time simulations. The deicing model uses a heuristic algorithm for deicing zone assignment. In the fast time simulations, the model uses probability distributions derived from actual operation data to model deicing request and deicing zone time. It is envisioned that such a deicing model can be useful in airport surface scheduling to provide decision support and improve traffic management performance in winter snow operations.

modeling and simulation↗

Modeling Deicing Operations in Departure Scheduling using Fast Time Simulation

In winter snow conditions, aircraft need inspection for deicing service before takeoff. Deicing service is a procedure to remove frost, ice, slush, or snow from aircraft for safe operation. Deicing operations vary by airport in many ways. Some airports have designated deicing zones, whereas some use a closed runway or terminal area to perform the procedure. Nonetheless, deicing operations add extra workloads to controllers, and cause increased taxi traffic on the ground. NASA and Korea Aerospace Research Institute (KARI) have been collaborating to model deicing operations at Incheon International Airport (ICN). This paper describes the deicing model and the study of deicing operations in departure scheduling using fast time simulations. The deicing model uses a heuristic algorithm for deicing zone assignment. In the fast time simulations, the model uses probability distributions derived from actual operation data to model deicing request and deicing zone time. It is envisioned that such a deicing model can be useful in airport surface scheduling to provide decision support and improve traffic management performance in winter snow operations.

surface operation↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗

Economic Dispatch for DC-Connected Battery Systems on Large PV Plants

Falling costs of energy storage combined with an increasing need to mitigate variable generation integration issues is leading to more PV projects that include batteries. Large PV plants that include batteries face challenges optimizing the value of the power they produce, especially when the batteries are DC-coupled and otherwise clipped power (due to high DC/AC ratio) is available. Multiple charging times and sources must be considered, including: grid charging, charging from PV that would otherwise be exported to the grid, and charging from clipped PV power. Then discharge schedules must be optimized against time-of-day pricing. The National Renewable Energy Laboratory in partnership with Southern Company has developed a heuristic algorithm in the System Advisor Model (SAM) which strategically charges the battery from PV and discharges the battery depending on the time-of-day prices of the PPA, the forecast PV production, and the estimated wear cost of the battery. The algorithm and case study results from a generic plant will be presented with recommendations for future work.

25 ENERGY STORAGE↗

Impacts of Travel Demand Information Diffusion on Reducing Empty Vehicle Miles Traveled by Ridesourcing Vehicles

Ride-hailing or ride-sourcing services provide alternative mobility options in several cities and have seen exponential growth in market share owing to the convenience they provide. Even though usage of such services may be associated with car-light and car-free lifestyles, there are growing concerns around their impact on urban transportation network operations due to empty miles driven without a passenger (deadheading). This study is motivated by the potential for reducing deadhead mileage by providing information on future trip demand to ride-sourcing drivers (at the destination end of their current trip). Future trip demand information enables the driver to wait in place for the next rider without cruising around and contributing to congestion. A machine learning model is applied using historical data to predict hourly and 10-minute future interval demand for ride-sourcing. Two heuristic algorithms have been developed to i) determine drivers that act on demand information received by waiting in place for the next rider, and ii) match drivers who wait to their next trip by minimizing deadheading distance. Data from ride-sourcing providers in Austin, Texas (RideAustin) and in Chengdu, China (DiDi) are leveraged to apply the methodology. Results show that the process results in 68%-82% and 53%-60% trip-level deadheading miles reduction for RideAustin and DiDi sample operations, respectively. As the maximum tolerable driver's waiting time increases, deadheading savings slightly increase. Even if the maximum percentage of drivers waiting is reduced, significant average deadheading savings by trip can be achieved for that portion.

33 ADVANCED PROPULSION SYSTEMS↗

OPER: Optimality-Guided Embedding Table Parallelization for Large-scale Recommendation Model

With the sharp increasing volume of user data, Deep Learning Recommendation Model (DLRM) becomes an indispensable infrastructure in large technology companies. However, large-scale DLRM on the multi-GPU platform is still inefficient due to unbalanced workload partitioning and intensive inter-GPU communication. To this end, we propose OPER, an OPtimality guided Embedding table placement for large-scale Recommendation model training and inference. OPER explores the potential of mitigating remote memory access latency in DLRM through fine-grained embedding table placement. Specifically, OPER proposes a theoretical modeling that builds up the relationship between EMT placement and the embedding communication latency in both training and inference. OPER proves the NP hardness of finding the optimal embedding table placement and proposes a heuristic algorithm that yields near optimal placement. OPER implements a SHMEM-based embedding table training system and a unified embedding index mapping to support fine-grained embedding table sharding and placement. Comprehensive experiments reveal that OPER achieves on average 3.4× and 5.1× speedup on training and inference respectively over state-of-the-art DLRM frameworks.

Wang, Zheng↗

A Tactical Scheduler for Surface Metering Under Minimum Departure Interval Restrictions

Minimum Departure Interval (MDI) and Miles-In-Trail (MIT) are common traffic management tools. They both require minimum separation between departures to meet specific traffic conditions. The MDI restriction is a time separation requirement between departures, usually on the same Standard Instrument Departure (SID), whereas the MIT restriction is a distance separation requirement between aircraft, including but not limited to departure flights, to meet specific criteria associated with flight path or destination. At Incheon International Airport (IATA code: ICN) in South Korea, MDIs are imposed on 92% of departure flights. They involve specific criteria including not only having identical SID, but also satisfying other conditions, imposed on the flight path and destination. To address complicated MDI constraints, Korea Aerospace Research Institute (KARI) has been developing and improving a tactical scheduler for surface metering at ICN to provide appropriate target times for pushbacks and takeoffs for departure flights under MDIs. This paper describes the MDI requirements at ICN, the development of a heuristic scheduling algorithm to work with the MDI restrictions, and the performance evaluation of the algorithm through fast-time simulations. The performance evaluation results indicate that the proposed heuristic algorithm can provide the surface metering schedules that comply with the MDI restrictions without significant performance degradation.

DMAN (Departure Management)↗

Taming convergence in the determinant approach for x-ray excitation spectra

A determinant formalism in combination with ab initio calculations was proposed recently and has paved a way for simulating and interpreting x-ray excitation spectra in condensed-phase systems. The method systematically takes into account many-electron effects in the Mahan-Noziéres-De Dominicis (MND) theory, including core-level excitonic effects, the Fermi-edge singularity, shakeup excitations, and wave function overlap effects such as the orthogonality catastrophe, all within a universal framework using many-electron configurations. A heuristic search algorithm was introduced to search for the configurations that are important for defining the x-ray spectral line shape, instead of enumerating them in a brute-force way. The algorithm has proven to be efficient for calculating O K edges of transition metal oxides, which converge at the second excitation order (denoted as $f^{(n)}$ with n = 2), i.e., the final-state configurations with two e-h pairs (with one hole being the core hole). However, it remains unknown how the determinant x-ray spectra converge for general cases and at which excitation order n should one stop the determinant calculation. Even with the heuristic algorithm, the number of many-electron configurations still grows exponentially with the excitation order n. In this work we prove two theorems that can indicate the order of magnitude of the contribution of the $f^{(n)}$ configurations, so that one can estimate their contribution very quickly without actually calculating their amplitudes. The two theorems are based on singular-value decomposition (SVD) analysis, a method that is widely used to quantify entanglement between two quantum many-body systems. Finally, we examine the K edges of several metallic systems with the determinant formalism up to $f^{(5)}$ to illustrate the usefulness of the theorems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Modeling transmission line constraints in two-stage robust unit commitment problem

Integration of renewable energy sources and demand response poses new challenges to system operators as they increase the uncertainty of the power supply and demand. Recently, robust optimization techniques are applied to the unit commitment problem with uncertainty as an alternative to the stochastic programming approaches. However, it remains challenging to solve the robust unit commitment model with full transmission line constraints. In this paper, we propose novel acceleration techniques for solving two-stage robust unit commitment problem with consideration of full transmission line constraints. We use 1) the cutting-plane algorithm for the master problem, which dynamically includes critical transmission line constraints, and 2) column-generation methods, including the branch-and-price-and-cut algorithm and heuristic approaches, for the subproblems, which add only necessary transmission line dual variables on the fly. Furthermore, computational results for the modified IEEE 118-bus system show that the combination of the cutting-plane algorithm and the heuristic column-generation approach greatly reduces the total solution time of the two-stage robust unit commitment problem.

Heuristic algorithms↗

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗