Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimal 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 397 records · Page 22

Global Simulation of Aviation Operations

The simulation and analysis of global air traffic is limited due to a lack of simulation tools and the difficulty in accessing data sources. This paper provides a global simulation of aviation operations combining flight plans and real air traffic data with historical commercial city-pair aircraft type and schedule data and global atmospheric data. The resulting capability extends the simulation and optimization functions of NASA's Future Air Traffic Management Concept Evaluation Tool (FACET) to global scale. This new capability is used to present results on the evolution of global air traffic patterns from a concentration of traffic inside US, Europe and across the Atlantic Ocean to a more diverse traffic pattern across the globe with accelerated growth in Asia, Australia, Africa and South America. The simulation analyzes seasonal variation in the long-haul wind-optimal traffic patterns in six major regions of the world and provides potential time-savings of wind-optimal routes compared with either great circle routes or current flight-plans if available.

simulation↗

Genetic algorithms applied to the scheduling of the Hubble Space Telescope

A prototype system employing a genetic algorithm (GA) has been developed to support the scheduling of the Hubble Space Telescope. A non-standard knowledge structure is used and appropriate genetic operators have been created. Several different crossover styles (random point selection, evolving points, and smart point selection) are tested and the best GA is compared with a neural network (NN) based optimizer. The smart crossover operator produces the best results and the GA system is able to evolve complete schedules using it. The GA is not as time-efficient as the NN system and the NN solutions tend to be better.

Sponsler, Jeffrey L.↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

Optimal Estimation-Based Algorithm to Retrieve Aerosol Optical Properties for GEMS Measurements Over Asia

The Geostationary Environment Monitoring Spectrometer (GEMS) is scheduled to be in orbit in 2019 onboard the GEO-KOMPSAT 2B satellite and will continuously monitor air quality over Asia. The GEMS will make measurements in the UV spectrum (300-500 nm) with 0.6 nm resolution. In this study, an algorithm is developed to retrieve aerosol optical properties from UV-visible measurements for the future satellite instrument and is tested using 3 years of existing OMI L1B data. This algorithm provides aerosol optical depth (AOD), single scattering albedo (SSA) and aerosol layer height (ALH) using an optimized estimation method. The retrieved AOD shows good correlation with Aerosol Robotic Network (AERONET) AOD with correlation coefficients of 0.83, 0.73 and 0.80 for heavy-absorbing fine (HAF) particles, dust and non-absorbing (NA) particles, respectively. However, regression tests indicate underestimation and overestimation of HAF and NA AOD, respectively. In comparison with AOD from the OMI/Aura Near-UV Aerosol Optical Depth and Single Scattering Albedo 1-orbit L2 Swath 13 km x 24 km V003 (OMAERUV) algorithm, the retrieved AOD has a correlation coefficient of 0.86 and linear regression equation, AOD(sub GEMS) = 1.18AOD(sub OMAERUV) + 0.09. An uncertainty test based on a reference method, which estimates retrieval error by applying the algorithm to simulated radiance data, revealed that assumptions in the spectral dependency of aerosol absorptivity in the UV cause significant errors in aerosol property retrieval, particularly the SSA retrieval. Consequently, retrieved SSAs did not show good correlation with AERONET values. The ALH results were qualitatively compared with the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) products and were found to be well correlated for highly absorbing aerosols. The difference between the attenuated-backscatter-weighted height from CALIOP and retrieved ALH were mostly closed to zero when the retrieved AOD is higher than 0.8 and SSA is lower than 0.93. Although retrieval accuracy was not significantly improved, the simultaneous consistent retrieval of AOD, SSA and ALH alone demonstrates the value of this stand-alone algorithm, given their nature for error using other methods. The use of these properties as input parameters for the air mass factor calculation is expected to improve the retrieval of other trace gases over Asia.

Geostationary Environment Monitoring Spectrometer ↗

Mars Sample Return (MSR) Sample Receiving Facility (SRF) Assessment Study (MSAS)

NASA, in partnership with the European Space Agency (ESA), is seeking to return Martian geological and atmospheric samples to Earth for scientific study in the early 2030s. Due to the possibility that the samples could contain extraterrestrial life, Mars Sample Return (MSR) is classified as a Category V: Restricted Earth Return mission by the NASA Planetary Protection Office. As a result of this classification, a MSR Sample Receiving Facility (SRF) must not only provide a pristine environment to ensure samples are protected from terrestrial contamination for scientific investigations, it must also provide high-containment (biosafety level 4 [BSL-4]-equivalence) to isolate the samples from Earth’s biosphere until the samples are deemed safe for release and/or sterilized. The nominal utilization period for a SRF is anticipated to be 2-5 years and is intended to enable curation activities, biohazard assessment, select early science activities, and the rapid release of samples to the scientific community. However, to account for possible delays in schedule or the identification of extant life, this anticipated period of time must be flexible to accommodate schedule extensions and contingency plans. Due to requirements for high-level biological containment and cleanliness, a traditional receiving/curation facility cannot be utilized for MSR. Therefore, beginning in 2022, NASA Johnson Space Center is performing a MSR SRF Assessment Study (MSAS) to investigate the most optimal facility modality for a MSR SRF, as well as start to define programmatic early estimate of costs and schedules before the initial design phase begins. NASA is partnering with industry contractors (architectural and engineering firms with BSL-4 and cleanroom technology experience, as well as other contracted infrastructure and construction specialists) along with selected experts from NASA, ESA, existing U.S. BSL-4 facilities, and other U.S. government agencies, to carry out the assessment study. The MSAS should also aid in the future refinement of the science requirements (e.g., contamination control, equipment accommodations) before site-specific design would commence. As part of the MSAS, NASA is planning to assess an array of possibilities for a MSR SRF. One of the main considerations is the facility modality and whether an existing BSL-4 facility can be utilized (for some or all functions); or, if new constructure would be required, would a traditional fixed facility or a modular facility the best choice. MSAS will also investigate the ability of the modalities to accommodate two different facility capability endmembers: 1) a minimal facility focusing on biohazard assessment and curation tasks with a small footprint, and 2) an enhanced facility with additional capabilities to enable expedited processing and the completion of time-sensitive and (some) sterilization-sensitive science. The assessment is intended to generate information that will inform the selection of facility modalities for high-level conceptual design development. While the assessment study will focus on SRF requirements for accommodating curation, science, and sample safety assessment infrastructure, it will also consider an array of other factors, such as ease of access for international users, decommissioning, repurposing, future sale or lease following MSR’s use of the facility, and uncontained preparatory laboratory spaces. Upon completion of the study, the preferred modality and refined requirements would be utilized for site-specific design but will not be finalized until NASA’s completion of the National Environmental Policy Act (NEPA) process.

A.D. Harrington↗

Thermal Optimization of an On-Orbit Long Duration Cryogenic Propellant Depot

A Cryogenic Propellant Depot (CPD) operating in Low Earth Orbit (LEO) could provide many near term benefits to NASA's space exploration efforts. These benefits include elongation/extension of spacecraft missions and requirement reduction of launch vehicle up-mass. Some of the challenges include controlling cryogenic propellant evaporation and managing the high costs and long schedules associated with the new development of spacecraft hardware. This paper describes a conceptual CPD design that is thermally optimized to achieve extremely low propellant boil-off rates. The CPD design is based on existing launch vehicle architecture, and its thermal optimization is achieved using current passive thermal control technology. Results from an integrated thermal model are presented showing that this conceptual CPD design can achieve propellant boil-off rates well under 0.05% per day, even when subjected to the LEO thermal environment.

Honour, Ryan↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Uncertainty management by relaxation of conflicting constraints in production process scheduling

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Dorn, Juergen↗

A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft

The New Millennium Remote Agent (NMRA) will be the first AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic recoveries and robust concurrent execution, all in the presence of tight real-time deadlines, changing goals, scarce resource constraints, and a wide variety of possible failures. To achieve this level of execution robustness, we have integrated a procedural executive based on generic procedures with a deductive model-based executive. A procedural executive provides sophisticated control constructs such as loops, parallel activity, locks, and synchronization which are used for robust schedule execution, hierarchical task decomposition, and routine configuration management. A deductive executive provides algorithms for sophisticated state inference and optimal failure recover), planning. The integrated executive enables designers to code knowledge via a combination of procedures and declarative models, yielding a rich modeling capability suitable to the challenges of real spacecraft control. The interface between the two executives ensures both that recovery sequences are smoothly merged into high-level schedule execution and that a high degree of reactivity is retained to effectively handle additional failures during recovery.

Pell, Barney↗

Scheduling the NASA Deep Space Network with Deep Reinforcement Learning

With three complexes spread evenly across the Earth, NASA’s Deep Space Network (DSN) is the primary means of communications as well as a significant scientific instrument for dozens of active missions around the world. A rapidly rising number of spacecraft and increasingly complex scientific instruments with higher bandwidth requirements have resulted in demand that exceeds the network’s capacity across its 12 antennae. The existing DSN scheduling process operates on a rolling weekly basis and is time-consuming; for a given week, generation of the final baseline schedule of spacecraft tracking passes takes roughly 5 months from the initial requirements submission deadline, with several weeks of peer-to-peer negotiations in between. This paper proposes a deep reinforcement learning (RL) approach to generate candidate DSN schedules from mission requests and spacecraft ephemeris data with demonstrated capability to address real-world operational constraints. A deep RL agent is developed that takes mission requests for a given week as input, and interacts with a DSN scheduling environment to allocate tracks such that its reward signal is maximized. A comparison is made between an agent trained using Proximal Policy Optimization and its random, untrained counterpart. The results represent a proof-of-concept that, given a well-shaped reward signal, a deep RL agent can learn the complex heuristics used by experts to schedule the DSN. A trained agent can potentially be used to generate candidate schedules to bootstrap the scheduling process and thus reduce the turnaround cycle for DSN scheduling.

Wilson, Brian↗

Optimization of the space shuttle entry guidance lateral deadband, minimum bank angle logic

The lateral deadband and minimum bank angle schedule were studied. Results used by the analytic drag control entry guidance system are presented. Lateral deadband limits and configuration were investigated and possible changes in the minimum bank angle schedule to improve crossrange control and drag acceleration control for entry were examined. The study recommends a 12.5 deg lateral deadband to accommodate low dispersions of up to 23%.

Bump, P. B.↗

Optimal parallel algorithms for problems modeled by a family of intervals

A family of intervals on the real line provides a natural model for a vast number of scheduling and VLSI problems. Recently, a number of parallel algorithms to solve a variety of practical problems on such a family of intervals have been proposed in the literature. Computational tools are developed, and it is shown how they can be used for the purpose of devising cost-optimal parallel algorithms for a number of interval-related problems including finding a largest subset of pairwise nonoverlapping intervals, a minimum dominating subset of intervals, along with algorithms to compute the shortest path between a pair of intervals and, based on the shortest path, a parallel algorithm to find the center of the family of intervals. More precisely, with an arbitrary family of n intervals as input, all algorithms run in O(log n) time using O(n) processors in the EREW-PRAM model of computation.

Olariu, Stephan↗

Fatigue Management in Spaceflight Operations

Sleep loss and fatigue remain an issue for crewmembers working on the International Space Station, and the ground crews who support them. Schedule shifts on the ISS are required for conducting mission operations. These shifts lead to tasks being performed during the biological night, and sleep scheduled during the biological day, for flight crews and the ground teams who support them. Other stressors have been recognized as hindering sleep in space; these include workload, thinking about upcoming tasks, environmental factors, and inadequate day/night cues. It is unknown if and how other factors such as microgravity, carbon dioxide levels, or increased radiation, may also play a part. Efforts are underway to standardize and provide care for crewmembers, ground controllers and other support personnel. Through collaborations between research and operations, evidenced-based clinical practice guidelines are being developed to equip flight surgeons with the tools and processes needed for treating circadian desynchrony (and subsequent sleep loss) caused by jet lag and shift work. The proper implementation of countermeasures such as schedules, lighting protocols, and cognitive behavioral education can hasten phase shifting, enhance sleep and optimize performance. This panel will focus on Fatigue Management in Spaceflight Operations. Speakers will present on research-based recommendations and technologies aimed at mitigating sleep loss, circadian desynchronization and fatigue on-orbit. Gaps in current mitigations and future recommendations will also be discussed.

Whitmire, Alexandra↗

Intelligent Observation Strategies for Geosynchronous Remote Sensing for Natural Hazards

Geosynchronous satellites offer a unique perspective for monitoring environmental factors important to understanding natural hazards and supporting the disasters management life cycle, namely forecast, detection, response, recovery and mitigation. In the NASA decadal survey for Earth science, the GEO-CAPE mission was proposed to address coastal and air pollution events in geosynchronous orbit, complementing similar initiatives in Asia by the South Koreans and by ESA in Europe, thereby covering the northern hemisphere. In addition to analyzing the challenges of identifying instrument capabilities to meet the science requirements, and the implications of hosting the instrument payloads on commercial geosynchronous satellites, the GEO-CAPE mission design team conducted a short study to explore strategies to optimize the science return for the coastal imaging instrument. The study focused on intelligent scheduling strategies that took into account cloud avoidance techniques as well as onboard processing methods to reduce the data storage and transmission loads. This paper expands the findings of that study to address the use of intelligent scheduling techniques and near-real time data product acquisition of both the coastal water and air pollution events. The topics include the use of onboard processing to refine and execute schedules, to detect cloud contamination in observations, and to reduce data handling operations. Analysis of state of the art flight computing capabilities will be presented, along with an assessment of cloud detection algorithms and their performance characteristics. Tools developed to illustrate operational concepts will be described, including their applicability to environmental monitoring domains with an eye to the future. In the geostationary configuration, the payload becomes a networked thing with enough connectivity to exchange data seamlessly with users. This allows the full field of view to be sensed at very high rate under the control of ground infrastructure, resulting in improved efficiencies, accuracy and science benefits. Hence a remote sensing payload and its data may become one of millions of connected objects in the emerging Internet of Things (IoT), and be as easily accessible by a users smart phone as any other smart appliance.

Near Earth Asteroid Scout Solar Sail Engineering Development Unit Test Suite

The Near Earth Asteroid (NEA) Scout project is a 6U reconnaissance mission to investigate a near Earth asteroid utilizing an 86m(sub 2) solar sail as the primary propulsion system. This will be the largest solar sail NASA has launched to date. NEA Scout is currently manifested on the maiden voyage of the Space Launch System in 2018. In development of the solar sail subsystem, design challenges were identified and investigated for packaging within a 6U form factor and deployment in cis-lunar space. Analysis was able to capture understanding of thermal, stress, and dynamics of the stowed system as well as mature an integrated sail membrane model for deployed flight dynamics. Full scale system testing on the ground is the optimal way to demonstrate system robustness, repeatability, and overall performance on a compressed flight schedule. To physically test the system, the team developed a flight sized engineering development unit with design features as close to flight as possible. The test suite included ascent vent, random vibration, functional deployments, thermal vacuum, and full sail deployments. All of these tests contributed towards development of the final flight unit. This paper will address several of the design challenges and lessons learned from the NEA Scout solar sail subsystem engineering development unit. Testing on the component level all the way to the integrated subsystem level. From optical properties of the sail material to fold and spooling the single sail, the team has developed a robust deployment system for the solar sail. The team completed several deployments of the sail system in preparation for flight at half scale (4m) and full scale (6.8m): boom only, half scale sail deployment, and full scale sail deployment. This paper will also address expected and received test results from ascent vent, random vibration, and deployment tests.

Lockett, Tiffany Russell↗

Optimized Trajectory Correction Burn Placement for the NASA Artemis II Mission

The NASA Artemis II mission represents the first time humans plan to return to the lunar vicinity in over 50 years with a crew traveling to the Moon in the Orion spacecraft on a free return trajectory. This first crewed mission of the Artemis program will evaluate human-rated elements of Orion in preparation to sending astronauts to the lunar surface. The selected free-return cislunar trajectory profile that is reminiscent of the Apollo 8 mission that nominally requires no additional translational burns following the trans-lunar injection (TLI) burn. Due to crew activity, maneuver execution errors, navigation uncertainty, orbit insertion errors, disturbance accelerations, and other system limitations; periodic trajectory corrections burns are necessary to ensure proper entry interface (EI) conditions are satisfied for a safe return to Earth. Robust trajectory optimization techniques are utilized to determine the optimized placements for the Artemis II trajectory correction burns that accounts for the crew schedule, both the primary and backup navigation systems, targeting strategies and burn plan configurations, spacecraft venting, thruster selection, and the integrated GN&C performance.

Linear Covariance Analysis↗

Scheduling with genetic algorithms

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Fennel, Theron R.↗

Optimizing observing sequence design for periodic and non-periodic phenomena : a Bayesian approach

In this paper we report on our progress on addressing these issues. We have developed an approximate expression for the uniformity of phase coverage that can be used when scheduling to assess candidate sample times. We describe the results obtained using this estimator, and compare them with detailed simulations. We describe our progress and plans for integrating optimizing criteria for both periodic and non-periodic observations into a single observation sequence.

Bayesian↗