Search NASA⌕ Search

Engineering topics

Jeremy Frank

Publications and source records attributed to Jeremy Frank.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2025

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 Position, Navigation, and Timing (PNT) capability to support the upcoming Lunar users. The navigation service should also be compatible with the smaller platforms, like CubeSats, being sent by the public and private sectors. A non-dedicated, ad-hoc Lunar navigation constellation can provide PNT services on-demand using the non-dedicated swarm assets. Swarm members cooperatively and autonomously localize themselves with minimal interaction from Earth, freeing up valuable bandwidth and ground segment resources. The autonomous localization of Lunar constellations utilizes neighbor two-way intersatellite link (ISL) measurements in a distributed extended Kalman filter (DEKF) system to minimize operating costs. Because the decentralized Lunar PNT system relies on relay communication amongst the agents, network failures or loss of assets among ad-hoc Lunar constellations may impact localization performance. This study presents an evaluation of localization performance under increasing levels of network degradation. A simulation of an ad-hoc Lunar PNT swarm is augmented to include system faults and the impacts of intermittent and permanent failures on localization performance are evaluated. We investigate three potential causes of network degradation: single spacecraft loss, multiple spacecraft loss, and antenna failure. The numerical assessments from the simulation show that the LPNT system under study, based on an autonomous decentralized concept of operation, is highly robust and resilient to communication failures. Minor faults, such as single spacecraft loss, solar interference, technical malfunctions, message delays, and antenna outages, have minimal impact on state estimation, with only a 4.47% and 3.75% degradation in median position error for assets and a representative ground user, respectively, compared to an ideal communication scenario. However, major faults, such as hardware failures or meteor strikes leading to the loss of multiple spacecrafts, are more concerning. The permanent loss of three spacecraft results in a more severe performance degradation, with median position error increasing by 23.3% for assets and 11.7% for a representative ground user, despite the Lunar PNT system remaining functional.

Yeji Kim↗
NASA NTRS2024

An On-Board Off-Board Framework for Online Replanning: Applied to UAVs in Urban Environments

Autonomous systems are being used in a multitude of areas at an increasing rate and require a high level of adaptivity and intelligence to operate safely, especially under faulty conditions. This paper introduces a novel genetic algorithm tailored for UAV trajectory replanning, with an improved execution time via search space reduction based on the operating conditions of the UAV and its remaining mission. A unique characteristic of the replanning agent is its fast-start and adaptive properties, pre-seeding candidates with partial solutions and dynamically tuning elitism, crossover, and mutation rates in correspondence to the average fitness and diversity of the population. A population restart mechanism and early stopping mechanism are evaluated as well to assess their effect on solution quality and runtime. Previous work on genetic algorithms for UAV replanning were conducted with short trajectories in a small state space. Our UAV operates in a 56,000 square meter simulated urban environment, with static obstacles and a total of 53 possible waypoints. The agent increases the safety and reliability of UAV autonomy when operating under faulty conditions and when replanning is required.

Machine Learning↗
NASA NTRS2022

NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) New Observing Strategies (NOS)

NASA's Advanced Information Systems Technology (AIST) Program is one of several Technology programs managed by the Earth Science Technology Office (ESTO) in the Earth Science Division (ESD). The AIST Program focuses on advanced information systems and novel computer science technologies that will be needed by NASA Earth Science in the next 5 to 10 years. New Observing Strategies is one the three main thrusts of the AIST Program. Each year, all the PI's present the technical advancements of their projects during a Grouped Technical Session.

Jacqueline Le Moigne-stewart↗
NASA NTRSDate not supplied

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗
NASA NTRSDate not supplied

Reflecting on Planning Models: A Challenge for Verification and Validation of Planning Systems

We discuss the opportunities for autonomous sys- tems to perform reflection on their planners by adapting the models used to build plans. We first describe model-based planning systems, a form of automated planning system driven by declarative models of the planning domain. These models include descriptions of the conditions and effects of actions on the state of the world. When planning the activities of cyber-physical systems, the command and data representation of the system must be formally abstracted to the actions and states described in the planning system model. When the execution of a plan either fails or produces unexpected outcomes, the execution trace can be abstracted and compared to the predicted state according to the planning model, producing a list of discrepancies; these discrepancies can then be used to fix the model. This provides part of a reflection capability, namely, a set of well-formed problems with the domain model, the abstractions, or both. The challenge lies in the rest of the reflection capability, namely, a set of techniques for changing the models or the abstractions. We discuss these challenges and describe some of the options for addressing them

Mission Planning↗
NASA NTRSDate not supplied

Plan-Property Dependencies are Useful: A User Study

The trade-offs between different desirable plan properties –e. g. PDDL temporal plan preferences – are often difficult to understand. Recent work proposes to address this by iterative planning with explanations elucidating the dependencies between such plan properties. Users can ask questions of the form “Why does the plan you suggest not satisfy property p?”, which are answered by “Because then we would have to forego q” where ¬q is entailed by p in plan space. It has been shown that such plan-property dependencies can be computed reasonably efficiently. But is this form of explanation actually useful for users? We contribute a user study evaluating that question. We design use cases from three domains and run a large user study (N= 40 for each domain, ca. 40 minutes work time per user and domain) on the internet platform Prolific. Comparing users with vs. without access to the explanations, we find that the explanations tend to enable users to identify better trade-offs between the plan properties, indicating an improved understanding of the task.

Explainable Planning↗
NASA NTRSDate not supplied

Design and Testing of Autonomous Distributed Space Systems

Distributed Space Systems (DSS) are an emerging class of mission designs that enable new scientific and commercial opportunities. In order to enable those new opportunities, these systems will need to have significantly expanded autonomous capabilities compared to their single-spacecraft predecessors. In this paper, we present Distributed Spacecraft Autonomy (DSA) project, a payload on NASA's Starling spacecraft experiment. We first describe a step-by-step process for characterizing what features are needed in an autonomous DSS, and show how this process applied to DSA. We then describe the Starling mission, a four-spacecraft swarm hosting multiple DSS payloads. We then describe DSA, which will mature in-space networking and autonomous planning technologies to measure topside ionosophere features using data from the Starling spacecraft's GPS receivers. We describe how DSA will coordinate observations of GPS satellites using Starling's underlying communications infrastructure combined with novel DSS technology. The flight validation of DSS technology will provide mature technology to enable future DSS missions.

Nicholas Cramer↗
NASA NTRSDate not supplied

Explaining Soft-Goal Conflicts through Constraint Relaxations

Recent work suggests to explain trade-offs between soft goals in terms of their conflicts, i. e., minimal unsolvable soft-goal subsets. But this does not explain the conflicts themselves: Why can a given set of soft-goals not be jointly achieved? Here we approach that question in terms of the underlying constraints on plans in the task at hand, namely resource availability and time windows. In this context, a natural form of explanation for a soft-goal conflict is a minimal constraint relaxation under which the conflict disappears (“if the deadline was 1 hour later, it would work”). We explore algorithms for computing such explanations. A baseline is to simply loop over all relaxed tasks and compute the conflicts for each separately. We improve over this by two algorithms that leverage information – conflicts, reachable states – across relaxed tasks. We show that these algorithms can exponentially outperform the baseline in theory, and we run experiments confirming that advantage in practice.

Planning↗
NASA NTRSDate not supplied

Developing Deep Learning Models for System Remaining Useful Life Predictions: Application to Aircraft Engines

Prognostics and health management (PHM) is an important part of ensuring reliable operations of complex safety- critical systems. System-level remaining useful life (RUL) estimation is a much more complex problem than making estimations at the component level, and system-level RUL methodologies remain sparse in the literature. Model-based approaches have traditionally worked in the past for components such as capacitors, MOSFETs, batteries, or hard-drives (to name a few examples), but developing high fidelity dynamics models of cyber physical systems that can be used to study the effects of multiple degrading components in the system remains a challenging task. Some initial work on model-based System RUL predictions was demonstrated in Khorasgani, et al [1], but, to generalize the system-level prognostics problem, we have to resort to pure data driven and hybrid approaches. In this work, we propose an end-to-end data- driven framework for developing deep learning models to predict remaining useful life of cyber physical systems operating under unknown faulty conditions. The raw data is organized with a data schema that improves the model development process and down stream data analysis tasks. Due to the unknown faulty conditions, the raw sensor data is transformed into signals that expose the underlying degradation processes, which are then used for model development. Bayesian Optimization is used to tune the model parameters prior to training and validation. We show that this approach results in accurate predictions within 3 cycles to end of life (EOL). We demonstrate the effectiveness of our approach by applying it to the N-CMAPSS turbofan engine dataset recently released by NASA, which includes high fidelity degradation modeling, real world operating conditions, and a large set of fault operating modes.

Prognostics↗
NASA NTRSDate not supplied

Integrating Planning, Diagnosis and Execution for Vehicle Systems Management

We describe a prototype Vehicle System Manager (VSM) for NASA’s Gateway, a human-capable spacecraft that will also be capable of autonomous operations. The VSM consists of an execution system, planner, and fault management system, integrated via an over-arching mission management compo- nent. We describe the VSM architecture and each of its com- ponents. We describe a series of use cases, centered on a spacecraft propulsive operation that can fail at different times, for different reasons, and how the VSM detects and responds to these failures. We show the VSM is capable of detecting faults and loss of capability, and subsequently replanning, in the presence of each failure scenario.

Planning↗
NASA NTRSDate not supplied

Analyzing Launch Operations using the Spaceport Throughput Analysis Resource (STAR)

NASA’s Kennedy Space Center (KSC) and Cape CanaveralSpace Force Station (CCSFS) are the world’s preeminent multi-user spaceport, providing facilities and launch capabilities to the agency, NASA’s commercial partners, and other government agencies. KSC works to ensure an environment in which NASA’s programs and other users can safely and effectively carry out their operations. Approximately 100 launches are expected to take place in 2024. KSC needs to meet the needs of customers who request launches based on their own schedules, but who may not be aware of KSC-wide resource limitations and external constraints on launch operations. KSC-wide resources include telecommunications, range tracking, commodities such as Helium and Nitrogen, and special equipment needed to support launches. External constraints include seasonal launch operations. Since space vehicles are complex and launch operations are uncertain, unexpected events can also cause delays in operations. The Spaceport Throughput AnalysisResource (STAR) assesses whether a specific set of pro-posed launches and associated activities can be performed given the resources KSC currently has available, and external constraints imposed on KSC operations. STAR integrates short-horizon scheduling and simulation of launches using a monte-carlo approach driven by configurable probabilities of different classes of event outcomes, including de-lays and worst-case use of resources. The resulting analyses inform stakeholders of key constraints preventing customers from being able to perform their missions as desired, and give insight into how to improve spaceport throughput. The rest of the paper is organized as follows. In 2 we de-scribe the problem STAR is intended to solve. In Section3 we formally describe the scheduling problem ingredients. In Section 4 we describe how manifests are simulated. InSection 5 we describe the constraints problem that is solved when rescheduling. In Section 6 we describe what information is recorded during manifest simulation in order to evaluate delays. In Section 7 we describe the specific problem solved for KSC. In Section 8 we describe the challenges of knowledge engineering for STAR.

Planning Scheduling Analysis↗