Results for “heuristic algorithm” — Page 3

NASA NTRS1993

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

NASA NTRS1994

Array distribution in data-parallel programs

We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.

Chatterjee, Siddhartha↗

NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

NASA NTRS1996

Site Partitioning for Redundant Arrays of Distributed Disks

Redundant arrays of distributed disks (RADD) can be used in a distributed computing system or database system to provide recovery in the presence of disk crashes and temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites of a distributed storage system into redundant arrays in such a way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-hard. We then propose and evaluate several heuristic algorithms for finding approximate solutions. Simulation results show that significant reduction in remote parity update costs can be achieved by optimizing the site partitioning scheme.

Mourad, Antoine N.↗

NASA NTRS1997

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↗

NASA NTRS1999

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↗

NASA NTRS2003

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↗

NASA NTRS2011

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.↗

NASA NTRS2003

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.↗

NASA NTRS2019

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↗

NASA NTRS2019

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↗

NASA NTRSDate not supplied

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↗

NASA NTRSDate not supplied

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↗

NASA NTRS2019

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)↗

NASA NTRSDate not supplied

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↗

NASA NTRSDate not supplied

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↗

NASA NTRS1990

Application of heuristic satellite plan synthesis algorithms to requirements of the WARC-88 allotment plan

Creation of an Allotment Plan for the Fixed Satellite Service at the 1988 Space World Administrative Radio Conference (WARC) represented a complex satellite plan synthesis problem, involving a large number of planned and existing systems. Solutions to this problem at WARC-88 required the use of both automated and manual procedures to develop an acceptable set of system positions. Development of an Allotment Plan may also be attempted through solution of an optimization problem, known as the Satellite Location Problem (SLP). Three automated heuristic procedures, developed specifically to solve SLP, are presented. The heuristics are then applied to two specific WARC-88 scenarios. Solutions resulting from the fully automated heuristics are then compared with solutions obtained at WARC-88 through a combination of both automated and manual planning efforts.

Heyward, Ann O.↗

NASA NTRS1990

Application of heuristic satellite plan synthesis algorithms to requirements of the WARC-88 allotment plan

Creation of an Allotment Plan for the Fixed Satellite Service at the 1988 Space World Administrative Radio Conference (WARC) represented a complex satellite plan synthesis problem, involving a large number of planned and existing systems. Solutions to this problem at WARC-88 required the use of both automated and manual procedures to develop an acceptable set of system positions. Development of an Allotment Plan may also be attempted through solution of an optimization problem, known as the Satellite Location Problem (SLP). Three automated heuristic procedures, developed specifically to solve SLP, are presented. The heuristics are then applied to two specific WARC-88 scenarios. Solutions resulting from the fully automated heuristics are then compared with solutions obtained at WARC-88 through a combination of both automated and manual planning efforts.

Heyward, Ann O.↗