Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraint programming”

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 559 records · Page 31

jFuzz: A Concolic Whitebox Fuzzer for Java

We present jFuzz, a automatic testing tool for Java programs. jFuzz is a concolic whitebox fuzzer, built on the NASA Java PathFinder, an explicit-state Java model checker, and a framework for developing reliability and analysis tools for Java. Starting from a seed input, jFuzz automatically and systematically generates inputs that exercise new program paths. jFuzz uses a combination of concrete and symbolic execution, and constraint solving. Time spent on solving constraints can be significant. We implemented several well-known optimizations and name-independent caching, which aggressively normalizes the constraints to reduce the number of calls to the constraint solver. We present preliminary results due to the optimizations, and demonstrate the effectiveness of jFuzz in creating good test inputs. The source code of jFuzz is available as part of the NASA Java PathFinder. jFuzz is intended to be a research testbed for investigating new testing and analysis techniques based on concrete and symbolic execution. The source code of jFuzz is available as part of the NASA Java PathFinder.

Jayaraman, Karthick↗

Centralized Planning for Multiple Exploratory Robots

A computer program automatically generates plans for a group of robotic vehicles (rovers) engaged in geological exploration of terrain. The program rapidly generates multiple command sequences that can be executed simultaneously by the rovers. Starting from a set of high-level goals, the program creates a sequence of commands for each rover while respecting hardware constraints and limitations on resources of each rover and of hardware (e.g., a radio communication terminal) shared by all the rovers. First, a separate model of each rover is loaded into a centralized planning subprogram. The centralized planning software uses the models of the rovers plus an iterative repair algorithm to resolve conflicts posed by demands for resources and by constraints associated with the all the rovers and the shared hardware. During repair, heuristics are used to make planning decisions that will result in solutions that will be better and will be found faster than would otherwise be possible. In particular, techniques from prior solutions of the multiple-traveling- salesmen problem are used as heuristics to generate plans in which the paths taken by the rovers to assigned scientific targets are shorter than they would otherwise be.

Estlin, Tara↗

Description of the TCERT Vetting Reports for Data Release 25

This document, the Kepler Instrument Handbook (KIH), is for Kepler and K2 observers, which includes the Kepler Science Team, Guest Observers (GOs), and astronomers doing archival research on Kepler and K2 data in NASAs Astrophysics Data Analysis Program (ADAP). The KIH provides information about the design, performance, and operational constraints of the Kepler flight hardware and software, and an overview of the pixel data sets available. The KIH is meant to be read with these companion documents:1. Kepler Data Processing Handbook (KSCI-19081) or KDPH (Jenkins et al., 2016). The KDPH describes how pixels downlinked from the spacecraft are converted by the Kepler Data Processing Pipeline (henceforth just the pipeline) into the data products delivered to the MAST archive. 2. Kepler Archive Manual (KDMC-10008) or KAM (Thompson et al., 2016). The KAM describes the format and content of the data products, and how to search for them.3. Kepler Data Characteristics Handbook (KSCI-19040) or KDCH (Christiansen et al., 2016). The KDCH describes recurring non-astrophysical features of the Kepler data due to instrument signatures, spacecraft events, or solar activity, and explains how these characteristics are handled by the pipeline.4. Kepler Data Release Notes 25 (KSCI-19065) or DRN 25 (Thompson et al., 2015). DRN 25 describes signatures and events peculiar to individual quarters, and the pipeline software changes between a data release and the one preceding it.Together, these documents supply the information necessary for obtaining and understanding Kepler results, given the real properties of the hardware and the data analysis methods used, and for an independent evaluation of the methods used if so desired.

Instrument↗

Analytical Partial Derivatives of the Q-Law Guidance Algorithm

One method of producing low-thrust trajectories is the closed-loop Q-Law guidance algorithm. This work wraps Q-Law inside a nonlinear programming problem to search for locally optimal gain combinations and enforce nonlinear constraints on the initial state. Gradient-based trajectory optimization has been shown to benefit greatly when analytical partial derivatives are supplied to the optimizer. This paper presents the Q-Law optimization problem setup and derives the Q-Law thrust vector partial derivatives for the State Transition Matrix required by standard nonlinear optimization software.

Jackson L Shannon↗

Squash-Box Feasibility Driven Differential Dynamic Programming

Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.

Navarro, Angel Santamaria↗

Reuse: A knowledge-based approach

This paper describes our research in automating the reuse process through the use of application domain models. Application domain models are explicit formal representations of the application knowledge necessary to understand, specify, and generate application programs. Furthermore, they provide a unified repository for the operational structure, rules, policies, and constraints of a specific application area. In our approach, domain models are expressed in terms of a transaction-based meta-modeling language. This paper has described in detail the creation and maintenance of hierarchical structures. These structures are created through a process that includes reverse engineering of data models with supplementary enhancement from application experts. Source code is also reverse engineered but is not a major source of domain model instantiation at this time. In the second phase of the software synthesis process, program specifications are interactively synthesized from an instantiated domain model. These specifications are currently integrated into a manual programming process but will eventually be used to derive executable code with mechanically assisted transformations. This research is performed within the context of programming-in-the-large types of systems. Although our goals are ambitious, we are implementing the synthesis system in an incremental manner through which we can realize tangible results. The client/server architecture is capable of supporting 16 simultaneous X/Motif users and tens of thousands of attributes and classes. Domain models have been partially synthesized from five different application areas. As additional domain models are synthesized and additional knowledge is gathered, we will inevitably add to and modify our representation. However, our current experience indicates that it will scale and expand to meet our modeling needs.

Iscoe, Neil↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗

Accommodating life sciences on the Space Station

The NASA Ames Research Center Biological Research Project (BRP) is responsible for identifying and accommodating high priority life science activities, utilizing nonhuman specimens, on the Space Station and is charged to bridge the gap between the science community and the Space Station Program. This paper discusses the approaches taken by the BRP in accomodating these research objectives to constraints imposed by the Space Station System, while maintaining a user-friendly environment. Consideration is given to the particular research disciplines which are given priority, the science objectives in each of these disciplines, the functions and activities required by these objectives, the research equipment, and the equipment suits. Life sciences programs planned by the Space Station participating partners (USA, Europe, Japan, and Canada) are compared.

Arno, Roger D.↗

Astrometric Telescope Facility preliminary systems definition study. Volume 1: Executive summary

The Astrometric Telescope Facility (ATF) is a spaceborne observatory proposed for use on the Space Station (SS) as an Initial Operating Capability (IOC) payload. The primary objective of the ATF will be the search for extrasolar planetary systems and a detailed investigation of any discovered systems. In addition, it will have the capability of conducting other astrophysics investigations; e.g., measuring precise distances and motions of stars within our galaxy. The purposes of the study were to: (1) define mission and system requirements; (2) define a strawman system concept for the facility at the Prephase A level; (3) define the need for additional trade studies or technology development; and (4) estimate program cost for the strawman concept. It has been assumed for the study that the ATF will be a SS payload, will use a SS-provided Coarse Pointing System (CPS), will meet SS constraints, and will make maximum use of existing flight qualified designs or designs to be qualified by the SS program for general SS use.

Sobeck, Charlie↗

A Scalable Nonuniform Pointer Analysis for Embedded Program

In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and elements of arrays. The main contribution consists of an efficient yet precise algorithm that can handle multithreaded programs. We first perform an inexpensive flow-sensitive analysis of each function in the program that generates semantic equations describing the effect of the function on the memory graph. These equations bear numerical constraints that describe nonuniform points-to relationships. We then iteratively solve these equations in order to obtain an abstract storage graph that describes the shape of data structures at every point of the program for all possible thread interleavings. We bring experimental evidence that this approach is tractable and precise for real-size embedded applications.

Venet, Arnaud↗

Spatiotemporal development of expanding bacterial colonies driven by emergent mechanical constraints and nutrient gradients

Abstract Bacterial colonies growing on solid surfaces can exhibit robust expansion kinetics, with constant radial growth and saturating vertical expansion, suggesting a common developmental program. Here, we study this process forEscherichia colicells using a combination of modeling and experiments. We show that linear radial colony expansion is set by the verticalization of interior cells due to mechanical constraints rather than radial nutrient gradients as commonly assumed. In contrast, vertical expansion slows down from an initial linear regime even while radial expansion continues linearly. This vertical slowdown is due to limitation of cell growth caused by vertical nutrient gradients, exacerbated by concurrent oxygen depletion. Starvation in the colony interior results in a distinct death zone which sets in as vertical expansion slows down, with the death zone increasing in size along with the expanding colony. Thus, our study reveals complex heterogeneity within simple monoclonal bacterial colonies, especially along the vertical dimension. The intricate dynamics of such emergent behavior can be understood quantitatively from an interplay of mechanical constraints and nutrient gradients arising from obligatory metabolic processes.

Science & Technology - Other Topics↗

Optimization Routine for Generating Medical Kits for Spaceflight Using the Integrated Medical Model

The Integrated Medical Model (IMM) is a MATLAB model that provides probabilistic assessment of the medical risk associated with human spaceflight missions.Different simulations or profiles can be run in which input conditions regarding both mission characteristics and crew characteristics may vary. For each simulation, the IMM records the total medical events that occur and “treats” each event with resources drawn from import scripts. IMM outputs include Total Medical Events (TME), Crew Health Index (CHI), probability of Evacuation (pEVAC), and probability of Loss of Crew Life (pLOCL).The Crew Health Index is determined by the amount of quality time lost (QTL). Previously, an optimization code was implemented in order to efficiently generate medical kits. The kits were optimized to have the greatest benefit possible, given amass and/or volume constraint. A 6-crew, 14-day lunar mission was chosen for the simulation and run through the IMM for 100,000 trials. A built-in MATLAB solver, mixed-integer linear programming, was used for the optimization routine. Kits were generated in 10% increments ranging from 10%-100% of the benefit constraints. Conditions wheremass alone was minimized, volume alone was minimized, and where mass and volume were minimizedjointly were tested.

Medical Kit↗

The Design, Planning and Control of Robotic Systems in Space

In the future, robotic systems will be expected to perform important tasks in space, in orbit and in planetary exploration. In orbit, current technology requires that tasks such as the repair, construction and maintenance of space stations and satellites be performed by astronaut Extra Vehicular Activity (EVA). Eliminating, the need for astronaut EVA through the use of space manipulators would greatly reduce both mission costs and hazards to astronauts. In planetary exploration, cost and logistical considerations clearly make the use of autonomous and telerobotic systems also very attractive, even in cases where an astronaut explorer might be in the area. However, such applications introduce a number of technical problems not found in conventional earth-bound industrial robots. To design useful and practical systems to meet the needs of future space missions, substantial technical development is required, including in the areas of the design, control and planning. The objectives of this research program were to develop such design paradigms and control and planning algorithms to enable future space robotic systems to meet their proposed mission objectives. The underlying intellectual focus of the program is to construct a set of integrated design, planning and control techniques based on an understanding of the fundamental mechanics of space robotic systems. This work was to build upon the results obtained in our previous research in this area supported by NASA Langley Research Center in which we have made important contributions to the area of space robotics. This program was proposed and accepted as a three year research program, a period of time necessary to make the type of fundamental developments to make a significant contributions to space robotics. Unfortunately, less than a year into the program it became clear that the NASA Langley Research Center would be forced by budgetary constraints to essentially leave this area of research. As a result, the total funding we received under this grant represented approximately one year of the original, proposed and approved, funding. For some time, there was substantial uncertainty that even this very reduced level of funding would be provided. The spending of the reduced available funds was spread just over two years to provide the support to permit the MS students who had joined the program to receive their master's degree and terminate their studies in this area.

Dubowsky, Steven↗

Diversification: Far term (2000 - )

Diversification, intended to underly the far term of the energy conservation program, was defined to imply conservation through substitution for scarce energy resources by maximizing the total number of viable energy system types in every sector. The following requirements or aspects of diversification that must be studied were given: fuel mix and end use patterns for various alternative diversification plans, current status of diversification, advantages and disadvantages of diversification, constraints and criteria, diversification actions and their controls, and means for implementing the chosen diversification strategy. The following advantages resulting from diversification were described: competition, crisis-related situations, local energy production, decentralized plant locations, long range energy policy, and environmental overloads. The major criteria by which a diversification program should be judged, the major constraints affecting the approaches, and the road to diversification, were elaborated.

Source record↗

A computer program for detailed analysis of the takeoff and approach performance capabilities of transport category aircraft

The takeoff and approach performance of an aircraft is calculated in accordance with the airworthiness standards of the Federal Aviation Regulations. The aircraft and flight constraints are represented in sufficient detail to permit realistic sensitivity studies in terms of either configuration modifications or changes in operational procedures. The program may be used to investigate advanced operational procedures for noise alleviation such as programmed throttle and flap controls. Extensive profile time history data are generated and are placed on an interface file which can be input directly to the NASA aircraft noise prediction program (ANOPP).

Foss, W. E., Jr.↗

Infrared Submillimeter and Radio Astronomy Research and Analysis Program

This program entitled "Infrared Submillimeter and Radio Astronomy Research and Analysis Program" with NASA-Ames Research Center (ARC) was proposed by the Smithsonian Astrophysical Observatory (SAO) to cover three years. Due to funding constraints only the first year installment of $18,436 was funded, but this funding was spread out over two years to try to maximize the benefit to the program. During the tenure of this contact, the investigators at the SAO, Drs. Wesley A. Traub and Nathaniel P. Carleton, worked with the investigators at ARC, Drs. Jesse Bregman and Fred Wittebom, on the following three main areas: 1. Rapid scanning SAO and ARC collaborated on purchasing and constructing a Rapid Scan Platform for the delay arm of the Infrared-Optical Telescope Array (IOTA) interferometer on Mt. Hopkins, Arizona. The Rapid Scan Platform was tested and improved by the addition of stiffening plates which eliminated a very small but noticeable bending of the metal platform at the micro-meter level. 2. Star tracking Bregman and Wittebom conducted a study of the IOTA CCD-based star tracker system, by constructing a device to simulate star motion having a specified frequency and amplitude of motion, and by examining the response of the tracker to this simulated star input. 3. Fringe tracking. ARC, and in particular Dr. Robert Mah, developed a fringe-packet tracking algorithm, based on data that Bregman and Witteborn obtained on IOTA. The algorithm was tested in the laboratory at ARC, and found to work well for both strong and weak fringes.

Traub, Wesley A.↗

Candidate-Landing Sites and Backups for the Mars Surveyor Program in the Schiaparelli. Crater Region

Our Survey area comprises the Sinus Sabeus NW quadrangle that includes most of the Schiaparelli crater and part of the Arabia SW region (3 N to 15 S Lat.) and (0 to 337.5 W long.) and covers all regions that show a potential hydrogeological link with the Schiaparelli impact structure. This area is hereafter defined as the Schiaparelli Crater Region. The Schiaparelli crater region is one of the most documented MOC targets. Up to now, MGS MOC camera took two dozen images at an average of 5m/pxl resolution that not only provide an exceptional insight on the local geology and morphology, but give also key-elements to assess landing safety criteria. In addition, the MOLA topographic profile No. 23 passes through part of the crater basin allowing the adjustment of the elevation as previously known from the Viking mission (USGS I-2125, 1991). Beyond the Mars Polar Lander mission that will land next December, the future missions (2001 APEX, 2003, and 2005) are led by a series of science objectives and engineering constraints that must be considered in order to select landing sites that will fulfill the Surveyor Program's objectives. The search for a sound and safe candidate-site (without ending up with the usual "safe but boring" or "fascinating but too risky" site) is usually limited by the data available to the investigator, by the data accuracy (e.g. poor image resolution, poor altimetry), and the lack of crucial information for science and safety that can be derived from them. The Schiaparelli region provides an exception to this recurrent pattern. We listed the preliminary constraints for landing site selection identified for the Surveyor '01 mission, in terms of safety requirements and data needed and compared them against the existing information and/or data already available for the Schiaparelli region. The engineering constraints of '03 and '05 are not designated yet but, since they are also related to atmospheric density and Lander designs, we will assume that these points will be comparable to '01. The main difference will reside in the rover design, the Rocky-7 class rover being bigger than Marie Curie ('01) will be able to overcome bigger obstacles. We listed then the main objectives of the Surveyor Program and compared them with the potential offered by the Schiaparelli Crater Region to document them. Within the survey area, the Schiaparelli impact crater is 2.5 S/343.3 W (USGS 1-1376, MC-20 NW, 1981) and occupies a significant surface area. The crater has been proposed as a potential candidate-site in the past years. The purpose of this study is to show that, not only the Schiaparelli Crater would be a high-priority target, but that the region where it is located offer several very-high potential back-up sites, all within science and engineering constraints, that make this region probably the most promising candidate area so far.

Cabrol, Nathalie A.↗

Computational Support for Technology- Investment Decisions

Strategic Assessment of Risk and Technology (START) is a user-friendly computer program that assists human managers in making decisions regarding research-and-development investment portfolios in the presence of uncertainties and of non-technological constraints that include budgetary and time limits, restrictions related to infrastructure, and programmatic and institutional priorities. START facilitates quantitative analysis of technologies, capabilities, missions, scenarios and programs, and thereby enables the selection and scheduling of value-optimal development efforts. START incorporates features that, variously, perform or support a unique combination of functions, most of which are not systematically performed or supported by prior decision- support software. These functions include the following: Optimal portfolio selection using an expected-utility-based assessment of capabilities and technologies; Temporal investment recommendations; Distinctions between enhancing and enabling capabilities; Analysis of partial funding for enhancing capabilities; and Sensitivity and uncertainty analysis. START can run on almost any computing hardware, within Linux and related operating systems that include Mac OS X versions 10.3 and later, and can run in Windows under the Cygwin environment. START can be distributed in binary code form. START calls, as external libraries, several open-source software packages. Output is in Excel (.xls) file format.

Adumitroaie, Virgil↗