Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Scenario optimization”

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 199 records · Page 11

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗

Copernicus-LinCov (COPCOV) Software Integration in Support of Robust Trajectory Optimization

Robust trajectory optimization is the process of optimizing a trajectory while accounting for system uncertainty due to a variety of potential error sources. This work highlights the development and features of a novel tool known as CopCov to support robust trajectory optimization efforts. CopCov acts as an interface between Copernicus, a generalized trajectory design and optimization tool, and LinCov, a linear covariance analysis tool. By having a direct interface between these two software packages, Copernicus can receive covariance information from LinCov through a direct feedback loop, thus enabling optimization of a trajectory that is robust to trajectory dispersions and navigation errors. This paper details the architecture of CopCov and its flexibility to operate under varying configurations, including with both tools running locally or alternatively with the tools communicating via a remote connection. Additionally, the CopCov tool is demonstrated on a simple Hohmann transfer reference trajectory with varying numbers of Trajectory Correction Maneuvers (TCMs) and varying problem formulations. This example scenario is used to highlight how the inclusion of the CopCov interface affects burn placement of both major burns and minor burns (i.e., TCMs) in the optimized solution. Results are compared against analytical solutions and against a Genetic Algorithm (GA) optimizer for independent verification and validation.

Copernicus↗

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Wi-Fi Signal Survey of the International Space Station by Autonomous Free-Flying Robot

This paper analyzes Wi-Fi signal propagation inside pressurized modules of the International Space Station (ISS). Various flight datasets were collected by the Astrobee fleet of autonomous free-flying robots developed by the NASA Ames Research Center (ARC). The enclosed module spaces of the ISS pose unique challenges for Wi-Fi signal propagation, and understanding these challenges is crucial for optimizing connectivity in such environments. The survey data presented are valuable for optimizing wireless access point (WAP) locations and conditions. A computational method is developed to analyze the wireless communication system, RF coverage, and module compositions. The method is both rigorous and practical for assessing the ISS wireless system performance. The computational tools in this paper serve as a complementary approach to direct, on-orbit measurements, which is a complicated and expensive task. In some operational scenarios, ground measurements may be intractable due to the size of the spacecraft. Results from this research will aid future space missions and commercial spacecraft, providing insights into optimal WAP placements and robust wireless communication systems.

Astrobee↗

Wi-Fi Signal Survey of the International Space Station by Autonomous Free-Flying Robot

This paper analyzes Wi-Fi signal propagation inside pressurized modules of the International Space Station (ISS). Various flight datasets were collected by the Astrobee fleet of autonomous free-flying robots developed by the NASA Ames Research Center (ARC). The enclosed module spaces of the ISS pose unique challenges for Wi-Fi signal propagation, and understanding these challenges is crucial for optimizing connectivity in such environments. The survey data presented are valuable for optimizing wireless access point (WAP) locations and conditions. A computational method is developed to analyze the wireless communication system, RF coverage, and module compositions. The method is both rigorous and practical for assessing the ISS wireless system performance. The computational tools in this paper serve as a complementary approach to direct, on-orbit measurements, which is a complicated and expensive task. In some operational scenarios, ground measurements may be intractable due to the size of the spacecraft. Results from this research will aid future space missions and commercial spacecraft, providing insights into optimal WAP placements and robust wireless communication systems.

International Space Station↗

Generating Exploration Mission-3 Trajectories to a 9:2 NRHO using Machine Learning

The purpose of this thesis is to design a machine learning algorithm platform that provides expanded knowledge of mission availability through a launch season by improving trajectory resolution and introducing launch mission forecasting. The specific scenario addressed in this paper is one in which data is provided for four deterministic translational maneuvers through a mission to a Near Rectilinear Halo Orbit (NRHO) with a 9:2 synodic frequency. Current launch availability knowledge under NASA's Orion Orbit Performance Team is established by altering optimization variables associated to given reference launch epochs. This current method can bean abstract task and relies on an orbit analyst to structure a mission based on an established mission design methodology associated to the performance of Orion and NASA's Space Launch System. Introducing a machine learning algorithm trained to construct mission scenarios within the feasible range of known trajectories reduces the required interaction of the orbit analyst by removing the needed step of optimizing the orbit to fit an expected translational response required of the spacecraft. In this study, k-Nearest Neighbor and Bayesian Linear Regression successfully predicted classical orbital elements for the launch windows observed. However both algorithms had limitations due to their approaches to model fitting. Training machine learning algorithms off of classical orbital elements introduced a repetitive approach to reconstructing mission segments for different arrival opportunities through the launch window and can prove to be a viable method of launch window scan generation for future missions.

Guzman, Esteban↗

Applying the Cognitive Space Gateway to Swarm Topologies

NASA's future vision for interplanetary networking includes a lunar network, Cube Satellite (CubeSat) constellations, and deep space robotic missions, comprising what could be viewed as a network of networks. Delay-tolerant networking (DTN) architecture and protocols provide a standard network layer among these varying scenarios and mitigate many challenges of the space environment, such as long delays, unplanned service interruptions, and asymmetric links. The Cognitive Space Gateway (CSG) is a routing method in a DTN architecture that uses spiking neural networks as the learning element to optimize routing decisions in a complex environment. This work aims to further develop cognitive networking technologies in several critical areas, including DTN, the CSG algorithm, CubeSat swarm topologies, and cloud services. To test the algorithm in a realistic scenario, the emulated network topology is based on a CubeSat swarm. The swarm may function as a mesh of nodes or as a hub-and-spoke network. An emulation environment will be built upon a commercial cloud service, such as Amazon Web Services (AWS) Elastic Compute Cloud. The cloud environment may enable a flexible, lower maintenance approach versus a multi-hop network based in a physical laboratory. The cloud platform will provide a secure environment allowing for collaboration among government and academic entities.

Ricardo Lent↗

Guidance algorithms for a free-flying space robot

Robotics is a promising technology for assembly, servicing, and maintenance of platforms in space. Several aspects of planning and guidance for telesupervised and fully autonomous robotic servicers are investigated. Guidance algorithms for proximity operation of a free flyer are described. Numeric trajectory optimization is combined with artificial intelligence based obstacle avoidance. An initial algorithm and the results of its simulating platform servicing scenario are discussed. A second algorithm experiment is then proposed.

Brindle, A. F.↗

Industry Consolidation and Future Airline Network Structures in Europe

In the current downturn in demand for air travel, major airlines are revising and rationalizing their networks in an attempt to improve financial performance and strengthen their defences against both new entrants and traditional rivals. Expansion of commercial agreements or alliances with other airlines has become a key reaction to the increasingly competitive marketplace. In the absence, for regulatory reasons, of cross-border mergers these are the principal means by which the industry can consolidate internationally. This paper analyzes the developments which have been taking place and attempts to itentify the implications for airline network structures and the function of different hub airports. The range of services available to passengers in long-haul markets to/from Europe is evaluated before and after recent industry reorganization. Hubs are crucial to interlink the route networks of parmers in an alliance. However, duplication between nearby hub airports that find themselves within the same airline alliance can lead to loss of service at the weaker locations. The extent to which the alliance hubs in Europe duplicate or complement each other in terms of network coverage is assessed and this methodology also enables the optimal partnerships for "unattached" airlines to be identified. The future role of the various European hubs is considered under different scenarios of global alliance development. The paper concludes by considering possible longer-term developments. In an environment where the low-cost carriers will provide a major element of customer choice, it is suggested that the traditional airlines will retrench around their hubs, surrendering many secondary cities to the low-cost sector. Further reduction in the number of alliances could threaten more of the European hubs. For both regulatory and commercial reasons, the end result may be just one airline alliance - so recreating in the deregulated market the historic rule of IATA.

Dennis, Nigel↗

Recent Results on "Approximations to Optimal Alarm Systems for Anomaly Detection"

An optimal alarm system and its approximations may use Kalman filtering for univariate linear dynamic systems driven by Gaussian noise to provide a layer of predictive capability. Predicted Kalman filter future process values and a fixed critical threshold can be used to construct a candidate level-crossing event over a predetermined prediction window. An optimal alarm system can be designed to elicit the fewest false alarms for a fixed detection probability in this particular scenario.

Martin, Rodney Alexander↗

Adaptive Key Component Control of Nonlinear Evolving Flexible Structures

An optimal alarm system and its approximations may use Kalman filtering for univariate linear dynamic systems driven by Gaussian noise to provide a layer of predictive capability. Predicted Kalman filter future process values and a fixed critical threshold can be used to construct a candidate level-crossing event over a predetermined prediction window. An optimal alarm system can be designed to elicit the fewest false alarms for a fixed detection probability in this particular scenario.

Balas, Mark↗

Infrared Limb Sounding with Cassini CIRS: Optimal Viewing Strategy Using Horizon Nodes

In this paper we investigate a question of science optimization during Cassini flybys of Titan. The Composite Infrared Spectrometer (CIRS) makes limb during the closest approach period when the visible horizon circle is moving swiftly across the planet. We have sought to discover if any points on the horizon are preferred for limb sounding due to having minimum movement relative to the surface. By numerical calculation, backed by geometric analysis, we find that two limited regions on the horizon are continuously visible during the entire encounter. We term these "limb nodes" and show how they may be employed by CIRS to optimize science by minimizing the source of systematic error due to spatial smear. These conclusions are applicable to many similar scenarios of spacecraft limb sounding during hyperbolic flyby encounters.

Mixon, Conor A.↗

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Birge, Brian↗