Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex Constraints”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Applying Squeaky-Wheel Optimization Schedule Airborne Astronomy Observations

We apply the Squeaky Wheel Optimization (SWO) algorithm to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The problem contains complex constraints relating the feasibility of an astronomical observation to the position and time at which the observation begins, telescope elevation limits, special use airspace, and available fuel. Solving the problem requires making discrete choices (e.g. selection and sequencing of observations) and continuous ones (e.g. takeoff time and setting up observations by repositioning the aircraft). The problem also includes optimization criteria such as maximizing observing time while simultaneously minimizing total flight time. Previous approaches to the problem fail to scale when accounting for all constraints. We describe how to customize SWO to solve this problem, and show that it finds better flight plans, often with less computation time, than previous approaches.

Frank, Jeremy↗
NASA NTRS2006

Innovative Trajectory Designs to meet Exploration Challenges

This document is a viewgraph presentation of the conference paper. Missions incorporated into NASA's Vision for Space Exploration include many different destinations and regions; are challenging to plan; and need new and innovative trajectory design methods to enable them. By combining proven methods with chaos dynamics, exploration goals that require maximum payload mass or minimum duration can be achieved. The implementation of these innovative methods, such as weak stability boundaries, has altered NASA's approach to meet exploration challenges and is described to show how exploration goals may be met in the next decade. With knowledge that various perturbations play a significant role, the mission designer must rely on both traditional design strategies as well as these innovative methods. Over the past decades, improvements have been made that would at first glance seem dramatic. This paper provides a brief narrative on how a fundamental shift has occurred and how chaos dynamics improve the design of exploration missions with complex constraints.

Folta, David C.↗
NASA NTRS2005

Automated Planning and Scheduling for Space Mission Operations

Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.

scheduling↗
NASA NTRSDate not supplied

Tailoring Early Concept Maturity Levels for Small Satellite Missions

The Concept Maturity Level (CML) framework has gained widespread acceptance as a process to assess mission concept maturity, particularly for early mission concepts in the formulation phase. Popularized by the Jet Propulsion Laboratory almost 15 years ago to evaluate large NASA science mission concepts, the CML method offers wide-ranging programmatic and technical evaluation criteria to assess and measure the progress of mission concepts at all stages of maturity. It also provides a useful tool to facilitate stakeholder relationships through effective engagement, interaction, and communication. The CML approach is modeled largely after the widespread Technology Readiness Level (TRL) scale, a measure of how new technology progresses from early concept through to being operational at the mission flight system level. Tailoring the CML framework for small satellites allows for more relevant technical and programmatic evaluations for these missions. Given the diversity of small satellite mission objectives, cost constraints, complexity, and risk tolerance, this modified CML framework enables study teams and stakeholders to determine the appropriate CML fidelity to implement based upon the opportunity and strategic investment approach. A decision process flow method is proposed to guide teams through the logic of determining what CML fidelity to implement in evaluating small satellite mission concepts. The goal is to provide enhanced stakeholder engagement such that CML assessments are clearly articulated and understood early in the design study. This would allow for more appropriate application of CML methodology by study teams developing University led missions, technology demonstrations, commercial constellations, and more complex planetary science missions.

Concept Maturity Level↗
NASA NTRS2022

Formal Methods for Trusted Space Autonomy, Boon or Bane?

Trusted Space Autonomy is challenging in that space systems are complex artifacts deployed in a high stakes environment with complicated operational settings. Thus far these challenges have been met using the full arsenal of tools: formal methods, informal methods, testing, runtime techniques, and operations processes. Using examples from previous deployments of autonomy to the Remote Agent on DS-1, Autonomous Sciencecraft on EO-1, WATCH on MER, IPEX, AEGIS on MER, MSL, and M2020, and the M2020 Onboard planner, we discuss how each of these approaches have been used to enable successful deployment of autonomy. We next focus on relatively limited use of formal methods (both prior to deployment and runtime methods). From the needs perspective, formal methods represent the best chance for reliable autonomy as testing, informal methods, and operations accommodations do not scale well with increasing complexity of the autonomous system. However from the practice perspective, formal methods have been limited in their application due to difficulty in eliciting formal specifications and challenges in representing complex constraints such as metric time and resources. We discuss some of these challenges as well as the opportunity to extend formal and informal methods into runtime validation systems.

Chien, Steve↗
NASA NTRS1993

The instant sequencing task: Toward constraint-checking a complex spacecraft command sequence interactively

Robotic spacecraft are controlled by sets of commands called 'sequences.' These sequences must be checked against mission constraints. Making our existing constraint checking program faster would enable new capabilities in our uplink process. Therefore, we are rewriting this program to run on a parallel computer. To do so, we had to determine how to run constraint-checking algorithms in parallel and create a new method of specifying spacecraft models and constraints. This new specification gives us a means of representing flight systems and their predicted response to commands which could be used in a variety of applications throughout the command process, particularly during anomaly or high-activity operations. This commonality could reduce operations cost and risk for future complex missions. Lessons learned in applying some parts of this system to the TOPEX/Poseidon mission will be described.

Horvath, Joan C.↗
NASA NTRS1999

A Framework for Dynamic Constraint Reasoning Using Procedural Constraints

Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. This translates a significant part of the planning problem into a constraint network whose consistency determines the validity of the plan candidate. Since higher-level choices about control actions can add or remove variables and constraints, the underlying constraint network is invariably highly dynamic. Arbitrary domain-dependent constraints may be added to the constraint network and the constraint reasoning mechanism must be able to handle such constraints effectively. Additionally, real problems often require handling constraints over continuous variables. These requirements present a number of significant challenges for a constraint reasoning mechanism. In this paper, we introduce a general framework for handling dynamic constraint networks with real-valued variables, by using procedures to represent and effectively reason about general constraints. The framework is based on a sound theoretical foundation, and can be proven to be sound and complete under well-defined conditions. Furthermore, the framework provides hybrid reasoning capabilities, as alternative solution methods like mathematical programming can be incorporated into the framework, in the form of procedures.

Jonsson, Ari K.↗
NASA NTRS2009

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗
NASA NTRS2014

Definition ofthe Design Trajectory and Entry Flight Corridor for the NASA Orion Exploration Mission 1 Entry Trajectory Using an Integrated Approach and Optimization

One of the key design objectives of NASA's Orion Exploration Mission 1 (EM- 1) is to execute a guided entry trajectory demonstrating GN&C capability. The focus of this paper is defining the flyable entry corridor for EM-1 taking into account multiple subsystem constraints such as complex aerothermal heating constraints, aerothermal heating objectives, landing accuracy constraints, structural load limits, Human-System-Integration-Requirements, Service Module debris disposal limits and other flight test objectives. During the EM-1 Design Analysis Cycle 1 design challenges came up that made defining the flyable entry corridor for the EM-1 mission critical to mission success. This document details the optimization techniques that were explored to use with the 6-DOF ANTARES simulation to assist in defining the design entry interface state and entry corridor with respect to key flight test constraints and objectives.

McNamara, Luke W.↗
NASA NTRS2020

X-ray Spectra of the Fe-L Complex II: Atomic Data Constraints from the EBIT Experiment and X-Ray Grating Observations of Capella

The Hitomi results for the Perseus cluster have shown that accurate atomic models are essential to the success of X-ray spectroscopic missions and just as important as the store of knowledge on instrumental calibration and astrophysical modeling. Preparing the models requires a multifaceted approach, including theoretical calculations, laboratory measurements, and calibration using real observations. In a previous paper, we presented a calculation of the electron impact cross sections on the transitions forming the Fe-L complex. In the present work, we systematically tested the calculation against cross-sections of ions measured in an electron beam ion trap experiment. A two-dimensional analysis in the electron beam energies and X-ray photon energies was utilized to disentangle radiative channels following dielectronic recombination, direct electron-impact excitation, and resonant excitation processes in the experimental data. The data calibrated through laboratory measurements were further fed into a global modeling of the Chandra grating spectrum of Capella. We investigated and compared the fit quality, as well as the sensitivity of the derived physical parameters to the underlying atomic data and the astrophysical plasma modeling. We further list the potential areas of disagreement between the observations and the present calculations, which, in turn, calls for renewed efforts with regard to theoretical calculations and targeted laboratory measurements.

Liyi Gu↗
NASA NTRS1989

Interactive orbital proximity operations planning system

An interactive, graphical proximity operations planning system was developed which allows on-site design of efficient, complex, multiburn maneuvers in the dynamic multispacecraft environment about the space station. Maneuvering takes place in, as well as out of, the orbital plane. The difficulty in planning such missions results from the unusual and counterintuitive character of relative orbital motion trajectories and complex operational constraints, which are both time varying and highly dependent on the mission scenario. This difficulty is greatly overcome by visualizing the relative trajectories and the relative constraints in an easily interpretable, graphical format, which provides the operator with immediate feedback on design actions. The display shows a perspective bird's-eye view of the space station and co-orbiting spacecraft on the background of the station's orbital plane. The operator has control over two modes of operation: (1) a viewing system mode, which enables him or her to explore the spatial situation about the space station and thus choose and frame in on areas of interest; and (2) a trajectory design mode, which allows the interactive editing of a series of way-points and maneuvering burns to obtain a trajectory which complies with all operational constraints. Through a graphical interactive process, the operator will continue to modify the trajectory design until all operational constraints are met. The effectiveness of this display format in complex trajectory design is presently being evaluated in an ongoing experimental program.

Grunwald, Arthur J.↗
NASA NTRSDate not supplied

REACTER 2.0: Quantum-Informed Reaction Constraints and Automated Interaction Typing

REACTER is a heuristic method for modeling chemical reactions in classical molecular dynamics simulations, implemented in LAMMPS as fix bond/react. The authors recently extended LAMMPS to support alphanumeric labels for atom types, bond types etc., which enables the pre- and post-reaction templates required by the REACTER protocol to be portable between different simulations and greatly simplifies the task of creating simulation-ready reaction templates. To further increase the generality of reaction templates, support for wildcard characters within atom types has been added, along with the automatic assignment of interaction types for new bonds, angles, etc. based on the involved atom types. In some cases, this feature can express a class of reactions with one pair of reaction templates, where previously dozens may have been required. Advanced reaction constraints have also been added, including an Arrhenius constraint to enforce an effective activation energy, a root-mean-square-deviation option for complex geometrical constraints, as well as a custom constraint that leverages LAMMPS’ powerful built-in variable framework. Other new features include variable support for various inputs (e.g., to allow reaction rates or cutoffs to be dependent on overall conversion), on-the-fly update of molecule IDs, and the ability to create new atoms positioned with respect to the reaction site. The new features are applied to modeling polymeric, thermosetting and composite materials, and advanced applications of the new reaction constraints are demonstrated. For example, REACTER is shown to accurately reproduce mechanically-induced bond breaking, as characterized by third-order DFT-based tight-binding (DFTB3) simulations, via a constraint on the total potential energy of the involved atoms.

polymer simulations↗
NASA NTRSDate not supplied

REACTER: A Versatile Tool for Large-Scale Reactive Molecular Dynamics

Accurately describing reactive events over long length and time scales remains a grand challenge of computational materials science. REACTER is a general protocol for modeling chemical reactions using classical force fields, and is implemented in the popular molecular dynamics software LAMMPS. REACTER has a growing user base and has been used as a model-building tool for a variety of materials, including thermoplastics, thermosets, glassy materials and composites. The method has also been applied to accelerated modeling of reversible chemical reactions, such as the formation of electrochemical components for batteries. Recently, the REACTER protocol has received some major upgrades to enhance its ability to predict when reactions occur and to make it easier to use. Force field parameters can now be automatically assigned to newly created bonds, angles and other interactions. Advanced reaction constraints have also been added, including an Arrhenius constraint to enforce an effective activation energy, a root-mean-square-deviation option for complex geometrical constraints, and a constraint based on the total potential energy of the atoms involved in a reactive site. This potential energy constraint allows for the accurate reproduction of DFT-based tight-binding (DFTB3) predicted bond dissociation curves for mechanically induced bond breaking.

polymer simulations, molecular dynamics↗
NASA NTRS1991

Minimum fuel coplanar aeroassisted orbital transfer using collocation and nonlinear programming

The fuel optimal control problem arising in coplanar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) without plane change. The basic approach here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the coplanar aeroassisted HEO to LEO orbit transfer consists of three phases. In the first phase, the transfer begins with a deorbit impulse at HEO which injects the vehicle into a elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and drag modulation to satisfy heating constraints and to exit the atmosphere with the desired flight path angle and velocity so that the apogee of the exit orbit is the altitude of the desired LEO. Finally, the second impulse is required to circularize the orbit at LEO. The performance index is maximum final mass. Simulation results show that the coplanar aerocapture is quite different from the case where orbital plane changes are made inside the atmosphere. In the latter case, the vehicle has to penetrate deeper into the atmosphere to perform the desired orbital plane change. For the coplanar case, the vehicle needs only to penetrate the atmosphere deep enough to reduce the exit velocity so the vehicle can be captured at the desired LEO. The peak heating rates are lower and the entry corridor is wider. From the thermal protection point of view, the coplanar transfer may be desirable. Parametric studies also show the maximum peak heating rates and the entry corridor width are functions of maximum lift coefficient. The problem is solved using a direct optimization technique which uses piecewise polynomial representation for the states and controls and collocation to represent the differential equations. This converts the optimal control problem into a nonlinear programming problem which is solved numerically by using a modified version of NPSOL. Solutions were obtained for the described problem for cases with and without heating constraints. The method appears to be more robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun Yuan↗
NASA NTRS1990

Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun. Y.↗
NASA NTRS2004

Software for Autonomous Spacecraft Maneuvers

The AutoCon computer programs facilitate and accelerate the planning and execution of orbital control maneuvers of spacecraft while analyzing and resolving mission constraints. AutoCon-F is executed aboard spacecraft, enabling the spacecraft to plan and execute maneuvers autonomously; AutoCon-G is designed for use on the ground. The AutoCon programs utilize advanced techniques of artificial intelligence, including those of fuzzy logic and natural-language scripting, to resolve multiple conflicting constraints and automatically plan maneuvers. These programs can be used to satisfy requirements for missions that involve orbits around the Earth, the Moon, or any planet, and are especially useful for missions in which there are requirements for frequent maneuvers and for resolution of complex conflicting constraints. During operations, the software targets new trajectories, places and sizes maneuvers, and controls spacecraft burns. AutoCon-G provides a userfriendly graphical interface, and can be used effectively by an analyst with minimal training. AutoCon-F reduces latency and supports multiple-spacecraft and formation-flying missions. The AutoCon architecture supports distributive processing, which can be critical for formation- control missions. AutoCon is completely object-oriented and can easily be enhanced by adding new objects and events. AutoCon-F was flight demonstrated onboard GSFC's EO-1 spacecraft flying in formation with Landsat-7.

Bristow, John↗
NASA NTRS1991

Reasoning about real-time systems with temporal interval logic constraints on multi-state automata

Models of real-time systems using a single paradigm often turn out to be inadequate, whether the paradigm is based on states, rules, event sequences, or logic. A model-based approach to reasoning about real-time systems is presented in which a temporal interval logic called TIL is employed to define constraints on a new type of high level automata. The combination, called hierarchical multi-state (HMS) machines, can be used to model formally a real-time system, a dynamic set of requirements, the environment, heuristic knowledge about planning-related problem solving, and the computational states of the reasoning mechanism. In this framework, mathematical techniques were developed for: (1) proving the correctness of a representation; (2) planning of concurrent tasks to achieve goals; and (3) scheduling of plans to satisfy complex temporal constraints. HMS machines allow reasoning about a real-time system from a model of how truth arises instead of merely depending of what is true in a system.

Gabrielian, Armen↗