Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel scheduling”

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 217 records · Page 12

Parallelization of the Pipelined Thomas Algorithm

In this study the following questions are addressed. Is it possible to improve the parallelization efficiency of the Thomas algorithm? How should the Thomas algorithm be formulated in order to get solved lines that are used as data for other computational tasks while processors are idle? To answer these questions, two-step pipelined algorithms (PAs) are introduced formally. It is shown that the idle processor time is invariant with respect to the order of backward and forward steps in PAs starting from one outermost processor. The advantage of PAs starting from two outermost processors is small. Versions of the pipelined Thomas algorithms considered here fall into the category of PAs. These results show that the parallelization efficiency of the Thomas algorithm cannot be improved directly. However, the processor idle time can be used if some data has been computed by the time processors become idle. To achieve this goal the Immediate Backward pipelined Thomas Algorithm (IB-PTA) is developed in this article. The backward step is computed immediately after the forward step has been completed for the first portion of lines. This enables the completion of the Thomas algorithm for some of these lines before processors become idle. An algorithm for generating a static processor schedule recursively is developed. This schedule is used to switch between forward and backward computations and to control communications between processors. The advantage of the IB-PTA over the basic PTA is the presence of solved lines, which are available for other computations, by the time processors become idle.

Povitsky, A.↗

Exploiting Quantum Resonance to Solve Combinatorial Problems

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Zak, Michail↗

A Machine Learning Approach to Improve Air Traffic Management Initiatives

Collaborating closely with commercial air carriers and related organizations, the Federal Aviation Administration(FAA) regulates air traffic and ensures the safety and efficiency of air operations. Air traffic controllers make strategic decisions, such as delaying, rerouting, or canceling flights, partly based on guidance provided by the FAA’s Air TrafficControl System Command Center (ATCSCC). The guidance includes, among other things, control measures known asTraffic Management Initiatives (TMIs) designed to enhance safety and improve operational efficiency. TMIs play a crucial role in managing the demand and capacity within the U.S. National Airspace System (NAS). Two major TMIs that are routinely used (primarily to mitigate the adverse effects of bad weather) are Ground Delay Programs (GDPs) andGround Stops (GSs). In a GDP, flights destined for airports facing thunderstorm activity experience delays at their origin airports. This proactive approach minimizes the risk of routing aircraft through hazardous weather conditions and also replaces (fuel burning) airborne delays with ground delays. In a GS, a temporary restriction is imposed on the departure or arrival of aircraft at a specific airport or within a designated airspace. Although other TMIs (e.g., miles-in-trail) are also implemented as part of (air) traffic flow management in the NAS, the focus of this work is on GDPs and GSs. Since TMIs, by design, lead to flight delays or cancellations, it is crucial to put in place the right set of parameters(e.g., scope and duration of the GDP). For example, when the end time of a GDP extends beyond what is necessary, it imposes unnecessary delays on departing flights. This situation could occur as a result of inaccurate prediction of the(required) duration of the GDP based on the weather forecast. On the other hand, if a GDP ends prematurely before the underlying capacity constraints are resolved at the destination airport, it may result in airborne holding. The delicate balance lies in matching the termination of the GDP precisely with the resolution of capacity constraints, avoiding both the imposition of unnecessary ground delays and the need for airborne holding due to premature program termination.Failing to specify the right parameters for TMIs also leads to flight delays, creating a significant obstacle in managing the increasing traffic volumes causing increased work load for the controllers. To address this issue, we propose the integration of Machine Learning (ML) models in the traffic flow management(TFM) pipeline. In current operations, decisions are made by human experts based on extensive training, historical patterns, available traffic and weather data. Since we have an abundance of data from past events that tell us the likely impact of various TMIs, by ingesting historical data, properly trained ML models can offer valuable insights and aid human decision-making. With the FAA increasingly exploring advanced analytics, ML emerges as a focal point for enhancing TFM within the National Airspace System (NAS). As a first step, this study aims to provide traffic controllers with decision-making support for the issuance and adjustment of TMIs. Data analytics and machine learning have been previously employed to address some of the challenges associated with TMIs. Numerous studies have concentrated on various facets of TMI issuance, exploring factors influencing TMI parameters, including arrival rate, airport capacity, and delay prediction. For example, using weather forecasts, several statistical methods were used to produce probabilistic capacity profiles which in conjunction with deterministic models provided insights into the GDP planning process [1–4]. The downside of using deterministic models is that they rely on fixed inputs and predetermined rules, which lack the ability to account for the inherent uncertainty and variability present in real-world scenarios. In a separate series of studies, researchers aimed to predict the occurrences of GDPs and GSs. The majority of these studies utilized various supervised learning methods, including Decision Trees, Naive Bayes, Support VectorMachines, and Random Forests to analyze the influence of weather conditions and arrival demand on TMI incidents[5–8]. However, these studies primarily focused on predicting the incidence of TMIs without explicitly addressing the scope of TMIs, including their duration and their geographical coverage. Furthermore, the emphasis of these studies was largely on GDPs, given their higher frequency and longer duration when compared to GSs. A limited number of studies focused on predicting the parameters of TMIs, specifically addressing their duration and extent. In one such study focusing on optimizing the TMI parameters at San Francisco International Airport (SFO),the authors utilized a probabilistic forecast of fog [9]. They simulated various capacity scenarios based on the (fog)burn-off forecasts, selecting GDP parameters that minimized airborne and overall ground delays. However, this approach exclusively emphasizes stratus (fog) burn-off as the primary determinant of GDP and GS, neglecting other influential factors like severe weather events, runway closures, lower capacity than traffic demand, and other important variables. Given the complexity of predicting the TMI and determining its scope, we seek a more holistic approach. We aim to consider all significant factors that could impact TMIs and their parameters. What sets this research apart is the fusion of all data sources relevant to the issuance and adjustment of TMIs and it represents the first comprehensive attempt to optimize TMIs in this manner. Since this comprehensive solution involves various aspects, we break down the problem into smaller components and input all parameters into a unified model called the “TMI Adjuster”. Figure 1 shows the overall framework and the list of datasets used in each model. The objective of the TMI Adjuster module is to deliver reliable, consistent and expedited recommendations for the progression, adjustment, and termination of TMIs. The ML solution entails developing a pipeline capable of predicting the necessity of a TMI (e.g., GS or GDP) along with its various parameters. For example, in the case of a GS, this includes the scope of the GS either in terms of distance from the destination airport or based on pre-defined airspace sectors. Here, scope refers to those regions and departing airports that are subject to the GS. In this paper, we concentrate on the issuance of GSs in the three major airports in the New York area — LaGuardia(LGA), John F. Kennedy International (JFK), and Newark Liberty International (EWR). We fuse traffic, weather and other relevant aviation data from years 2017 to 2019 to train and validate the ML models. In particular, we use the following datasets: •Terminal Aerodrome Forecast (TAF): meteorological forecasts specific to each airport, issued four times a day, covering predefined time periods. •TMI data: includes all GSs and GDPs along with their respective parameters. •Aviation System Performance Metrics (ASPM): includes traffic related data such as aircraft delays, arrival, and departure rates. •Notices to Airmen (NOTAMs): utilized to extract runway closure data and manage interdependencies between terminals in close proximity. •Flight cancellation data •Airspace Flow Programs (AFP): includes information on flight airborne holdings caused by TMIs. The data preprocessing entails transforming ASPM, TMI, AFP, NOTAMs, and weather data into an hourly format and consolidating all datasets by merging them based on date and time as the primary key. The TMI Adjuster framework comprises two parallel models: one dedicated to GS and a second model focused on GDP. As previously mentioned, our specific focus is on the GS model as a multi-classification problem. In this framework, each data point of the GS model input summarizes ten hours of data. Specifically, the data loader for the GS model generates the input and output of the model as follows: at a given time step, the input includes the actual traffic, weather, and TMI data from the two-hour window before the time step, alongside the weather forecast and scheduled traffic for the next 8 hours starting from the time step. Based on this information, the output of the GS model for each time interval consists of three dimensions. The first dimension represents a binary decision on whether there should be a GS in place for the next hour or not. The second dimension is related to the scope of the GS in the United States, and the third dimension is related to the scope of the GS in Canada (i.e., to determine if the GS impacts airports in Canada).One of the challenges with TMI modeling is the sparsity of TMI events, particularly regarding its scope. To address this challenge in the scope of the GS model output, we implement grouping. The GS scope for the US region is defined based on a list of centers that should be included when the GS is in place. With 20 centers in the US, we utilized historical data to group them into 4 categories. In particular, we summarized our historical data in a graph format where nodes represent centers, and link weights are defined based on the co-occurrence of centers in the scope parameter ofTMIs. By identified strongly connected components in this graph, we were able to partition the centers into four groups. We consider two model structures for the GS Model. Firstly, a hierarchical classification model [10], where the human decision-making for a GS is of hierarchical nature. The decision-maker first decides whether there is a need fora GS, and if the answer is yes, determines the scope. A hierarchical classification model organizes the problem into a class hierarchy, typically a tree or a Directed Acyclic Graph (DAG) structure, and considers the dependency of the decision in the previous step to the next component [10]. Here, we employ the local classifier per level approach, which involves training one multi-class classifier for each level of the class hierarchy. The second structure is the independent structure. In this setting, as the name suggests, we do not consider the dependency of the decisions in the different dimensions of the output of the model. Instead, for each dimension, we train a multi-class classifier independently. Table 1 summarizes GS model statistics for training, validation and testing. The table documents the effect of limiting data to the time steps when there was actually a TMI in place or when a TMI had just terminated. This resulted in a more balanced distribution of the GS class(GS positive class)versus “No GS”(GS negative class), which might help the training process. While JFK and LGA follow very similar distributions, with 40% and 42% GS positive class respectively, EWR has proportionally fewer GS incidents at 28%. Our subsequent phase involves evaluating the performance of both hierarchical structure and independent structure using different state-of-the-art multi-class classifier models such as Random Forest, Decision Trees, K-nearest Neighbors, and Logistic Regression and forecast the duration and scope of the GSs.

Farzan Masrour Shalmani↗

Study of solid rocket motors for a space shuttle booster. Appendix D: Recovery and reuse 156-inch diameter solid rocket motor booster

The baseline for a space shuttle configuration utilizing two parallel-burn, 156-in.-diameter SRMs with three segments and techroll seal movable nozzles is presented. The concept and general economic benefits of SRM recovery are equally valid for the series-burn SRMs, provided that those SRMs are also designed for the same strength, stiffness, segmentation, and interchangeability as the present design, and that those SRMs are also recovered as individual units. Feasibility studies were initiated to investigate SRM recoverability. These studies were based upon recovery of the SRM boosters for the Titan 3C. Ground rules precluded SRM modification that required significant changes in motor qualification or schedule. Even with this restriction, the study determined that the recoverable booster concept was completely feasible, both technically and economically. Parachute recovery has been selected as the best method, principally because it can accomplish the task with a minimum development cost and time to achieve operational recovery status. This system affords the highest probability for achieving large cost reductions.

Source record↗

Capillary Pumped Loop 3 Flight Experiment Overview

The Capillary Pumped Loop 3 (CAPL 3) Experiment is a follow on to the CAPL 1 and CAPL 2 experiments which flew on STS-60 (2/94) and STS-69 (9/95), respectively. CAPL 3 is tentatively scheduled to fly on the Space Shuttle in late 2000 as part of the Hitchhiker Experiments Advancing Technology (HEAT) payload. The experiment is a joint Naval Research Laboratory (NRL)/Goddard Space Flight Center (GSFC) payload which will meet technology objectives for both the Department of Defense and NASA. The primary objective of CAPL 3 is to demonstrate in space a multiple evaporator capillary pumped loop system, capable of reliable start-up, reliable continuous operation, and at least 50% heat load sharing with hardware for a deployable radiator. CAPL 3 is a full scale CPL system with four parallel capillary evaporators. The loop also contains a capillary starter pump, 8 parallel direct condensation condensers with associated flow regulators, a back pressure regulator, a two-phase reservoir, and various headers and transport tubing. A variable conductance heat pipe is located between one of the evaporators and the experiment radiator to provide a cooling source for the demonstration of heat load sharing. The experiment has an operating power range of 100 W to approximately 1400 W. The experiment ammonia charge will cause it to transition to a fixed conductance mode of operation if the radiator usage reaches 85%. Ambient functional tests have been performed on the experiment. Tests performed included start-up, low power, power cycles, high power, heat load sharing, variable/fixed conductance transition, saturation temperature changes, and pressure primes while the system was operating. The majority of the testing was performed at an ammonia saturation temperature of 30C, but a few tests were done at temperatures above and below this. The testing was highly successful. Details of the tests performed and a discussion of the results will be given in the presentation.

Ottenstein, Laura↗

Characterization of robotics parallel algorithms and mapping onto a reconfigurable SIMD machine

The kinematics, dynamics, Jacobian, and their corresponding inverse computations are six essential problems in the control of robot manipulators. Efficient parallel algorithms for these computations are discussed and analyzed. Their characteristics are identified and a scheme on the mapping of these algorithms to a reconfigurable parallel architecture is presented. Based on the characteristics including type of parallelism, degree of parallelism, uniformity of the operations, fundamental operations, data dependencies, and communication requirement, it is shown that most of the algorithms for robotic computations possess highly regular properties and some common structures, especially the linear recursive structure. Moreover, they are well-suited to be implemented on a single-instruction-stream multiple-data-stream (SIMD) computer with reconfigurable interconnection network. The model of a reconfigurable dual network SIMD machine with internal direct feedback is introduced. A systematic procedure internal direct feedback is introduced. A systematic procedure to map these computations to the proposed machine is presented. A new scheduling problem for SIMD machines is investigated and a heuristic algorithm, called neighborhood scheduling, that reorders the processing sequence of subtasks to reduce the communication time is described. Mapping results of a benchmark algorithm are illustrated and discussed.

Lee, C. S. G.↗

Commanding Curiosity from the Couch: MSL Remote Operations, Challenges, and Path Ahead

This paper describes how the Mars ScienceLaboratory (MSL) project prepared for and successfully beganCuriosity rover Mars operations from their homes in responseto the COVID-19 work-from-home orders. In a very shortperiod, the team developed procedures and executed a remoteoperations readiness test in parallel with the team's support fornominal operations. Continuing regular rover operations withan entirely remote team had not previously been consideredfeasible due to a variety of factors. These included both thehuman factors, such as multiple concurrent person-to-personinteractions of the uplink planning team, as well as technicalfactors, such as reliance on powerful workstations dedicated tographically intensive software tools used for planning. The testwas conducted on March 12th, with both the downlink anduplink teams successfully simulating a near full planning day.The JPL administration announced the transition to mandatorytelework on Monday, March 16th. MSL stood down the uplinkplanning originally scheduled for the next day while downlinkcontinued monitoring the rover. Full operations then resumedper schedule with nearly the entire operations team teleworkingon Friday, March 20th, during which the team planned roveractivities for three Martian days (sols). These activities includedthe successful drilling of the "Edinburgh" rock target, a highlycomplex contact science activity.As of October 1st, 2020, the Mars Science Laboratory missionoperations team has conducted 88 remote tactical uplink shiftsfor a total of 190 sols of planned rover activity, which accountsfor more than 6% of the mission to date. In this period the roverhas completed four drilling campaigns and driven over 1150meters towards its next major science target – a sulfate bearinggeologic unit at the foot of Mount Sharp. Success has not beenwithout its challenges. Many of these have been addressed whileothers will remain in some form until the team can safely returnto JPL, which in turn is the largest challenge for the future.

Stroupe, Ashley↗

NASA Bioculture System: From Experiment Definition to Flight Payload

Starting in 2015, the NASA Bioculture System will be available to the science community to conduct cell biology and microbiology experiments on ISS. The Bioculture System carries ten environmentally independent Cassettes, which house the experiments. The closed loop fluids flow path subsystem in each Cassette provides a perfusion-based method for maintain specimen cultures in a shear-free environment by using a biochamber based on porous hollow fiber bioreactor technology. Each Cassette contains an incubator and separate insulated refrigerator compartment for storage of media, samples, nutrients and additives. The hardware is capable of fully automated or manual specimen culturing and processing, including in-flight experiment initiation, sampling and fixation, up to BSL-2 specimen culturing, and the ability to up to 10 independent cultures in parallel for statistical analysis. The incubation and culturing of specimens in the Bioculture System is a departure from standard laboratory culturing methods. Therefore, it is critical that the PI has an understanding the pre-flight test required for successfully using the Bioculture System to conduct an on-orbit experiment. Overall, the PI will conduct a series of ground tests to define flight experiment and on-orbit implementation requirements, verify biocompatibility, and determine base bioreactor conditions. The ground test processes for the utilization of the Bioculture System, from experiment selection to flight, will be reviewed. Also, pre-flight test schedules and use of COTS ground test equipment (CellMax and FiberCell systems) and the Bioculture System will be discussed.

Bioculture System↗

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗

Flying Schedule-Matching Descents to Explore Flight Crews' Perceptions of Their Load and Task Feasibility

Multiple studies have investigated the development and use of ground-based (controller) tools to manage and schedule traffic in future terminal airspace. No studies have investigated the impacts that such tools (and concepts) could have on the flight-deck. To begin to redress the balance, an exploratory study investigated the procedures and actions of ten Boeing-747-400 crews as they flew eight continuous descent approaches in the Los Angeles terminal airspace, with the descents being controlled using speed alone. Although the study was exploratory in nature, four variables were manipulated: speed changes, route constraints, clearance phraseology, and winds. Despite flying the same scenarios with the same events and timing, there was at least a 50 second difference in the time it took crews to fly the approaches. This variation is the product of a number of factors but highlights potential difficulties for scheduling tools that would have to accommodate this amount of natural variation in descent times. The primary focus of this paper is the potential impact of ground scheduling tools on the flight crews performance and procedures. Crews reported "moderate to low" workload, on average; however, short periods of intense and high workload were observed. The non-flying pilot often reported a higher level of workload than the flying-pilot, which may be due to their increased interaction with the Flight Management Computer, when using the aircraft automation to assist with managing the descent clearances. It is concluded that ground-side tools and automation may have a larger impact on the current-day flight-deck than was assumed and that studies investigating this impact should continue in parallel with controller support tool development.

Martin, Lynne Hazel↗

Accurate modeling of parallel scientific computations

Scientific codes are usually parallelized by partitioning a grid among processors. To achieve top performance it is necessary to partition the grid so as to balance workload and minimize communication/synchronization costs. This problem is particularly acute when the grid is irregular, changes over the course of the computation, and is not known until load time. Critical mapping and remapping decisions rest on the ability to accurately predict performance, given a description of a grid and its partition. This paper discusses one approach to this problem, and illustrates its use on a one-dimensional fluids code. The models constructed are shown to be accurate, and are used to find optimal remapping schedules.

Nicol, David M.↗

A Cognitive System Model for Human/Automation Dynamics in Airspace Management

NASA has initiated a significant thrust of research and development focused on providing the flight crew and air traffic managers automation aids to increase capacity in en route and terminal area operations through the use of flexible, more fuel-efficient routing, while improving the level of safety in commercial carrier operations. In that system development, definition of cognitive requirements for integrated multi-operator dynamic aiding systems is fundamental. In order to support that cognitive function definition, we have extended the Man Machine Integrated Design and Analysis System (MIDAS) to include representation of multiple cognitive agents (both human operators and intelligent aiding systems) operating aircraft, airline operations centers and air traffic control centers in the evolving airspace. The demands of this application require representation of many intelligent agents sharing world-models, and coordinating action/intention with cooperative scheduling of goals and actions in a potentially unpredictable world of operations. The MIDAS operator models have undergone significant development in order to understand the requirements for operator aiding and the impact of that aiding in the complex nondeterminate system of national airspace operations. The operator model's structure has been modified to include attention functions, action priority, and situation assessment. The cognitive function model has been expanded to include working memory operations including retrieval from long-term store, interference, visual-motor and verbal articulatory loop functions, and time-based losses. The operator's activity structures have been developed to include prioritization and interruption of multiple parallel activities among multiple operators, to provide for anticipation (knowledge of the intention and action of remote operators), and to respond to failures of the system and other operators in the system in situation-specific paradigms. The model's internal representation has been be modified so that multiple, autonomous sets of equipment will function in a scenario as the single equipment sets do now. In order to support the analysis requirements with multiple items of equipment, it is necessary for equipment to access the state of other equipment objects at initialization time (a radar object may need to access the position and speed of aircraft in its area, for example), and as a function of perception and sensor system interaction. The model has been improved to include multiple world-states as a function of equipment am operator interaction. The model has been used -1o predict the impact of warning and alert zones in aircraft operation, and, more critic-ally, the interaction of flight-deck based warning mechanisms and air traffic controller action in response to ground-based conflict prediction and alerting systems. In this operation, two operating systems provide alerting to two autonomous, but linked sets of operators, whose view of the system and whose dynamics in response are radically different. System stability and operator action was predicted using the MIDAS model.

Corker, Kevin M.↗

Improved Characterization of PSC Processes Derived from a Third-Generation CALIOP and MLS Detection and Composition Classification Algorithm

The new 3-year CloudSat and CALIPSO Science Team project described in this poster will use a unique combination of data from the Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) instrument on CALIPSO and the Microwave Limb Sounder (MLS) on Aura, in conjunction with supporting meteorological information and detailed modeling studies, to advance our understanding of polar stratospheric cloud (PSC) processes and their role in ozone depletion. We will develop a third-generation (Gen3) PSC detection and composition algorithm that incorporates a new, more robust two-dimensional, multi-channel CALIOP feature detection scheme (2D-McDA). We will also devise and implement an improved two-dimensional PSC composition classification scheme that utilizes multiple parameters (e.g., CALIOP 532-nm parallel and perpendicular scattering ratios, CALIOP 1064-nm total scattering ratio, MLS HNO3 and H2O, ambient temperature, and temperature histories) in a Bayesian approach to determine the most likely PSC composition and help constrain solid PSC particle number density and size/shape. The combined CALIOP/MLS analyses will allow us to study in detail the full life cycle of PSCs and their resulting impact on gas-phase HNO3 and H2O, which should lead to improved parameterizations of PSC microphysics in global CCMs where detailed particle information is not available. The Gen3 CALIOP PSC algorithm will be a natural stepping-stone toward the analysis of data collected during future spaceborne lidar missions, such as NASA’s Atmosphere Observation System (AtmOS) mission currently scheduled for launch late in this decade. We will also investigate possible trends in PSC occurrence and composition over the entire CALIOP data record and through further comparisons with the Stratospheric Aerosol Measurement (SAM) II solar occultation PSC record from 1979-1989. Finally, we will validate the mountain-wave parameterization and PSC schemes used in the UM-UKCA (Unified Model coupled to the United Kingdom Chemistry and Aerosol module) chemistry-climate model through detailed comparisons with earlier CALIOP PSC data products and those developed under this proposal.

CALIPSO↗

Improved Characterization of PSC Processes Derived from a Third-Generation CALIOP and MLS Detection and Composition Classification Algorithm

The new 3-year CloudSat and CALIPSO Science Team project described in this poster will use a unique combination of data from the Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) instrument on CALIPSO and the Microwave Limb Sounder (MLS) on Aura, in conjunction with supporting meteorological information and detailed modeling studies, to advance our understanding of polar stratospheric cloud (PSC) processes and their role in ozone depletion. We will develop a third-generation (Gen3) PSC detection and composition algorithm that incorporates a new, more robust two-dimensional, multi-channel CALIOP feature detection scheme (2D-McDA). We will also devise and implement an improved two-dimensional PSC composition classification scheme that utilizes multiple parameters (e.g., CALIOP 532-nm parallel and perpendicular scattering ratios, CALIOP 1064-nm total scattering ratio, MLS HNO3 and H2O, ambient temperature, and temperature histories) in a Bayesian approach to determine the most likely PSC composition and help constrain solid PSC particle number density and size/shape. The combined CALIOP/MLS analyses will allow us to study in detail the full life cycle of PSCs and their resulting impact on gas-phase HNO3 and H2O, which should lead to improved parameterizations of PSC microphysics in global chemistry-climate models (CCMs) where detailed particle information is not available. The Gen3 CALIOP PSC algorithm will be a natural stepping-stone toward the analysis of data collected during future spaceborne lidar missions, such as NASA’s Atmosphere Observation System (AOS) mission currently scheduled for launch late in this decade. We will also investigate possible trends in PSC occurrence and composition over the entire CALIOP data record and through further comparisons with the Stratospheric Aerosol Measurement (SAM) II solar occultation PSC record from 1979-1989. Finally, we will validate the mountain-wave parameterization and PSC schemes used in the UM-UKCA (Unified Model coupled to the United Kingdom Chemistry and Aerosol module) CCM through detailed comparisons with earlier CALIOP PSC data products and those developed under this proposal.

CALIPSO↗

Kinematic Modeling of Separation Compression for Paired Approaches to Closely-Spaced Parallel Runways

In a simultaneous paired approach to closely-spaced parallel runways, a pair of aircraft flies in close proximity on parallel approach paths. The longitudinal separation between the aircraft must be maintained within a range that avoids wake encounters and, if one of the aircraft blunders, avoids collision. To increase operational availability, the approach procedure must accommodate a mixture of aircraft sizes and, consequently, approach speeds. In these procedures, the slower aircraft is placed in the lead position. The faster aircraft maintains separation from the slow aircraft in a dependent operation until final approach and flies independently afterward. Due to the higher approach speed of the fast aircraft, longitudinal separation will decrease during final approach. Therefore, the fast aircraft must position itself before the final approach so that it will remain within the safe range of separation as separation decreases. Given the approach geometry and speed schedule for each aircraft, one can use kinematics to estimate the separation loss between a pair of aircraft. A kinematic model can complement fast-time Monte-Carlo simulations of the approach by enabling a tailored reduction in the variation of starting position for the fast aircraft. One could also implement the kinematic model in ground-based or on-board decision support tools to compute the optimal initial separation for a given pair of aircraft. To better match the auto-coupled flight of real aircraft, the paper derives a kinematic model where the speed schedule is flown using equivalent airspeed. The predicted time of flight using the equivalent airspeed kinematic model compares well against a high-fidelity aircraft simulation performing the same approach. This model also demonstrates a modest increase in the predicted loss of separation when contrasted against a kinematic model that assumes the scheduled speed is true airspeed.

Madden, Michael M.↗

Human Systems Integration in Practice: Constellation Lessons Learned

NASA's Constellation program provided a unique testbed for Human Systems Integration (HSI) as a fundamental element of the Systems Engineering process. Constellation was the first major program to have HSI mandated by NASA's Human Rating document. Proper HSI is critical to the success of any project that relies on humans to function as operators, maintainers, or controllers of a system. HSI improves mission, system and human performance, significantly reduces lifecycle costs, lowers risk and minimizes re-design. Successful HSI begins with sufficient project schedule dedicated to the generation of human systems requirements, but is by no means solely a requirements management process. A top-down systems engineering process that recognizes throughout the organization, human factors as a technical discipline equal to traditional engineering disciplines with authority for the overall system. This partners with a bottoms-up mechanism for human-centered design and technical issue resolution. The Constellation Human Systems Integration Group (HSIG) was a part of the Systems Engineering and Integration (SE&I) organization within the program office, and existed alongside similar groups such as Flight Performance, Environments & Constraints, and Integrated Loads, Structures and Mechanisms. While the HSIG successfully managed, via influence leadership, a down-and-in Community of Practice to facilitate technical integration and issue resolution, it lacked parallel top-down authority to drive integrated design. This presentation will discuss how HSI was applied to Constellation, the lessons learned and best practices it revealed, and recommendations to future NASA program and project managers. This presentation will discuss how Human Systems Integration (HSI) was applied to NASA's Constellation program, the lessons learned and best practices it revealed, and recommendations to future NASA program and project managers on how to accomplish this critical function.

Zumbado, Jennifer Rochlis↗

BIRCHES and Lunarcubes: Building the First Deep Space Cubesat Broadband IR Spectrometer

The Broadband InfraRed Compact High-resolution Exploration Spectrometer (BIRCHES), which will be described in detail here, is the compact broadband IR spectrometer of the Lunar Ice Cube mission. Lunar Ice Cube is one of 13 6U cubesats that will be deployed by EM1 in cislunar space, qualifying as lunarcubes. The LunarCube paradigm is a proposed approach for extending the affordable CubeSat standard to support access to deep space via cis-lunar/lunar missions. Because the lunar environment contains analogs of most solar system environments, the Moon is an ideal target for both testing critical deep space capabilities and understanding solar system formation and processes. Effectively, as developments are occurring in parallel, 13 prototype deep space cubesats are being flown for EM1. One useful outcome of this ‘experiment’ will be to determine to what extent it is possible to develop a lunarcube ‘bus’ with standardized interfaces to all subsystems using reasonable protocols for a variety of payloads. The lunar ice cube mission was developed as the test case in a GSFC R&D study to determine whether the cubesat paradigm could be applied to deep space, science requirements driven missions, and BIRCHES was its payload. Here, we present the design and describe the ongoing development, and testing, in the context of the challenges of using the cubesat paradigm to fly a broadband IR spectrometer in a 6U platform, including minimal funding and extensive need for leveraging existing assets and relationships on development, the foreshortened schedule for payload delivery on testing, and minimum bandwidth translating into simplified or canned operation.

Chapin, Peter↗

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↗