SEARCH · Engineering Papers

Results for “constraint handling”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Computational issues in control-structure interaction analysis

This paper surveys computational issues for large-scale simulation of dynamics and controls of space structures, which involve structural elements that are capable of large combined rigid and flexible motions, accurate and efficient treatment of constraints, robust integration of both translational and large rotational motions in the equations of motion, modular interface with active control synthesis packages, and a capability from wave motions to slowly varying transient responses. A particular feature of the present survey is a partitioned solution (or divide-and-conquer) procedure that can handle the numerical solution of multidisciplinary simulation problems by relying on individual modular solution packages that treat each aspect of simulation requirements.

Park, K. C.↗

NASA NTRS2009

Objectives and Progress on Ground Vibration Testing for the Ares Launch Vehicles

NASA has conducted dynamic tests on each of its major launch vehicles during the past 45 years. Each test has provided invaluable data to correlate and correct analytical models used to predict structural responses to differing dynamics for these vehicles. With both Saturn V and Space Shuttle, hardware changes were also required to the flight vehicles to ensure crew and vehicle safety. The Ares I IVGVT will undoubtedly provide similar valuable test data to support successful flights of the Constellation Program. The IVGVT will provide test determined natural frequencies, mode shapes and damping for the Ares I. This data will be used to support controls analysis by providing this test data to reduce uncertainty in the models. The value of this testing has been proven by past launch vehicle successes and failures. Performing dynamic testing on the Ares vehicles will provide confidence that the launch vehicles will be safe and successful in their missions. In addition, IVGVT will provide the following benefits for the Ares rockets: a) IVGVT data along with Ares development flights like Ares I-X, Ares I-Y, Ares I-X Prime, and Orion-1 or others will reduce the risk to the Orion-2 crew. IVGVT will permit anchoring the various analytical and operational models used in so many different aspects of Ares operations. b) IVGVT data will permit better understanding of the structural and GN&C margins of the spacecraft and may permit mass savings or expanded day-of-launch opportunities or fewer constraints to launch. c) Undoubtedly IVGVT will uncover some of the "unknown unknowns" so often seen in developing, launching, and flying new spacecraft vehicles and data from IVGVT may help prevent a loss of vehicle or crew. d) IVGVT also will be the first time Ares I flight-like hardware is transported, handled, rotated, mated, stacked, and integrated. e) Furthermore, handling and stacking the IVGVT launch vehicle stacks will be an opportunity to understand certain aspects of vehicle operability much better (for example, handling procedures, touch-labor time to accomplish tasks, access at interfaces, access to stage mating bolts, access to avionics boxes, access to the Interstage, GSE functionality, and many other important aspects of Ares I operability). All of these results will provide for better vehicle safety and better stewardship of national resources as NASA begins its next phase of human space exploration.

Tuma, Margaret L.↗

DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1975

Terminal area considerations for an advanced CTOL transport aircraft

Projected future conditions at large urban airports were used to identify design objectives for a long-haul, advanced transport airplane introduced for operation in the mid-1980s. Operating constraints associated with airport congestion and aircraft noise and emissions were of central interest. In addition, some of the interaction of these constraints with aircraft fuel usage were identified. The study allowed for advanced aircraft design features consistent with the future operating period. A baseline 200 passenger airplane design was modified to comply with design requirements imposed by terminal area constraints. Specific design changes included: (1) modification of engine arrangement; wing planform; (2) drag and spoiler surfaces; (3) secondary power systems; (4) brake and landing gear characteristics; and (5) the aircraft avionics. These changes, based on exploratory design estimates and allowing for technology advance, were judged to enable the airplane to: reduce wake turbulence; handle steeper descent paths with fewer limitation due to engine characteristics; reduce runway occupancy times; improve community noise contours; and reduce the total engine emittants deposited in the terminal area. The penalties to airplane performance and operating cost associated with improving the terminal area characteristics of the airplane were assessed. Finally, key research problems requiring solution in order to validate the assumed advanced airplane technology were identified.

Sussman, M. B.↗

NASA NTRS1988

Space station payload operations scheduling with ESP2

The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center is developing a system of programs to handle all aspects of scheduling payload operations for Space Station. The Expert Scheduling Program (ESP2) is the heart of this system. The task of payload operations scheduling can be simply stated as positioning the payload activities in a mission so that they collect their desired data without interfering with other activities or violating mission constraints. ESP2 is an advanced version of the Experiment Scheduling Program (ESP) which was developed by the Mission Integration Branch beginning in 1979 to schedule Spacelab payload activities. The automatic scheduler in ESP2 is an expert system that embodies the rules that expert planners would use to schedule payload operations by hand. This scheduler uses depth-first searching, backtracking, and forward chaining techniques to place an activity so that constraints (such as crew, resources, and orbit opportunities) are not violated. It has an explanation facility to show why an activity was or was not scheduled at a certain time. The ESP2 user can also place the activities in the schedule manually. The program offers graphical assistance to the user and will advise when constraints are being violated. ESP2 also has an option to identify conflict introduced into an existing schedule by changes to payload requirements, mission constraints, and orbit opportunities.

Stacy, Kenneth L.↗

NASA NTRS2007

Agent Based Intelligence in a Tetrahedral Rover

A tetrahedron is a 4-node 6-strut pyramid structure which is being used by the NASA - Goddard Space Flight Center as the basic building block for a new approach to robotic motion. The struts are extendable; it is by the sequence of activities: strut-extension, changing the center of gravity and falling that the tetrahedron "moves". Currently, strut-extension is handled by human remote control. There is an effort underway to make the movement of the tetrahedron autonomous, driven by an attempt to achieve a goal. The approach being taken is to associate an intelligent agent with each node. Thus, the autonomous tetrahedron is realized as a constrained multi-agent system, where the constraints arise from the fact that between any two agents there is an extendible strut. The hypothesis of this work is that, by proper composition of such automated tetrahedra, robotic structures of various levels of complexity can be developed which will support more complex dynamic motions. This is the basis of the new approach to robotic motion which is under investigation. A Java-based simulator for the single tetrahedron, realized as a constrained multi-agent system, has been developed and evaluated. This paper reports on this project and presents a discussion of the structure and dynamics of the simulator.

Phelps, Peter↗

NASA NTRS2010

Single-Receiver GPS Phase Bias Resolution

Existing software has been modified to yield the benefits of integer fixed double-differenced GPS-phased ambiguities when processing data from a single GPS receiver with no access to any other GPS receiver data. When the double-differenced combination of phase biases can be fixed reliably, a significant improvement in solution accuracy is obtained. This innovation uses a large global set of GPS receivers (40 to 80 receivers) to solve for the GPS satellite orbits and clocks (along with any other parameters). In this process, integer ambiguities are fixed and information on the ambiguity constraints is saved. For each GPS transmitter/receiver pair, the process saves the arc start and stop times, the wide-lane average value for the arc, the standard deviation of the wide lane, and the dual-frequency phase bias after bias fixing for the arc. The second step of the process uses the orbit and clock information, the bias information from the global solution, and only data from the single receiver to resolve double-differenced phase combinations. It is called "resolved" instead of "fixed" because constraints are introduced into the problem with a finite data weight to better account for possible errors. A receiver in orbit has much shorter continuous passes of data than a receiver fixed to the Earth. The method has parameters to account for this. In particular, differences in drifting wide-lane values must be handled differently. The first step of the process is automated, using two JPL software sets, Longarc and Gipsy-Oasis. The resulting orbit/clock and bias information files are posted on anonymous ftp for use by any licensed Gipsy-Oasis user. The second step is implemented in the Gipsy-Oasis executable, gd2p.pl, which automates the entire process, including fetching the information from anonymous ftp

Bertiger, William I.↗

NASA NTRS2011

Minimum Landing Error Powered-Descent Guidance for Planetary Missions

An algorithm improves the accuracy with which a lander can be delivered to the surface of Mars. The main idea behind this innovation is the use of a lossless convexification, which converts an otherwise non-convex constraint related to thruster throttling to a convex constraint, enabling convex optimization to be used. The convexification leads directly to an algorithm that guarantees finding the global optimum of the original nonconvex optimization problem with a deterministic upper bound on the number of iterations required for convergence. In this innovation, previous work in powered-descent guidance using convex optimization is extended to handle the case where the lander must get as close as possible to the target given the available fuel, but is not required to arrive exactly at the target. The new algorithm calculates the minimum-fuel trajectory to the target, if one exists, and calculates the trajectory that minimizes the distance to the target if no solution to the target exists. This approach poses the problem as two Second-Order Cone Programs, which can be solved to global optimality with deterministic bounds on the number of iterations required.

Blackmore, Lars↗

NASA NTRSDate not supplied

Multirotor Configuration Trades Informed by Handling Qualities for Urban Air Mobility Application

Many contemporary Advanced Air Mobility (AAM), and more specifically, urban air mobility (UAM) vehicle designers are attracted to variable rotor speed-controlled designs with multiple rotors because of the great potential for mass savings compared to more traditional, variable blade pitch-controlled vehicles. These designs are based on the assumption that the stability and control of recreation or basic utility-sized drones can be scaled to larger passenger-sized vehicles. Previous work had shown the challenges in stabilizing passenger-sized quadcopters. In this study, power constraints were made less restrictive and varied, allowing more control power. Motor parameters such as efficiency, nominal voltage and current operating point, and rise time of the rotor speed controller step response were studied. By fixing the efficiency of the motor to 95% and assuming a motor voltage to current ratio of 2.0 (previously, assumed to be 1.0), the authors were able to stabilize the quadcopter in the roll axis because this allowed the vehicle to achieve adequate rise times between 0.4 and 0.8 s. This motor optimization was extended to a hexacopter and octocopter designed to the same payload size and mission as the quadcopter. The three vehicle configurations and their motor speed controllers were compared. It was found that while hexacopter and octocopter required more mass and overall power; all three configurations had similar margins required for control. However, the hexacopter and octocopter were able to use this power margin to achieve lower rise times (i.e. the vehicle responded more quickly to pilot inputs) than the quadcopter, with the octocopter having the lowest rotor response rise time of the three vehicle configurations studied.

Multirotor↗

NASA NTRS1991

Synthesis of robust nonlinear autopilots using differential game theory

A synthesis technique for handling unmodeled disturbances in nonlinear control law synthesis was advanced using differential game theory. Two types of modeling inaccuracies can be included in the formulation. The first is a bias-type error, while the second is the scale-factor-type error in the control variables. The disturbances were assumed to satisfy an integral inequality constraint. Additionally, it was assumed that they act in such a way as to maximize a quadratic performance index. Expressions for optimal control and worst-case disturbance were then obtained using optimal control theory.

Menon, P. K. A.↗

NASA NTRS2003

Enhancements to an Atmospheric Ascent Guidance Algorithm

Enhancements to an advanced ascent guidance algorithm for rocket-powered launch vehicles are described. A general method has been developed for conveniently and efficiently handling the common case of (asymmetric) launch vehicles with unbalanced thrust and aerodynamic moments. The new part of this development concerns the treatment of endo-atmospheric flight. An alternative method for handing the transversality conditions has been developed that eliminates the need for a priori elimination of the constant multipliers that adjoin the terminal state constraints to the performance index. As a result, new constraints can be formulated and implemented with relative ease. The problem of burn-coast-burn trajectory optimization is treated using a modified multiple shooting technique.

Dukeman, Greg A.↗

NASA NTRS2016

An Integrated Gate Turnaround Management Concept Leveraging Big Data Analytics for NAS Performance Improvements

"Gate Turnaround" plays a key role in the National Air Space (NAS) gate-to-gate performance by receiving aircraft when they reach their destination airport, and delivering aircraft into the NAS upon departing from the gate and subsequent takeoff. The time spent at the gate in meeting the planned departure time is influenced by many factors and often with considerable uncertainties. Uncertainties such as weather, early or late arrivals, disembarking and boarding passengers, unloading/reloading cargo, aircraft logistics/maintenance services and ground handling, traffic in ramp and movement areas for taxi-in and taxi-out, and departure queue management for takeoff are likely encountered on the daily basis. The Integrated Gate Turnaround Management (IGTM) concept is leveraging relevant historical data to support optimization of the gate operations, which include arrival, at the gate, departure based on constraints (e.g., available gates at the arrival, ground crew and equipment for the gate turnaround, and over capacity demand upon departure), and collaborative decision-making. The IGTM concept provides effective information services and decision tools to the stakeholders, such as airline dispatchers, gate agents, airport operators, ramp controllers, and air traffic control (ATC) traffic managers and ground controllers to mitigate uncertainties arising from both nominal and off-nominal airport gate operations. IGTM will provide NAS stakeholders customized decision making tools through a User Interface (UI) by leveraging historical data (Big Data), net-enabled Air Traffic Management (ATM) live data, and analytics according to dependencies among NAS parameters for the stakeholders to manage and optimize the NAS performance in the gate turnaround domain. The application will give stakeholders predictable results based on the past and current NAS performance according to selected decision trees through the UI. The predictable results are generated based on analysis of the unique airport attributes (e.g., runway, taxiway, terminal, and gate configurations and tenants), and combined statistics from past data and live data based on a specific set of ATM concept-of-operations (ConOps) and operational parameters via systems analysis using an analytic network learning model. The IGTM tool will then bound the uncertainties that arise from nominal and off-nominal operational conditions with direct assessment of the gate turnaround status and the impact of a certain operational decision on the NAS performance, and provide a set of recommended actions to optimize the NAS performance by allowing stakeholders to take mitigation actions to reduce uncertainty and time deviation of planned operational events. An IGTM prototype was developed at NASA Ames Simulation Laboratories (SimLabs) to demonstrate the benefits and applicability of the concept. A data network, using the System Wide Information Management (SWIM)-like messaging application using the ActiveMQ message service, was connected to the simulated data warehouse, scheduled flight plans, a fast-time airport simulator, and a graphic UI. A fast-time simulation was integrated with the data warehouse or Big Data/Analytics (BAI), scheduled flight plans from Aeronautical Operational Control AOC, IGTM Controller, and a UI via a SWIM-like data messaging network using the ActiveMQ message service, illustrated in Figure 1, to demonstrate selected use-cases showing the benefits of the IGTM concept on the NAS performance.

Efficent ATM systems↗

NASA NTRS2005

Planning with Continuous Resources in Stochastic Domains

We consider the problem of optimal planning in stochastic domains with metric resource constraints. Our goal is to generate a policy whose expected sum of rewards is maximized for a given initial state. We consider a general formulation motivated by our application domain--planetary exploration--in which the choice of an action at each step may depend on the current resource levels. We adapt the forward search algorithm AO* to handle our continuous state space efficiently.

Mausam, Mausau↗

DOE OSTI2022

DNN-based policies for stochastic AC OPF

We report a prominent challenge to the safe and optimal operation of the modern power grid arises due to growing uncertainties in loads and renewables. Stochastic optimal power flow (SOPF) formulations provide a mechanism to handle these uncertainties by computing dispatch decisions and control policies that maintain feasibility under uncertainty. Most SOPF formulations consider simple control policies such as affine policies that are mathematically simple and resemble many policies used in current practice. Motivated by the efficacy of machine learning (ML) algorithms and the potential benefits of general control policies for cost and constraint enforcement, we put forth a deep neural network (DNN)-based policy that predicts the generator dispatch decisions in real time in response to uncertainty. The weights of the DNN are learnt using stochastic primal–dual updates that solve the SOPF without the need for prior generation of training labels and can explicitly account for the feasibility constraints in the SOPF. The advantages of the DNN policy over simpler policies and their efficacy in enforcing safety limits and producing near optimal solutions are demonstrated in the context of a chance constrained formulation on a number of test cases.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2025

Optimal Control of Differentially Private EV Charging: A Scalable Learning Approach Under Uncertainty

Internet of Things (IoT)-enabled electric vehicles (IoEVs) enable intelligent charging coordination that accounts for grid congestion. However, increased data exchange raises privacy concerns, as charging patterns can reveal sensitive driver behavior to grid operators. Here, we propose a differentially private (DP) EV charging framework that enables coordinated control while protecting driver data with theoretical privacy guarantees. Nevertheless, integrating DP inevitably introduces uncertainty into the control strategy for EVs, which can lead to infeasible solutions. To tackle this challenge, we develop a feasible and scalable control algorithm based on constrained reinforcement learning (CRL) and convex hulls. While our framework is designed to handle the uncertainty introduced by DP, it is general and also applicable to other sources of uncertainty in EV charging, such as the stochastic nature of driver behavior and renewable variability. This ensures feasible and privacy-preserving coordination of EV charging at scale. Our method constructs convex hulls within the action space to guarantee feasibility under stochastic constraints and incorporates constraint reduction techniques to improve scalability. Case studies based on IEEE benchmark systems demonstrate that the proposed approach effectively balances feasibility under uncertainty, scalability, and privacy in large-scale EV charging control.

Engineering - Power transmission and distribution↗

NASA NTRS1989

An intelligent user interface for browsing satellite data catalogs

A large scale domain-independent spatial data management expert system that serves as a front-end to databases containing spatial data is described. This system is unique for two reasons. First, it uses spatial search techniques to generate a list of all the primary keys that fall within a user's spatial constraints prior to invoking the database management system, thus substantially decreasing the amount of time required to answer a user's query. Second, a domain-independent query expert system uses a domain-specific rule base to preprocess the user's English query, effectively mapping a broad class of queries into a smaller subset that can be handled by a commercial natural language processing system. The methods used by the spatial search module and the query expert system are explained, and the system architecture for the spatial data management expert system is described. The system is applied to data from the International Ultraviolet Explorer (IUE) satellite, and results are given.

Cromp, Robert F.↗

NASA NTRS1989

An intelligent user interface for browsing satellite data catalogs

Cromp, Robert F.↗

DOE OSTI2023

Pulse profile modelling of thermonuclear burst oscillations – II. Handling variability

ABSTRACT Pulse profile modelling is a relativistic ray-tracing technique that can be used to infer masses, radii, and geometric parameters of neutron stars. In a previous study, we looked at the performance of this technique when applied to thermonuclear burst oscillations from accreting neutron stars. That study showed that ignoring the variability associated with burst oscillation sources resulted in significant biases in the inferred mass and radius, particularly for the high count rates that are nominally required to obtain meaningful constraints. In this follow-on study, we show that the bias can be mitigated by slicing the bursts into shorter segments where variability can be neglected, and jointly fitting the segments. Using this approach, the systematic uncertainties on the mass and radius are brought within the range of the statistical uncertainty. With about 106 source counts, this yields uncertainties of approximately 10 per cent for both the mass and radius. However, this modelling strategy requires substantial computational resources. We also confirm that the posterior distributions of the mass and radius obtained from multiple bursts of the same source can be merged to produce outcomes comparable to that of a single burst with an equivalent total number of counts.

Astronomy & Astrophysics↗