Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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 1,333 records · Page 74

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

Enabling New Operations Concepts for Lunar and Mars Exploration

The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the operations concept that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a job jar of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically, and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.

Jaap, John↗

Developing a Reduced 240-Bus WECC Dynamic Model for Frequency Response Study of High Renewable Integration

The ongoing changes in the generation resource mix, driven by the rapid adoption of inverter-based resources (IBR) as well as the early retirement of synchronous generators, are bringing new challenges to the planning and operation of bulk electric power systems. Consequently, there is an increasing need to understand, design, and quantify the reliability service provision from IBRs by performing integrated scheduling and dynamic simulations. However, test systems that have consistent scheduling and dynamic models rarely exist largely because of the decoupled nature of the two simulations on a synchronous generator-dominated system. This paper develops the dynamic model of a reduced Western Electricity Coordinating Council (WECC) system. In conjunction with the existing scheduling model, it is suitable for integrating scheduling and dynamic simulations. The reduced 240-bus WECC model reflects the generation resource mix of the Western Interconnection as of 2018. Moreover, the developed dynamic model is validated against field frequency events measured by FNET/GridEye and preserves the dominant inter-area oscillation mode in WECC.

dynamic simulation↗

Tools and Methods for Optimization of Nuclear Plant Outages

Refueling outages are one of the most challenging phases in a nuclear power plants (NPP) operating cycle. Refueling outages are extremely costly for a NPP due to the large amount of required resources and because of lost revenue due to plant being off the grid. Outage durations have steadily decreased across the industry over that last few decades primarily due to improved planning and coordination, but there are still many plants that struggle to meet the performance metrics accomplished by other utilities. Schedule resilience is one of the issues. NPP outages require scheduling thousands of activities in a duration of around 30 days on average. Outage staff begin working on the schedule more than a year ahead of the outage start and make every effort to build a robust schedule. Despite the robust and detailed planning, once the outage starts, numerous emergent issues typically appear along with schedule delays requiring continuous replanning and adjusting. When schedule disruption occurs during an outage, plant staff make urgent efforts to recover but often not able to maintain the planned outage duration. These outage delays can cost a utility several million dollars per day. Tools that could help outage schedulers create a more resilient schedule and allow them to optimally reschedule emergent work could significantly reduce outage delays. One key aspect of creating a resilient schedule is to have accurate estimates for activity duration. Another important outage scheduling capability is the ability to schedule emergent work with minimal disruption. The Optimization of Outage Activities project under the Risk-Informed Systems Analysis Pathway (RISA) sponsored by Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) program focuses on developing tools and methods to support nuclear power plants with optimization of outage schedules. The goal of the outage optimization is the completion of all planned and emergent outage activities as fast as possible while maintaining highest level of safety. This report describes the initial development of tools to support outage management that leverage computational and machine learning methods developed in other RISA and LWRS projects.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Contingency rescheduling of spacecraft operations

Spacecraft activity scheduling was a focus of attention in artificial intelligence recently. Several scheduling systems were devised which more-or-less successfully address various aspects of the activity scheduling problem, though most of these are not yet mature, with the notable expection of NASA's ESP. Few current scheduling systems, however, make any attempt to deal fully with the problem of modifying a schedule in near-real-time in the event of contingencies which may arise during schedule execution. These contingencies can include resources becoming unavailable unpredictably, a change in spacecraft conditions or environment, or the need to perform an activity not scheduled. In these cases it becomes necessary to repair an existing schedule, disrupting ongoing operations as little as possible. Normal scheduling is just a part of that which must be accomplished during contingency rescheduling. A prototype system named MAESTRO was developed for spacecraft activity scheduling. MAESTRO is briefly described with a focus on recent work in the area of real-time contingency handling. Included is a discussion of some of the complexities of the scheduling problem and how they affect contingency rescheduling, such as temporal constraints between activities, activities which may be interrupted and continued in any of several ways, and different ways to choose a resource complement which will allow continuation of an activity. Various heuristics used in MAESTRO for contingency rescheduling is discussed, as are operational concerns such as interaction of the scheduler with spacecraft subsystems controllers.

Britt, Daniel L.↗

Advanced timeline systems

The Mission Planning Division of the Mission Operations Laboratory at NASA's Marshall Space Flight Center is responsible for scheduling experiment activities for space missions controlled at MSFC. In order to draw statistically relevant conclusions, all experiments must be scheduled at least once and may have repeated performances during the mission. An experiment consists of a series of steps which, when performed, provide results pertinent to the experiment's functional objective. Since these experiments require a set of resources such as crew and power, the task of creating a timeline of experiment activities for the mission is one of resource constrained scheduling. For each experiment, a computer model with detailed information of the steps involved in running the experiment, including crew requirements, processing times, and resource requirements is created. These models are then loaded into the Experiment Scheduling Program (ESP) which attempts to create a schedule which satisfies all resource constraints. ESP uses a depth-first search technique to place each experiment into a time interval, and a scoring function to evaluate the schedule. The mission planners generate several schedules and choose one with a high value of the scoring function to send through the approval process. The process of approving a mission timeline can take several months. Each timeline must meet the requirements of the scientists, the crew, and various engineering departments as well as enforce all resource restrictions. No single objective is considered in creating a timeline. The experiment scheduling problem is: given a set of experiments, place each experiment along the mission timeline so that all resource requirements and temporal constraints are met and the timeline is acceptable to all who must approve it. Much work has been done on multicriteria decision making (MCDM). When there are two criteria, schedules which perform well with respect to one criterion will often perform poorly with respect to the other. One schedule dominates another if it performs strictly better on one criterion, and no worse on the other. Clearly, dominated schedules are undesireable. A nondominated schedule can be generated by some sort of optimization problem. Generally there are two approaches: the first is a hierarchical approach while the second requires optimizing a weighting or scoring function.

Bulfin, R. L.↗

Interleaved Observation Execution and Rescheduling on Earth Observing Systems

Observation scheduling for Earth orbiting satellites solves the following problem: given a set of requests for images of the Earth, a set of instruments for acquiring those images distributed on a collecting of orbiting satellites, and a set of temporal and resource constraints, generate a set of assignments of instruments and viewing times to those requests that satisfy those constraints. Observation scheduling is often construed as a constrained optimization problem with the objective of maximizing the overall utility of the science data acquired. The utility of an image is typically based on the intrinsic importance of acquiring it (for example, its importance in meeting a mission or science campaign objective) as well as the expected value of the data given current viewing conditions (for example, if the image is occluded by clouds, its value is usually diminished). Currently, science observation scheduling for Earth Observing Systems is done on the ground, for periods covering a day or more. Schedules are uplinked to the satellites and are executed rigorously. An alternative to this scenario is to do some of the decision-making about what images are to be acquired on-board. The principal argument for this capability is that the desirability of making an observation can change dynamically, because of changes in meteorological conditions (e.g. cloud cover), unforeseen events such as fires, floods, or volcanic eruptions, or un-expected changes in satellite or ground station capability. Furthermore, since satellites can only communicate with the ground between 5% to 10% of the time, it may be infeasible to make the desired changes to the schedule on the ground, and uplink the revisions in time for the on-board system to execute them. Examples of scenarios that motivate an on-board capability for revising schedules include the following. First, if a desired visual scene is completely obscured by clouds, then there is little point in taking it. In this case, satellite resources, such as power and storage space can be better utilized taking another image that is higher quality. Second, if an unexpected but important event occurs (such as a fire, flood, or volcanic eruption), there may be good reason to take images of it, instead of expending satellite resources on some of the lower priority scheduled observations. Finally, if there is unexpected loss of capability, it may be impossible to carry out the schedule of planned observations. For example, if a ground station goes down temporarily, a satellite may not be able to free up enough storage space to continue with the remaining schedule of observations. This paper describes an approach for interleaving execution of observation schedules with dynamic schedule revision based on changes to the expected utility of the acquired images. We describe the problem in detail, formulate an algorithm for interleaving schedule revision and execution, and discuss refinements to the algorithm based on the need for search efficiency. We summarize with a brief discussion of the tests performed on the system.

Khatib, Lina↗

Collaborative Resource Allocation

Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

Wang, Yeou-Fang↗

TPSAS-NF1676L-17243-DND

This presentation captures ERA Project's effort in using integrated cost-schedule-risk analysis tool, identifying and capturing explicit relationships between program funds, schedule, and discrete risks. The project team merged a myriad of cost and schedule data for timely, objective, uncertainty analysis of the ITD's budget and schedule. The project team conducted detailed schedule uncertainty analysis showing schedule activities and how their interrelationships were impacted, representing an impressive advance beyond routine Gantt charts. Furthermore, the ERA Project collected discrete risk events including their impacts to costs and/or schedule and interwove these risks into cost and schedule logic networks, providing the foundation to conduct cost and schedule analyses. The team integrated this data into the analysis model, providing probabilistic results that were then used by the ERA Project's senior management for decision-making purposes. The ERA Project management team, through technical and pathfinder expertise in integrating cost, schedule, risk, and technical content, consistently provided risk-informed recommendations to Implementing Centers and ISRP senior management which ultimately ensured the successful ARMD Key Decision Point (KDP) review of the ERA Phase 2 ITD Portfolio and increased the likelihood of achieving technical objectives within cost and schedule constraints.

Gaudy M Bezos-O'Connor↗

Video conferencing made easy

Network video conferencing is advancing rapidly throughout the nation, and the Idaho National Engineering Laboratory (INEL), a Department of Energy (DOE) facility, is at the forefront of the development. Engineers at INEL/EG&G designed and installed a very unique DOE videoconferencing system, offering many outstanding features, that include true multipoint conferencing, user-friendly design and operation with no full-time operators required, and the potential for cost effective expansion of the system. One area where INEL/EG&G engineers made a significant contribution to video conferencing was in the development of effective, user-friendly, end station driven scheduling software. A PC at each user site is used to schedule conferences via a windows package. This software interface provides information to the users concerning conference availability, scheduling, initiation, and termination. The menus are 'mouse' controlled. Once a conference is scheduled, a workstation at the hubs monitors the network to initiate all scheduled conferences. No active operator participation is required once a user schedules a conference through the local PC; the workstation automatically initiates and terminates the conference as scheduled. As each conference is scheduled, hard copy notification is also printed at each participating site. Video conferencing is the wave of the future. The use of these user-friendly systems will save millions in lost productivity and travel cost throughout the nation. The ease of operation and conference scheduling will play a key role on the extent industry uses this new technology. The INEL/EG&G has developed a prototype scheduling system for both commercial and federal government use.

Larsen, D. Gail↗

Evaluation of Crew-Centric Onboard Mission Operations Planning and Execution Tool: Year 2

Currently, mission planning for the International Space Station (ISS) is largely affected by ground operators in mission control. The task of creating a week-long mission plan for ISS crew takes dozens of people multiple days to complete, and is often created far in advance of its execution. As such, re-planning or adapting to changing real-time constraints or emergent issues is similarly taxing. As we design for future mission operations concepts to other planets or areas with limited connectivity to Earth, more of these ground-based tasks will need to be handled autonomously by the crew onboard.There is a need for a highly usable (including low training time) tool that enables efficient self-scheduling and execution within a single package. The ISS Program has identified Playbook as a potential option. It already has high crew acceptance as a plan viewer from previous analogs and can now support a crew self-scheduling assessment on ISS or on another mission. The goals of this work, a collaboration between the Human Research Program and the ISS Program, are to inform the design of systems for more autonomous crew operations and provide a platform for research on crew autonomy for future deep space missions. Our second year of the research effort have included new insights on the crew self-scheduling sessions performed by the crew through use on the HERA (Human Exploration Research Analog) and NEEMO (NASA Extreme Environment Mission Operations) analogs. Use on the NEEMO analog involved two self-scheduling strategies where the crew planned and executed two days of EVAs (Extra-Vehicular Activities). On HERA year two represented the first HERA campaign where we were able to perform research tasks. This involved selected flexible activities that the crew could schedule, mock timelines where the crew completed more complex planning exercises, usability evaluation of the crew self-scheduling features, and more insights into the limit of plan complexity that the crew could effectively self-schedule. In parallel we have added in new features and functionality in the Playbook tool based off of our insights from crew self-scheduling in the NASA analogs. In particular this year we have added in the ability for the crew to add, edit, and remove their own activities in the Playbook tool, expanding the type of planning and re-planning possible in the tool and opening up the ability for more free form plan creation. The ability to group and manipulate groups of activities from the plan task list was also added, allowing crew members to add predefined sets of activities onto their mission timeline. In addition we also added a way for crew members to roll back changes in their plan, in order to allow an undo like capability. These features expand and complement the initial self-scheduling features added in year one with the goal of making crew autonomous planning more efficient. As part of this work we have also finished developing the first version of our Playbook Data Analysis Tool, a research tool built to interpret and analyze the unobtrusively collected data obtained during the NASA analog missions through Playbook. This data which includes user click interaction as well as plan change information, through the Playbook Data Analysis Tool, allows us to playback this information as if a video camera was mounted over the crewmember's tablet. While the primary purpose of this tool is to allow usability analysis of crew self-scheduling sessions used on the NASA analog, since the data collected is structured, the tool can automatically derive metrics that would be traditionally tedious to achieve without manual analysis of video playback. We will demonstrate and discuss the ability for future derived metrics to be added to the tool. In addition to the current data and results gathered in year two we will also discuss the preparation and goals of our International Space Station (ISS) onboard technology demonstration with Playbook. This technology demonstration will be preformed as part of the CAST payload starting in late 2016.

onboard planning↗

Methods and Tools To Assess Robustness of Nuclear Plant Outages

Refueling outages are one of the most challenging phases in a nuclear power plant (NPP) operating cycle. Refueling outages are extremely costly for an NPP due to the large amount of required resources and because of lost revenue due to plant being off the grid. Outage durations have steadily decreased across the industry over that last few decades primarily due to improved planning and coordination, but there are still many plants that struggle to meet the performance metrics accomplished by other utilities. Schedule resilience is one of the issues. NPP outages require scheduling thousands of activities within 30 days on average. Despite detailed planning, once the outage starts, numerous emergent issues typically appear along with schedule delays requiring continuous replanning and adjustment. When schedule disruption occurs during an outage, plant staff make urgent efforts to recover but are often not able to maintain the planned outage duration. These outage delays can cost a utility several million dollars per day. Tools that could help outage schedulers create a more resilient schedule and allow them to optimally reschedule emergent work could significantly reduce outage delays. One key aspect of creating a resilient schedule is to have accurate estimates for activity duration. Another important outage scheduling capability is the ability to schedule emergent work with minimal disruption. This paper focuses on developing tools and methods to support NPPs with outage schedule optimization and it describes the initial development of tools to support outage management that leverage computational and machine learning methods.

97 - MATHEMATICS AND COMPUTING↗

Maximally Expressive Task Modeling

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiment activities for the Space Station. The equipment used in these experiments is some of the most complex hardware ever developed by mankind, the information sought by these experiments is at the cutting edge of scientific endeavor, and the procedures for executing the experiments are intricate and exacting. Scheduling is made more difficult by a scarcity of space station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling space station experiment operations calls for a "maximally expressive" modeling schema. Modeling even the simplest of activities cannot be automated; no sensor can be attached to a piece of equipment that can discern how to use that piece of equipment; no camera can quantify how to operate a piece of equipment. Modeling is a human enterprise-both an art and a science. The modeling schema should allow the models to flow from the keyboard of the user as easily as works of literature flowed from the pen of Shakespeare. The Ground Systems Department at the Marshall Space Flight Center has embarked on an effort to develop a new scheduling engine that is highlighted by a maximally expressive modeling schema. This schema, presented in this paper, is a synergy of technological advances and domain-specific innovations.

Japp, John↗

A Novel Application of TMA to Converging Runway Operations in a Simulated NextGen Environment

In 2013, the Airspace Operations Laboratory at NASA Ames Research Center conducted a human-in-the-loop simulation that examined the feasibility of applying a number of Next Generation Air Transportation System (NextGen) solutions to complex arrival operations in and around the New York metroplex. The delivery of arrivals to Newark Liberty International Airport (EWR) was the focus of this simulation, which involved extending the Terminal Sequencing and Spacing (TSS) scheduling capability to precisely schedule arrivals to intersecting runways 22 Left and 11. An important enabler for the concept was the availability of a dependent runway scheduler that was able to coordinate arrival times between aircraft landing on intersecting runways. At the time of the study, there was no functionality within the TSS scheduler to automatically create the dependent runway schedules. Instead, a Traffic Management Coordinator (TMC) manually created a de-conflicted schedule, which allowed for the concept to be tested as well as provided valuable insight into the tool requirements for a dependent runway scheduler. Throughout the course of preparations for the simulation, the individual serving as the TMC developed a number of strategies and procedures for manually adjusting the Scheduled Time of Arrival (STA) of the EWR arrivals in order to ensure that adequate spacing was provided between runway 22L and 11 arrival pairs. This paper describes the strategies and procedures that were developed and details how they were successfully applied during the simulation. Results will also be presented that shed additional light on exactly how the schedules were manipulated and their impact on delivery performance and safety. Ideas for additional TSS enhancements and next steps, based on participant feedback, will also be presented.

Homola, Jeffrey↗

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↗

Assessment of Delivery Accuracy in an Operational-Like Environment

In order to enable arrival management concepts and solutions in a Next Generation Air Transportation System (NextGen) environment, ground-based sequencing and scheduling functions were developed to support metering operations in the National Airspace System. These sequencing and scheduling tools are designed to assist air traffic controllers in developing an overall arrival strategy, from enroute down to the terminal area boundary. NASA developed a ground system concept and protoype capability called Terminal Sequencing and Spacing (TSAS) to extend metering operations into the terminal area to the runway. To demonstrate the use of these scheduling and spacing tools in an operational-like environment, the FAA, NASA, and MITRE conducted an Operational Integration Assessment (OIA) of a prototype TSAS system at the FAA's William J. Hughes Technical Center (WJHTC). This paper presents an analysis of the arrival management strategies utilized and delivery accuracy achieved during the OIA. The analysis demonstrates how en route preconditioning, in various forms, and schedule disruptions impact delivery accuracy. As the simulation spanned both enroute and terminal airspace, the use of Ground Interval Management - Spacing (GIM-S) enroute speed advisories was investigated. Delivery accuracy was measured as the difference between the Scheduled Time of Arrival (STA) and the Actual Time of Arrival (ATA). The delivery accuracy was computed across all runs conducted during the OIA, which included deviations from nominal operations which are known to commonly occur in real operations, such as schedule changes and missed approaches. Overall, 83% of all flights were delivered into the terminal airspace within +/- 30 seconds of their STA and 94% of flights were delivered within +/- 60 seconds. The meter fix delivery accuracy standard deviation was found to be between 36 and 55 seconds across all arrival procedures. The data also showed when schedule disruptions were excluded, the percentage of aircraft delivered within +/- 30 seconds was between 85 and 90% across the various arrival procedures at the meter fix. This paper illustrates the ability to meet new delivery accuracy requirements in an operational-like environment using operational systems and NATCA controller participants, while also including common events that might cause disruptions to the schedule and overall system.

Air Traffic Scheduling↗

Investigation of pre-cooling as a recommended measure to improve residential buildings’ thermal resilience during heat waves

More intense heat waves are expected to occur more frequently in the twenty-first century. During severe heat waves, cooling capacity shortfall and overheating are likely to occur in residential buildings, and this will adversely affect occupant's thermal comfort and productivity. We propose a strategy of pre-cooling the house during off-peak hours to mitigate overheating during heat waves. Additionally, simulation results of a prototype single-family house show that adopting the rule-based control (RBC) of pre-cooling thermostat setpoint schedule is effective in reducing thermal discomfort, and that the efficacy of pre-cooling depends upon several building characteristics. An optimized control (OC) of the thermostat setpoint schedule was developed based on the simulation of a prototype building. A simplified yet improved RBC (IRBC) pre-cooling schedule was then extracted from the OC schedule for practical implementation at a larger scale. The effects of the RBC schedule and IRBC schedule were evaluated in the King District of Fresno, which contains 814 residential buildings. Results show that both thermostat setpoint schedules can reduce overheating effectively and that IRBC is slightly better than RBC for most buildings. The findings support the California government's recommendation on pre-cooling to mitigate overheating, which can be further improved with an optimized thermostat setpoint schedule broadcast to residents through early alert messages before a heat wave.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Maximally Expressive Modeling of Operations Tasks

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed, the information sought is at the cutting edge of scientific endeavor, and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a "maximally expressive" modeling schema.

Jaap, John↗