Search NASASearch

SEARCH · Search NASA

Results for “distributed optimization”

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

Product Distributions for Distributed Optimization

With connections to bounded rational game theory, information theory and statistical mechanics, Product Distribution (PD) theory provides a new framework for performing distributed optimization. Furthermore, PD theory extends and formalizes Collective Intelligence, thus connecting distributed optimization to distributed Reinforcement Learning (FU). This paper provides an overview of PD theory and details an algorithm for performing optimization derived from it. The approach is demonstrated on two unconstrained optimization problems, one with discrete variables and one with continuous variables. To highlight the connections between PD theory and distributed FU, the results are compared with those obtained using distributed reinforcement learning inspired optimization approaches. The inter-relationship of the techniques is discussed.

Bieniawski, Stefan R.

A Scalable and Robust Multi-Agent Approach to Distributed Optimization

Modularizing a large optimization problem so that the solutions to the subproblems provide a good overall solution is a challenging problem. In this paper we present a multi-agent approach to this problem based on aligning the agent objectives with the system objectives, obviating the need to impose external mechanisms to achieve collaboration among the agents. This approach naturally addresses scaling and robustness issues by ensuring that the agents do not rely on the reliable operation of other agents We test this approach in the difficult distributed optimization problem of imperfect device subset selection [Challet and Johnson, 2002]. In this problem, there are n devices, each of which has a "distortion", and the task is to find the subset of those n devices that minimizes the average distortion. Our results show that in large systems (1000 agents) the proposed approach provides improvements of over an order of magnitude over both traditional optimization methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents fail midway through the simulation) the system remains coordinated and still outperforms a failure-free and centralized optimization algorithm.

Tumer, Kagan

Distributed Optimization

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

Macready, William

Comparison of joint space versus task force load distribution optimization for a multiarm manipulator system

It is often proposed that the redundancy in choosing a force distribution for multiple arms grasping a single object should be handled by minimizing a quadratic performance index. The performance index may be formulated in terms of joint torques or in terms of the Cartesian space force/torque applied to the body by the grippers. The former seeks to minimize power consumption while the latter minimizes body stresses. Because the cost functions are related to each other by a joint angle dependent transformation on the weight matrix, it might be argued that either method tends to reduce power consumption, but clearly the joint space minimization is optimal. A comparison of these two options is presented with consideration given to computational cost and power consumption. Simulation results using a two arm robot system are presented to show the savings realized by employing the joint space optimization. These savings are offset by additional complexity, computation time and in some cases processor power consumption.

Soloway, Donald I.

Spatial and temporal temperature distribution optimization for a geostationary antenna

The Geostationary Microwave Precipitation Radiometer antenna is considered and a thermal design analysis is performed to determine a design that would minimize on-orbit antenna temporal and spatial temperature gradients. The final design is based on an optically opaque radome which covered the antenna. The average orbital antenna temperature is found to be 9 C with maximum temporal and spatial variations of 34 C and 1 C, respectively. An independent thermal distortion analysis showed that this temporal variation would give an antenna figure error of 14 microns.

Tsuyuki, G.

Hamiltonian Optimal Control of Distributed Lagrangian Systems

This lecture presents a Hamiltonian control method and a distributed optimal control method for distributed Lagrangian systems. The distributed optimal control theory is formulated using a semi-group abstraction resulting in an integro-differential Riccati equation.

Distributed Optimal Control

Distributing structural optimization software between a mainframe and a minicomputer

This paper describes a distributed software system for solving large-scale structural optimization problems. Distributing the software between a mainframe computer and a minicomputer takes advantage of some of the best features available on each computer. The described software system consists of a finite element structural analysis computer program, a general purpose optimizer program, and several small user-supplied problem dependent programs. Comparison with a similar system executing entirely on the mainframe computer reveals that the distributed system costs less, uses computer resources more efficiently and improves production through faster turnaround and improved user control. The system interfaces with interactive graphics software for generating models and displaying the intermediate and final results

Rogers, J. L., Jr.

Optimized Entanglement Distribution Among Quantum Memories

We evaluate entanglement distribution performance when an optimized quantum memory encoding method is used for two sources, the standard spontaneous parametric down conversion source and the zero added loss multiplexing source. Physical non-idealities are considered.

Entanglement distribution

Optimal force distribution for payload positioning using a planar dual-arm robot

This paper presents a parameter optimization technique for deciding the force distribution on a payload being transported along a predetermined trajectory using two planar manipulator arms. The methodology begins by transforming the singular dynamics of two-arm transport to an ordinary set of differential equations and then proceeds to obtain a relation between the torques exerted by each arm. This relation is then used in a quadratic torque cost which is subsequently minimized to yield an optimal torque distribution. Significant savings in energy were found to occur when the arms were allowed to interact by transmission of forces through the payload. Even more significant are the savings found over one-arm transport of payloads where the arm torques are fixed by the prescribed trajectory.

Carignan, C. R.

Distributed Constrained Optimization with Semicoordinate Transformations

Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used to solve constrained optimization problems. This is done by translating the problem into an iterated game, where each agent controls a different variable of the problem, so that the joint probability distribution across the agents moves gives an expected value of the objective function. The dynamics of the agents is designed to minimize a Lagrangian function of that joint distribution. Here we illustrate how the updating of the Lagrange parameters in the Lagrangian is a form of automated annealing, which focuses the joint distribution more and more tightly about the joint moves that optimize the objective function. We then investigate the use of "semicoordinate" variable transformations. These separate the joint state of the agents from the variables of the optimization problem, with the two connected by an onto mapping. We present experiments illustrating the ability of such transformations to facilitate optimization. We focus on the special kind of transformation in which the statistically independent states of the agents induces a mixture distribution over the optimization variables. Computer experiment illustrate this for &sat constraint satisfaction problems and for unconstrained minimization of NK functions.

Macready, William

Lower neck injury criteria for THOR and Hybrid III dummies in rear impact

The objectives of the study are to derive lower-neck-injury probability curves under rear impact loading from matched pair Hybrid III and THOR dummy tests. Methods: Twelve whole-body and 15 isolated head-neck rear-impact sled tests were conducted using the 2 dummies. They were positioned on a rigid seat that was attached to an acceleration sled. The dummies were positioned with the head parallel to the ground, torso against the seat back, and legs stretched such that there was no axial rotation. The acceleration pulse matched the previous in-house human cadaver tests. The 6-axis lower-neck load cell was used in both dummies. For the isolated rear-impact tests,the head-neck was excised from the dummies, and the lower-neck load cell was mounted to the top of the sled with the head parallel to the ground and such that the acceleration vector was in the rear impact mode. Lower-neck loads and lower-neck-injury criteria (LNij) were obtained using the load cell data and survival analysis to develop injury-assessment-risk values and curves for both dummies. The LNij criteria were determined for both dummies using the intercept value corresponding to the 90% probability level for the forces and moments. Results: The log normal and Weibull distributions were the optimal distributions for the Hybrid III and THOR devices. At the 50% risk level, the mean LNij of 1.1 and NCIS was 0.77 for the Hybrid III, and 1.5 NCIS was 0.30 for the THOR device. The quality indices were in the fair range and good range for the 2 dummies, respectively, at this risk level. Conclusions: The lower-neck-based IARCs and IARVs serve as the first dataset for injury assessments, and the THOR may be a better test device for assessing injures in rear impact environments.

Narayan Yoganandan

Conceptual Design of a Counter-Rotating Fan System for Distributed Boundary Layer Ingesting Propulsion

The present paper details the design of the counter rotating fans for a Turboelectric Distributed Propulsion (TeDP) system. Sixteen propulsors installed in mail-slot-shape nacelles are embedded on an aerodynamically optimized hybrid wing-body configuration. The hybrid-wing/body (HWB) configuration which was previously designed to satisfy the conditions of trim, longitudinally static stability and specific cargo space is employed as the baseline configuration in pursuing an optimal distributed propulsion system. A set of distributed propulsors is conceptually designed and the collective performance is evaluated against the target thrust mandated by the mission requirements. The concept of the distributed propulsion allows the fan pressure ratio to be around 1.27~1.32 for the target thrust. In addition, further splitting of the fan pressure ratio by using the counter-rotating fans for each slot realizes the target pressure ratio with low tip speed. In the distributed propulsion system, the nature of the flow conditions and/or the thickness of the ingested boundary layer may differ and result in different propulsive reaction of each individual propulsor. The optimization is, thus, approached from both the propulsion system and individual propulsor perspectives. An optimal distribution of the thrust and power output is determined by how the system utilizes each passage's propulsive characteristics and its interaction with the airframe. These system level analysis and optimization are conducted using an actuator disk model to account for the propulsion-airframe integration numerically. With respect to the propulsor level, aerodynamic shape optimizations of the fan blades are performed in a sequential multi-objective optimization process for various design objectives, such as mass flow rate condition, fan pressure ratio, efficiency and the exit flow angle of the fan stage by using a genetic algorithm, NSGA-II. The radial chord distribution, and meanline distribution of the rotors are designed on the circumferentially averaged axi-symmetric inlet profiles and tested on the six inlet profiles from six divided sectors to reckon flow distortion. The performances of the counter rotating fans are, thus, evaluated accordingly for obtaining distortion tolerant fan. The performance of the distributed propulsion system is evaluated by two CFD tools, i.e., a multi-stage turbo-machinery CFD code and one propulsion-airframe integration flow solver coupled with a body-force model. The optimized boundary layer ingestion propulsion system of 16 distributed slots not only reaches the system target thrust, but also delivers a close to 20% fuel saving benefit against its counterpart 12 distributed clean inlet propulsion system.

Boundary-Layer-Ingestion Propulsion

Design of 3-dimensional complex airplane configurations with specified pressure distribution via optimization

A subcritical panel method applied to flow analysis and aerodynamic design of complex aircraft configurations is presented. The analysis method is based on linearized, compressible, subsonic flow equations and indirect Dirichlet boundary conditions. Quadratic dipol and linear source distribution on flat panels are applied. In the case of aerodynamic design, the geometry which minimizes differences between design and actual pressure distribution is found iteratively, using numerical optimization technique. Geometry modifications are modeled by surface transpiration concept. Constraints in respect to resulting geometry can be specified. A number of complex 3-dimensional design examples are presented. The software is adopted to personal computers, and as result an unexpected low cost of computations is obtained.

Kubrynski, Krzysztof

Adaptive Multi-Agent Systems for Constrained Optimization

Product Distribution (PD) theory is a new framework for analyzing and controlling distributed systems. Here we demonstrate its use for distributed stochastic optimization. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. The updating of the Lagrange parameters in the Lagrangian can be viewed as a form of automated annealing, that focuses the MAS more and more on the optimal pure strategy. This provides a simple way to map the solution of any constrained optimization problem onto the equilibrium of a Multi-Agent System (MAS). We present computer experiments involving both the Queen s problem and K-SAT validating the predictions of PD theory and its use for off-the-shelf distributed adaptive optimization.

Macready, William

Optimal pattern distributions in Rete-based production systems

Since its introduction into the AI community in the early 1980's, the Rete algorithm has been widely used. This algorithm has formed the basis for many AI tools, including NASA's CLIPS. One drawback of Rete-based implementation, however, is that the network structures used internally by the Rete algorithm make it sensitive to the arrangement of individual patterns within rules. Thus while rules may be more or less arbitrarily placed within source files, the distribution of individual patterns within these rules can significantly affect the overall system performance. Some heuristics have been proposed to optimize pattern placement, however, these suggestions can be conflicting. This paper describes a systematic effort to measure the effect of pattern distribution on production system performance. An overview of the Rete algorithm is presented to provide context. A description of the methods used to explore the pattern ordering problem area are presented, using internal production system metrics such as the number of partial matches, and coarse-grained operating system data such as memory usage and time. The results of this study should be of interest to those developing and optimizing software for Rete-based production systems.

Scott, Stephen L.