Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint logic 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 55 records · Page 3

Specifying structural constraints of architectural patterns in the ARCHERY language

ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems in terms of architectural patterns. The language supports the specification of architectures and their reconfiguration. This paper introduces a language extension for precisely describing the structural design decisions that pattern instances must respect in their (re)configurations. The extension is a propositional modal logic with recursion and nominals referencing components, i.e., a hybrid µ-calculus. Its expressiveness allows specifying safety and liveness constraints, as well as paths and cycles over structures. Refinements of classic architectural patterns are specified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved NASTRAN plotting

The new 1991 COSMIC/NASTRAN version, compatible with the older versions, tries to remove some old constraints and make it easier to extract information from the plot file. It also includes some useful improvements and new enhancements. New features available in the 1991 version are described. They include a new PLT1 tape with simplified ASCII plot commands and short records, combined hidden and shrunk plot, an x-y-z coordinate system on all structural plots, element offset plot, improved character size control, improved FIND and NOFIND logic, a new NASPLOT post-prosessor to perform screen plotting or generate PostScript files, and a BASIC/NASTPLOT program for PC.

Chan, Gordon C.↗

Waste management under multiple complexities: Inexact piecewise-linearization-based fuzzy flexible programming

Highlights: Black-Right-Pointing-Pointer Inexact piecewise-linearization-based fuzzy flexible programming is proposed. Black-Right-Pointing-Pointer It's the first application to waste management under multiple complexities. Black-Right-Pointing-Pointer It tackles nonlinear economies-of-scale effects in interval-parameter constraints. Black-Right-Pointing-Pointer It estimates costs more accurately than the linear-regression-based model. Black-Right-Pointing-Pointer Uncertainties are decreased and more satisfactory interval solutions are obtained. - Abstract: To tackle nonlinear economies-of-scale (EOS) effects in interval-parameter constraints for a representative waste management problem, an inexact piecewise-linearization-based fuzzy flexible programming (IPFP) model is developed. In IPFP, interval parameters for waste amounts and transportation/operation costs can be quantified; aspiration levels for net system costs, as well as tolerance intervals for both capacities of waste treatment facilities and waste generation rates can be reflected; and the nonlinear EOS effects transformed from objective function to constraints can be approximated. An interactive algorithm is proposed for solving the IPFP model, which in nature is an interval-parameter mixed-integer quadratically constrained programming model. To demonstrate the IPFP's advantages, two alternative models are developed to compare their performances. One is a conventional linear-regression-based inexact fuzzy programming model (IPFP2) and the other is an IPFP model with all right-hand-sides of fussy constraints being the corresponding interval numbers (IPFP3). The comparison results between IPFP and IPFP2 indicate that the optimized waste amounts would have the similar patterns in both models. However, when dealing with EOS effects in constraints, the IPFP2 may underestimate the net system costs while the IPFP can estimate the costs more accurately. The comparison results between IPFP and IPFP3 indicate that their solutions would be significantly different. The decreased system uncertainties in IPFP's solutions demonstrate its effectiveness for providing more satisfactory interval solutions than IPFP3. Following its first application to waste management, the IPFP can be potentially applied to other environmental problems under multiple complexities.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

HTMT-class Latency Tolerant Parallel Architecture for Petaflops Scale Computation

Computational Aero Sciences and other numeric intensive computation disciplines demand computing throughputs substantially greater than the Teraflops scale systems only now becoming available. The related fields of fluids, structures, thermal, combustion, and dynamic controls are among the interdisciplinary areas that in combination with sufficient resolution and advanced adaptive techniques may force performance requirements towards Petaflops. This will be especially true for compute intensive models such as Navier-Stokes are or when such system models are only part of a larger design optimization computation involving many design points. Yet recent experience with conventional MPP configurations comprising commodity processing and memory components has shown that larger scale frequently results in higher programming difficulty and lower system efficiency. While important advances in system software and algorithms techniques have had some impact on efficiency and programmability for certain classes of problems, in general it is unlikely that software alone will resolve the challenges to higher scalability. As in the past, future generations of high-end computers may require a combination of hardware architecture and system software advances to enable efficient operation at a Petaflops level. The NASA led HTMT project has engaged the talents of a broad interdisciplinary team to develop a new strategy in high-end system architecture to deliver petaflops scale computing in the 2004/5 timeframe. The Hybrid-Technology, MultiThreaded parallel computer architecture incorporates several advanced technologies in combination with an innovative dynamic adaptive scheduling mechanism to provide unprecedented performance and efficiency within practical constraints of cost, complexity, and power consumption. The emerging superconductor Rapid Single Flux Quantum electronics can operate at 100 GHz (the record is 770 GHz) and one percent of the power required by convention semiconductor logic. Wave Division Multiplexing optical communications can approach a peak per fiber bandwidth of 1 Tbps and the new Data Vortex network topology employing this technology can connect tens of thousands of ports providing a bi-section bandwidth on the order of a Petabyte per second with latencies well below 100 nanoseconds, even under heavy loads. Processor-in-Memory (PIM) technology combines logic and memory on the same chip exposing the internal bandwidth of the memory row buffers at low latency. And holographic storage photorefractive storage technologies provide high-density memory with access a thousand times faster than conventional disk technologies. Together these technologies enable a new class of shared memory system architecture with a peak performance in the range of a Petaflops but size and power requirements comparable to today's largest Teraflops scale systems. To achieve high-sustained performance, HTMT combines an advanced multithreading processor architecture with a memory-driven coarse-grained latency management strategy called "percolation", yielding high efficiency while reducing the much of the parallel programming burden. This paper will present the basic system architecture characteristics made possible through this series of advanced technologies and then give a detailed description of the new percolation approach to runtime latency management.

Sterling, Thomas↗

Shuttle cryogenic supply system optimization study. Volume 5A-1: Users manual for math models

The Integrated Math Model for Cryogenic Systems is a flexible, broadly applicable systems parametric analysis tool. The program will effectively accommodate systems of considerable complexity involving large numbers of performance dependent variables such as are found in the individual and integrated cryogen systems. Basically, the program logic structure pursues an orderly progression path through any given system in much the same fashion as is employed for manual systems analysis. The system configuration schematic is converted to an alpha-numeric formatted configuration data table input starting with the cryogen consumer and identifying all components, such as lines, fittings, and valves, each in its proper order and ending with the cryogen supply source assembly. Then, for each of the constituent component assemblies, such as gas generators, turbo machinery, heat exchangers, and accumulators, the performance requirements are assembled in input data tabulations. Systems operating constraints and duty cycle definitions are further added as input data coded to the configuration operating sequence.

Source record↗

Performance seeking controls

A performance logic algorithm (PSL) was developed to optimize the performance of propulsion systems for component and sensor degradations by monitoring the performance of the engine system and minimizing thrust specific fuel consumption (TSFC) while retaining a constant engine net thrust. Engine constraints such as surge margin, speed, pressure, and temperature are observed. The PSL algorithm was applied to the quiet, clean, short haul experimental engine. Engine control set points were modified for component degradations in order to restore the nominal net thrust. Results show convergence to the optimum value can be obtained within 60 to 90 seconds, which makes the program acceptable to on line operation with present state of the art minicomputers. Tests indicate that in most cases the PSL algorithm offers some improvement in thrust specific fuel consumption over the manual throttle.

Seldner, K.↗

SOLON: An autonomous vehicle mission planner

The State-Operator Logic Machine (SOLON) Planner provides an architecture for effective real-time planning and replanning for an autonomous vehicle. The highlights of the system, which distinguish it from other AI-based planners that have been designed previously, are its hybrid application of state-driven control architecture and the use of both schematic representations and logic programming for the management of its knowledge base. SOLON is designed to provide multiple levels of planning for a single autonomous vehicle which is supplied with a skeletal, partially-specified mission plan at the outset of the vehicle's operations. This mission plan consists of a set of objectives, each of which will be decomposable by the planner into tasks. These tasks are themselves comparatively complex sets of actions which are executable by a conventional real-time control system which does not perform planning but which is capable of making adjustments or modifications to the provided tasks according to constraints and tolerances provided by the Planner. The current implementation of the SOLON is in the form of a real-time simulation of the Planner module of an Intelligent Vehicle Controller (IVC) on-board an autonomous underwater vehicle (AUV). The simulation is embedded within a larger simulator environment known as ICDS (Intelligent Controller Development System) operating on a Symbolics 3645/75 computer.

Dudziak, M. J.↗

A constraint-logic based implementation of the coarse-grained approach to data acquisition scheduling of the International Ultraviolet Explorer orbiting observatory

The International Ultraviolet Explorer (IUE) satellite observatory has been in operation continuously since 1978. It typically carries out several thousand observations per year for over a hundred different science projects. These observations, which can occur in one of four different data-taking modes, fall under several satellite-related constraints and many other constraints which derive from the science goals of the projects being undertaken. One strategy which has made the scheduling problem tractable has been that of 'coarse-graining' the time into discrete blocks of equal size (8 hours), each of which is devoted to a single science program, and each of which is sufficiently long for several observations to be carried out. We call it 'coarse-graining' because the schedule is done at a 'coarse' level which ignores fine structure; i.e., no attempt is made to plan the sequence of observations occurring within each time block. We have incorporated the IUE's coarse-grained approach in new software which examines the science needs of the observations and produces a limited set of alternative schedules which meet all of the instrument and science-related constraints. With this algorithm, the IUE can still be scheduled by a single person using a standard workstation, as it has been. We believe that this software could could be adapted to a more complex mission while retaining the IUE's high flexibility and efficiency and scientific return of future satellite missions.

Mccollum, Bruce↗

Utilization of common pressurized modules on the Space Station Freedom

During the preliminary design review of Space Station Freedom elements and subsystems, it was shown that reductions of cost, weight, and on-orbit integration and verification would be necessary in order to meet program constraints, particularly nominal Orbiter payload launch capability. At that time, the Baseline station consisted of four resource nodes and two 44 ft modules. In this study, the viability of a common module which maintains crew and payload accommodation is assessed. The size, transportation, and orientation of modules and the accommodation of system racks and user experiments are considered and compared to baseline. Based on available weight estimates, a module pattern consisting of six 28 ft. common elements with three radial and two end ports is shown to be nearly optimal. Advantageous characteristics include a reduction in assembly flights, dual egress from all elements, logical functional allocation, no adverse impacts to international partners, favorable airlock, cupola, ACRV (Assured Crew Return Vehicle), and logistics module accommodation, and desirable flight attitude and control characteristics.

Gould, Marston J.↗

Utilization of common pressurized modules on the Space Station Freedom

During the preliminary design review of Space Station Freedom elements and subsystems, it was shown that reductions of cost, weight, and on-orbit integration and verification would be necessary in order to meet program constraints, particularly nominal Orbiter payload launch capability. At that time, the Baseline station consisted of four resource nodes and two 44 ft modules. In this study, the viability of a common module which maintains crew and payload accommodation is assessed. The size, transportation, and orientation of modules and the accommodation of system racks and user experiments are considered and compared to baseline. Based on available weight estimates, a module pattern consisting of six 28 ft common elements with three radial and two end ports is shown to be nearly optimal. Advantageous characteristics include a reduction in assembly flights, dual egress from all elements, logical functional allocation, no adverse impacts to international partners, favorable airlock, cupola, ACRV (Assured Crew Return Vehicle), and logistics module accommodation, and desirable flight attitude and control characteristics.

Mazanek, Daniel D.↗

ISyCL technical report

The Air Force Integrated Information Systems Evolution Environment (IISEE) is a program focused on the development of technology for enabling the planning definition development and maintenance of evolutionary integrated information systems. This program has studied the representational needs of this knowledge base from the point of view of the needs of engineering, manufacturing, and logistics Evolutionary Information Systems (EIS). The definition of the concepts for a suite of automated tools and environments to support the pursuit of such engineering, manufacturing, and logistics EIS's has also required examination of languages and representation schemes for the knowledge base of these integrated systems. To accomplish this purpose, the language must be very rich, and must support object orientation, relational orientation, persistent storage, process transaction specification, and first order logic. The task of designing a unified language which supports these paradigms is a challenge. The Information Systems Constraint Language (ISyCL) is described. It was designed to meet the definitional and knowledge representation needs of three perspectives. It supports users from the area expert to the data base designer.

Decker, Louis P.↗

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, the necessity for path-adaptive guidance algorithms has become clear in order to provide the stability and customizability required for a safe and efficient descent to the lunar surface, while meeting specified program and vehicle constraints. Several descent algorithms have been tested and flown for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms for a two-stage descent vehicle. Due to the limited payload mass constraints of the existing fleet of launch vehicles, multi-stage descent architectures have become a viable course of action. This paper seeks to compare the performance of guidance configurations for a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a comparison baseline for the guidance algorithms tested. Time-to -go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Further work is to be completed on trajectory design trades as well as the effects of modifying guidance targets in simulation based on trajectories that are optimized for different performance indices.

Jason M Everett↗

A Vision and Roadmap for Increasing User Autonomy in Flight Operations in the National Airspace

The purpose of Air Transportation is to move people and cargo safely, efficiently and swiftly to their destinations. The companies and individuals who use aircraft for this purpose, the airspace users, desire to operate their aircraft according to a dynamically optimized business trajectory for their specific mission and operational business model. In current operations, the dynamic optimization of business trajectories is limited by constraints built into operations in the National Airspace System (NAS) for reasons of safety and operational needs of the air navigation service providers. NASA has been developing and testing means to overcome many of these constraints and permit operations to be conducted closer to the airspace user's changing business trajectory as conditions unfold before and during the flight. A roadmap of logical steps progressing toward increased user autonomy is proposed, beginning with NASA's Traffic Aware Strategic Aircrew Requests (TASAR) concept that enables flight crews to make informed, deconflicted flight-optimization requests to air traffic control. These steps include the use of data communications for route change requests and approvals, integration with time-based arrival flow management processes under development by the Federal Aviation Administration (FAA), increased user authority for defining and modifying downstream, strategic portions of the trajectory, and ultimately application of self-separation. This progression takes advantage of existing FAA NextGen programs and RTCA standards development, and it is designed to minimize the number of hardware upgrades required of airspace users to take advantage of these advanced capabilities to achieve dynamically optimized business trajectories in NAS operations. The roadmap is designed to provide operational benefits to first adopters so that investment decisions do not depend upon a large segment of the user community becoming equipped before benefits can be realized. The issues of equipment certification and operational approval of new procedures are addressed in a way that minimizes their impact on the transition by deferring a change in the assignment of separation responsibility until a large body of operational data is available to support the safety case for this change in the last roadmap step.This paper will relate the roadmap steps to ongoing activities to clarify the economics-based transition to these technologies for operational use.

Cotton, William B.↗

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, explicit, path-adaptive descent guidance algorithms must provide the stability and customizability required for a safe and efficient descent to the lunar surface, while also meeting program and vehicle constraints. Several descent algorithms have been flown and tested for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms to a two-stage descent vehicle. Due to payload mass and fairing constraints of the existing fleet of launch vehicles, multi-stage descent architectures are a unique option for achieving the greatest possible mass to lunar surface. This paper seeks to compare the performance of guidance configurations of a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a baseline to compare the guidance algorithms tested. Time-to-go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Preliminary results are presented that show relative performance metrics for a range of different guidance algorithm configurations.

Jason M Everett↗

AST Critical Propulsion and Noise Reduction Technologies for Future Commercial Subsonic Engines Area of Interest 1.0: Reliable and Affordable Control Systems

The General Electric Reliable and Affordable Controls effort under the NASA Advanced Subsonic Technology (AST) Program has designed, fabricated, and tested advanced controls hardware and software to reduce emissions and improve engine safety and reliability. The original effort consisted of four elements: 1) a Hydraulic Multiplexer; 2) Active Combustor Control; 3) a Variable Displacement Vane Pump (VDVP); and 4) Intelligent Engine Control. The VDVP and Intelligent Engine Control elements were cancelled due to funding constraints and are reported here only to the state they progressed. The Hydraulic Multiplexing element developed and tested a prototype which improves reliability by combining the functionality of up to 16 solenoids and servo-valves into one component with a single electrically powered force motor. The Active Combustor Control element developed intelligent staging and control strategies for low emission combustors. This included development and tests of a Controlled Pressure Fuel Nozzle for fuel sequencing, a Fuel Multiplexer for individual fuel cup metering, and model-based control logic. Both the Hydraulic Multiplexer and Controlled Pressure Fuel Nozzle system were cleared for engine test. The Fuel Multiplexer was cleared for combustor rig test which must be followed by an engine test to achieve full maturation.

Myers, William↗

Constraint Optimization Problem For The Cutting Of A Cobalt Chrome Refractory Material

This paper shows a complete approach to solve a given problem, from the experimentation to the optimization of different cutting parameters. In response to an industrial problem of slotting FSX 414, a Cobalt-based refractory material, we have implemented a design of experiment to determine the most influent parameters on the tool life, the surface roughness and the cutting forces. After theses trials, an optimization approach has been implemented to find the lowest manufacturing cost while respecting the roughness constraints and cutting force limitation constraints. The optimization approach is based on the Response Surface Method (RSM) using the Sequential Quadratic programming algorithm (SQP) for a constrained problem. To avoid a local optimum and to obtain an accurate solution at low cost, an efficient strategy, which allows improving the RSM accuracy in the vicinity of the global optimum, is presented. With these models and these trials, we could apply and compare our optimization methods in order to get the lowest cost for the best quality, i.e. a satisfying surface roughness and limited cutting forces.

36 MATERIALS SCIENCE↗

Propulsion Health Management System Development for Affordable and Reliable Operation of Space Exploration Systems

The constraints of future Exploration Missions will require unique integrated system health management capabilities throughout the mission. An ambitious launch schedule, human-rating requirements, long quiescent periods, limited human access for repair or replacement, and long communication delays, all require an integrated approach to health management that can span distinct, yet interdependent vehicle subsystems, anticipate failure states, provide autonomous remediation and support the Exploration Mission from beginning to end. Propulsion is a critical part of any space exploration mission, and monitoring the health of the propulsion system is an integral part of assuring mission safety and success. Health management is a somewhat ubiquitous technology that encompasses a large spectrum of physical components and logical processes. For this reason, it is essential to develop a systematic plan for propulsion health management system development. This paper provides a high-level perspective of propulsion health management systems, and describes a logical approach for the future planning and early development that are crucial to planned space exploration programs. It also presents an overall approach, or roadmap, for propulsion health management system development and a discussion of the associated roadblocks and challenges.

Melcher, Kevin J.↗

Teuchos C++ memory management classes, idioms, and related topics, the complete reference : a comprehensive strategy for safe and efficient memory management in C++ for high performance computing.

The ubiquitous use of raw pointers in higher-level code is the primary cause of all memory usage problems and memory leaks in C++ programs. This paper describes what might be considered a radical approach to the problem which is to encapsulate the use of all raw pointers and all raw calls to new and delete in higher-level C++ code. Instead, a set of cooperating template classes developed in the Trilinos package Teuchos are used to encapsulate every use of raw C++ pointers in every use case where it appears in high-level code. Included in the set of memory management classes is the typical reference-counted smart pointer class similar to boost::shared ptr (and therefore C++0x std::shared ptr). However, what is missing in boost and the new standard library are non-reference counted classes for remaining use cases where raw C++ pointers would need to be used. These classes have a debug build mode where nearly all programmer errors are caught and gracefully reported at runtime. The default optimized build mode strips all runtime checks and allows the code to perform as efficiently as raw C++ pointers with reasonable usage. Also included is a novel approach for dealing with the circular references problem that imparts little extra overhead and is almost completely invisible to most of the code (unlike the boost and therefore C++0x approach). Rather than being a radical approach, encapsulating all raw C++ pointers is simply the logical progression of a trend in the C++ development and standards community that started with std::auto ptr and is continued (but not finished) with std::shared ptr in C++0x. Using the Teuchos reference-counted memory management classes allows one to remove unnecessary constraints in the use of objects by removing arbitrary lifetime ordering constraints which are a type of unnecessary coupling [23]. The code one writes with these classes will be more likely to be correct on first writing, will be less likely to contain silent (but deadly) memory usage errors, and will be much more robust to later refactoring and maintenance. The level of debug-mode runtime checking provided by the Teuchos memory management classes is stronger in many respects than what is provided by memory checking tools like Valgrind and Purify while being much less expensive. However, tools like Valgrind and Purify perform a number of types of checks (like usage of uninitialized memory) that makes these tools very valuable and therefore complement the Teuchos memory management debug-mode runtime checking. The Teuchos memory management classes and idioms largely address the technical issues in resolving the fragile built-in C++ memory management model (with the exception of circular references which has no easy solution but can be managed as discussed). All that remains is to teach these classes and idioms and expand their usage in C++ codes. The long-term viability of C++ as a usable and productive language depends on it. Otherwise, if C++ is no safer than C, then is the greater complexity of C++ worth what one gets as extra features? Given that C is smaller and easier to learn than C++ and since most programmers don't know object-orientation (or templates or X, Y, and Z features of C++) all that well anyway, then what really are most programmers getting extra out of C++ that would outweigh the extra complexity of C++ over C? C++ zealots will argue this point but the reality is that C++ popularity has peaked and is becoming less popular while the popularity of C has remained fairly stable over the last decade22. Idioms like are advocated in this paper can help to avert this trend but it will require wide community buy-in and a change in the way C++ is taught in order to have the greatest impact. To make these programs more secure, compiler vendors or static analysis tools (e.g. klocwork23) could implement a preprocessor-like language similar to OpenMP24 that would allow the programmer to declare (in comments) that certain blocks of code should be ''pointer-free'' or allow smaller blocks to be 'pointers allowed'. This would significantly improve the robustness of code that uses the memory management classes described here.

99 GENERAL AND MISCELLANEOUS↗