Search NASA⌕ Search

SEARCH · Search NASA

Results for “admission control”

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 19 records

Controlled Nonlinear Stochastic Delay Equations: Part I: Modeling and Approximations

This two-part paper deals with 'foundational' issues that have not been previously considered in the modeling and numerical optimization of nonlinear stochastic delay systems. There are new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. There are two basic and interconnected themes for these models. The first, dealt with in this part, concerns the definition of admissible control. The classical definition of an admissible control as a nonanticipative relaxed control is inadequate for these models and needs to be extended. This is needed for the convergence proofs of numerical approximations for optimal controls as well as to have a well-defined model. It is shown that the new classes of admissible controls do not enlarge the range of the value functions, is closed (together with the associated paths) under weak convergence, and is approximatable by ordinary controls. The second theme, dealt with in Part II, concerns transportation equation representations, and their role in the development of numerical algorithms with much reduced memory and computational requirements.

97 MATHEMATICS AND COMPUTING↗

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗

Axial-slot Air Admission for Controlling Performance of a One-quarter-annulus Turbojet Combustor and Comparison with Complete Engine

An investigation of a single-annulus turbojet combustor with slot-type air admission was conducted to demonstrate the application of certain design principles to the control of outlet-gas temperature distributions. Comparisons of performance of a one-quarter-annulus combustor (duct-type installation) and a full-annulus combustor (obtained in a full-scale turbojet engine) are presented to indicate the applicability of results obtained from combustion studies conducted in duct-type installations. A reasonable correlation existed between the performance of the one-quarter-annulus and full-annulus combustors except for temperature distribution. Sufficient trends did exist which made it possible to predict temperature distributions for the engine, although absolute correlation did not exist. A radial temperature distribution similar to that required for a given engine was obtained using a one-quarter-annulus duct-type setup to predict results.

COMBUSTION--TURBINE ENGINES↗

On incorporating reliability considerations into control system designs

This paper considers reliability in designing control systems for large orbital structures that are expected to have appreciable flexibility. Reliability is considered for both the control configuration (i.e. selecting sensor and actuator locations over an admissible set) and the ultimate operation of the system. The approach presented is to construct a cost function that indicates the absolute goal of the system and, for a given structural design, to determine the lowest achievable costs conditioned on the failure states of the system (i.e. which actuators and sensors are operational). These costs are then weighted and summed to provide an overall system performance measure. This measure is then minimized over the set of admissible control configurations. The approach is illustrated using a beam that has four actuators with the goal of achieving a given parabolic shape.

Montgomery, R. C.↗

A genetic technique for planning a control sequence to navigate the state space with a quasi-minimum-cost output trajectory for a non-linear multi-dimnensional system

There are many multi-stage optimization problems that are not easily solved through any known direct method when the stages are coupled. For instance, we have investigated the problem of planning a vehicle's control sequence to negotiate obstacles and reach a goal in minimum time. The vehicle has a known mass, and the controlling forces have finite limits. We have developed a technique that finds admissible control trajectories which tend to minimize the vehicle's transit time through the obstacle field. The immediate applications is that of a space robot which must rapidly traverse around 2-or-3 dimensional structures via application of a rotating thruster or non-rotating on-off for such vehicles is located at the Marshall Space Flight Center in Huntsville Alabama. However, it appears that the development method is applicable to a general set of optimization problems in which the cost function and the multi-dimensional multi-state system can be any nonlinear functions, which are continuous in the operating regions. Other applications included the planning of optimal navigation pathways through a transversability graph; the planning of control input for under-water maneuvering vehicles which have complex control state-space relationships; the planning of control sequences for milling and manufacturing robots; the planning of control and trajectories for automated delivery vehicles; and the optimization and athletic training in slalom sports.

Hein, C.↗

Control Improvement for Jump-Diffusion Processes with Applications to Finance

We consider stochastic control problems with jump-diffusion processes and formulate an algorithm which produces, starting from a given admissible control {pi}, a new control with a better value. If no improvement is possible, then {pi} is optimal. Such an algorithm is well-known for discrete-time Markov Decision Problems under the name Howard's policy improvement algorithm. The idea can be traced back to Bellman. Here we show with the help of martingale techniques that such an algorithm can also be formulated for stochastic control problems with jump-diffusion processes. As an application we derive some interesting results in financial portfolio optimization.

97 MATHEMATICS AND COMPUTING↗

Existence of the time optimal control for robotic manipulators

Using Filipov's Theorem, it is shown that the conditions oif nonfinite escape of trajectories, reachability, and convexity of the dynamics over all admissible controls are needed for the existence of a time optimal solution for the robotic equation. With a lower bound for the finite-escape time established using a Liapunov approach, and an upper bound for the time to reach the target established using the exact linearization idea, a single inequality is found which is closely related to the coriolis and the centrifugal terms, the absence of which implies that the domain of existence of the optimal solution can be made arbitrarily large with a large torque constraint. As the work space is finite, this is essentially a global result in practical situations.

Wen, J.↗

Optimal Time Advance In Terminal Area Arrivals: Throughput vs. Fuel Savings

The current operational practice in scheduling air traffic arriving at an airport is to adjust flight schedules by delay, i.e. a postponement of an aircrafts arrival at a scheduled location, to manage safely the FAA-mandated separation constraints between aircraft. To meet the observed and forecast growth in traffic demand, however, the practice of time advance (speeding up an aircraft toward a scheduled location) is envisioned for future operations as a practice additional to delay. Time advance has two potential advantages. The first is the capability to minimize, or at least reduce, the excess separation (the distances between pairs of aircraft immediately in-trail) and thereby to increase the throughput of the arriving traffic. The second is to reduce the total traffic delay when the traffic sample is below saturation density. A cost associated with time advance is the fuel expenditure required by an aircraft to speed up. We present an optimal control model of air traffic arriving in a terminal area and solve it using the Pontryagin Maximum Principle. The admissible controls allow time advance, as well as delay, some of the way. The cost function reflects the trade-off between minimizing two competing objectives: excess separation (negatively correlated with throughput) and fuel burn. A number of instances are solved using three different methods, to demonstrate consistency of solutions.

Sadovsky, Alexander V .↗

Reachable sets for linear dynamical systems.

The properties of reachable sets for linear dynamical systems for specified control sets are discussed. Iterative procedures for determining numerical approximations of the reachable set are suggested and methods of obtaining an admissible control function which transfers an initial state to as near a prescribed target as possible is described. The problem of reachability with multiple control constraints is discussed and certain aspects of reachability for time-invariant systems with adjustable parameters is considered.

Pecsvaradi, T.↗

Time dependent optimal switching controls in online selling models

We present a method to incorporate dishonesty in online selling via a stochastic optimal control problem. In our framework, the seller wishes to maximize her average wealth level W at a fixed time T of her choosing. The corresponding Hamilton-Jacobi-Bellmann (HJB) equation is analyzed for a basic case. For more general models, the admissible control set is restricted to a jump process that switches between extreme values. We propose a new approach, where the optimal control problem is reduced to a multivariable optimization problem.

99 GENERAL AND MISCELLANEOUS↗

Relationship Between MP and DPP for the Stochastic Optimal Control Problem of Jump Diffusions

This paper is concerned with the stochastic optimal control problem of jump diffusions. The relationship between stochastic maximum principle and dynamic programming principle is discussed. Without involving any derivatives of the value function, relations among the adjoint processes, the generalized Hamiltonian and the value function are investigated by employing the notions of semijets evoked in defining the viscosity solutions. Stochastic verification theorem is also given to verify whether a given admissible control is optimal.

97 MATHEMATICS AND COMPUTING↗

Obtaining and Managing Answer Quality for Online Data-Intensive Services

Online data-intensive (OLDI) services use anytime algorithms to compute over large amounts of data and respond quickly. Interactive response times are a priority, so OLDI services parallelize query execution across distributed software components and return best effort answers based on the data so far processed. Omitted data from slow components could lead to better answers, but tracing online how much better the answers could be is difficult. Here, we introduce Ubora, a design method to measure the effect of slow-running components on the quality of answers. Ubora randomly samples online queries and executes them a second time. The first online execution omits data from slow components and provides interactive answers. The second execution uses mature results from intermediate components completed after the online execution finishes. Ubora uses memoization to speed up mature executions by replaying network messages exchanged between components. Our systems-level implementation works for a wide range of services, including Hadoop/Yarn, Apache Lucene, the EasyRec Recommendation Engine, and the OpenEphyra question-answering system. Ubora computes answer quality with more mature executions per second than competing approaches that do not use memoization. With Ubora, we illustrate that answer quality is effective at guiding online admission control. While achieving the same answer quality on high-priority queries, our adaptive controller had 55% higher peak throughput on low-priority queries than a competing controller guided by the rate of timeouts.

answer quality↗

Advance reservation access control using software-defined networking and tokens

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.

admission control↗

Integrated Dynamic Facade Control with an Agent-based Architecture for Commercial Buildings

Dynamic façades have significant technical potential to minimize heating, cooling, and lighting energy use and peak electric demand in the perimeter zone of commercial buildings, but the performance of these systems is reliant on being able to balance complex trade-offs between solar control, daylight admission, comfort, and view over the life of the installation. As the context for controllable energy-efficiency technologies grows more complex with the increased use of intermittent renewable energy resources on the grid, it has become increasingly important to look ahead towards more advanced approaches to integrated systems control in order to achieve optimum life-cycle performance at a lower cost. This study examines the feasibility of a model predictive control system for low-cost autonomous dynamic façades. A system architecture designed around lightweight, simple agents is proposed. The architecture accommodates whole building and grid level demands through its modular, hierarchical approach. Automatically-generated models for computing window heat gains, daylight illuminance, and discomfort glare are described. The open source Modelica and JModelica software tools were used to determine the optimum state of control given inputs of window heat gains and lighting loads for a 24-hour optimization horizon. Penalty functions for glare and view/ daylight quality were implemented as constraints. The control system was tested on a low-power controller (1.4 GHz single core with 2 GB of RAM) to evaluate feasibility. The target platform is a low-cost ($35/unit) embedded controller with 1.2 GHz dual-core cpu and 1 GB of RAM. Configuration and commissioning of the curtainwall unit was designed to be largely plug and play with minimal inputs required by the manufacturer through a web-based user interface. An example application was used to demonstrate optimal control of a three-zone electrochromic window for a south-facing zone. The overall approach was deemed to be promising. Further engineering is required to enable scalable, turnkey solutions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Electric actuator modification on a turbine driven feed pump at Calvert Cliffs nuclear power plant - 296

Feedwater systems are a leading contributor to unit SCRAMs as indicated by the 2015 INPO data, where 9 of the 51 SCRAMs recorded were a result of feedwater issues. Digital feedwater control systems and enhanced feed pump control modifications can greatly improve performance and control of the plant feedwater systems and help drive down the potential for reactivity management events and unit SCRAMs. Westinghouse has a strong background in the implementation of digital feedwater control systems, and in planning for a recently completed feedwater control system upgrade at Calvert Cliffs, the Westinghouse team worked with Calvert Cliffs to design a solution to a number of common operational issues. Primarily, improving feedwater control over the entire operating range, eliminating single points of vulnerability (SPV) in the feedwater/feed pump systems and eliminating operational issues with the feed pump steam admission valve hydraulic control oil system. A robust first-of-a-kind design and implementation program was undertaken to split the existing hydraulic valve gear actuator with separate electric actuators. Westinghouse worked with Calvert Cliffs and Emerson Process Management (EPM) to install and commission General Electric (GE) feed pump turbines with separate electric actuators for the high-pressure (HP) and low-pressure (LP) steam admission valves. This successful mechanical and control modification was a first for both the nuclear and non-nuclear power generation industries. Westinghouse is working with a number of other utilities to implement similar modifications for PWR and BWR feed pump applications. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Endocrine and fluid metabolism in males and females of different ages after bedrest, acceleration and lower body negative pressure

Space shuttle flight simulations were conducted to determine the effects of weightlessness, lower body negative pressure (LBNP), and acceleration of fluid and electrolyte excretion and the hormones that control it. Measurements were made on male and female subjects of different ages before and after bedrest. After admission to a controlled environment, groups of 6 to 14 subjects in the age ranges 25 to 35, 35 to 45, 45 to 55 to 65 years were exposed to +3 G sub z for 15 minutes (G1) and to LBNP (LBNP1) on different days. On 3 days during this prebedrest period, no tests were conducted. Six days of bedrest followed, and the G sub z (G2) and LBNP (LBNP2) tests were run again. Hormones, electrolytes, and other parameters were measured in 24-hour urine pools throughout the experiment. During bedrest, cortisol and aldosterone excretion increased. Urine volume decreased, and specific gravity and osmolality increased. Urinary electrolytes were statistically unchanged from levels during the non-stress control period. During G2, cortisol increased significantly over its control and bedrest levels. Urine volume, sodium, and chloride were significantly lower; specific gravity and osmolality were higher during the control period or bedrest. The retention of fluids and electrolytes after +G sub z may at least partially explain decreased urine volume and increased osmolality observed during bedrest in this study. There were some who indicated that space flight would not affect the fluid and electrolyte metabolism of females or older males any more severely than it has affected that of male astronauts.

Leach, C. S.↗

Distributed Transient Safety Verification via Robust Control Invariant Sets: A Microgrid Application

Modern safety-critical energy infrastructures are increasingly operated in a hierarchical and modular control framework which allows for limited data exchange between the modules. In this context, it is important for each module to synthesize and communicate constraints on the values of exchanged information in order to assure system-wide safety. To ensure transient safety in inverter-based microgrids, we develop a set invariance-based distributed safety verification algorithm for each inverter module. Applying Nagumo's invariance condition, we construct a robust polynomial optimization problem to jointly search for safety-admissible set of control set-points and design parameters, under allowable disturbances from neighbors. We use sum-of-squares (SOS) programming to solve the verification problem and we perform numerical simulations using grid-forming inverters to illustrate the algorithm.

Bouvier, Jean-Baptiste H.↗