Search NASA⌕ Search

SEARCH · Search NASA

Results for “global 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 127 records · Page 7

Genetic Algorithm for Optimization: Preprocessing with n Dimensional Bisection and Error Estimation

A knowledge of the appropriate values of the parameters of a genetic algorithm (GA) such as the population size, the shrunk search space containing the solution, crossover and mutation probabilities is not available a priori for a general optimization problem. Recommended here is a polynomial-time preprocessing scheme that includes an n-dimensional bisection and that determines the foregoing parameters before deciding upon an appropriate GA for all problems of similar nature and type. Such a preprocessing is not only fast but also enables us to get the global optimal solution and its reasonably narrow error bounds with a high degree of confidence.

Sen, S. K.↗

End to End Optimization of a Mars Hybrid Transportation Architecture

NASA’s Mars Study Capability Team (MSCT) is developing a reusable Mars hybrid transportation architecture in which both chemical and solar electric propulsion systems are used in a single vehicle design to send crew and cargo to Mars. This paper presents a new integrated framework that combines Earth departure/arrival, heliocentric trajectory, Mars orbit reorientation, and vehicle sizing into a single environment and solves the entire mission from beginning to end in an effort to find a globally optimized solution for the hybrid architecture.

Qu, Min↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

Feeding Ten Billion People Is Possible Within Four Terrestrial Planetary Boundaries

Global agriculture puts heavy pressure on planetary boundaries, posing the challenge to achieve future food security without compromising Earth system resilience. On the basis of process-detailed, spatially explicit representation of four interlinked planetary boundaries (biosphere integrity, land-system change, freshwater use, nitrogen flows) and agricultural systems in an internally consistent model framework, we here show that almost half of current global food production depends on planetary boundary transgressions. Hotspot regions, mainly in Asia, even face simultaneous transgression of multiple underlying local boundaries. If these boundaries were strictly respected, the present food system could provide a balanced diet (2,355 kcal per capita per day) for 3.4 billion people only. However, as we also demonstrate, transformation towards more sustainable production and consumption patterns could support 10.2 billion people within the planetary boundaries analysed. Key prerequisites are spatially redistributed cropland, improved water–nutrient management, food waste reduction and dietary changes. Adoption of the Sustainable Development Goals by all nations in 2015 is the first ever commitment to a world development path that safeguards the stability of the Earth system as a prerequisite for meeting universal human standards1. The longstanding challenge of achieving food security through sustainable agriculture is particularly acute in this context as world agriculture is a leading cause for the current transgressions of multiple planetary boundaries (PBs) globally and regionally2–5. The PB framework is a comprehensive scientific attempt to synoptically define our planet’s biogeophysical limits to anthropogenic interference. It suggests bounds to nine interacting processes that together delineate a Holocene-like Earth system state. The Holocene is chosen as the reference state as it is the only period known to provide a safe operating space for a world population of several billion people, and according to a precautionary principle, the PBs are set in sufficient distance from processes that may critically undermine Earth system resilience and global sustainability. A challenging question, thus, is whether human development goals such as food security can be met while maintaining multiple PBs along with their subglobal manifestations. Further PB transgressions could jeopardize the chances of providing sufficient food for a world population projected to be wealthier and reach >9 billion by 2050. This conundrum portrays a tradeoff between Earth’s biophysical carrying capacity and humankind’s rising food demand, calling in response for radical rethinking of food production and consumption patterns6–9. Yield gap closures, avoidance of excessive input use, shifts towards less resource-demanding diets, food waste reductions and efficient international trade are crucial options for sustainably increasing the food supply10–15. For example, enhancing water-use efficiency on irrigated and rain-fed farms can triple or quadruple crop yields in low-performing systems, suggesting possible global gains of >20% (ref. 16). Even higher gains appear feasible through globally optimized configurations of the land-use pattern17, and cutting food losses by half could generate food for another billion people18. Thus, collective large-scale implementation of such options could sustain food for a further growing world population19. Yet achieving this within a safe operating space as defined by PBs requires not only a halt to but actually a reversal of existing PB transgressions. Previous studies suggest that such a reconciliation might be possible, but these were based on aggregate representations of PBs (not accounting for the spatial patterns of limits, transgressions and interactions) or considered only one boundary in isolation17,20–23. Here, we systematically quantify to what extent current food production depends on local to global transgressions of the PBs for biosphere integrity, land-system change, freshwater use and nitrogen (N) flows, along with the potential of a range of solutions to avoid these transgressions and still increase food supply (Table 1). To this end, we configured an internally consistent process-based model of the terrestrial biosphere including agriculture (LPJmL) with multiple spatially distributed PBs and their interactions. LPJmL is among the longest-established and best-evaluated biosphere models, showing robust performance regarding simulation of, for example, carbon, water and crop yield dynamics (Supplementary Figs. 1 and 2 and Supplementary Table 1; see ref. 24 for a comprehensive benchmarking and Supplementary Methods for more detail on model evaluations). In principle following established definitions4, we refine the computation of some PBs with respect to their regional patterns and interactions (Methods), providing globally gridded precautionary limits to human interference with the Earth system at a level of great detail. In particular, we account for the evidence that many PBs need to be represented spatially explicitly4 to cover their

Gerten, Dieter↗

Improvement of Automated POST Case Success Rate Using Support Vector Machines

During early conceptual design of complex systems, concept down selection can have a large impact upon program life-cycle cost. Therefore, any concepts selected during early design will inherently commit program costs and affect the overall probability of program success. For this reason it is important to consider as large a design space as possible in order to better inform the down selection process. For conceptual design of launch vehicles, trajectory analysis and optimization often presents the largest obstacle to evaluating large trade spaces. This is due to the sensitivity of the trajectory discipline to changes in all other aspects of the vehicle design. Small deltas in the performance of other subsystems can result in relatively large fluctuations in the ascent trajectory because the solution space is non-linear and multi-modal [1]. In order to help capture large design spaces for new launch vehicles, the authors have performed previous work seeking to automate the execution of the industry standard tool, Program to Optimize Simulated Trajectories (POST). This work initially focused on implementation of analyst heuristics to enable closure of cases in an automated fashion, with the goal of applying the concepts of design of experiments (DOE) and surrogate modeling to enable near instantaneous throughput of vehicle cases [2]. Additional work was then completed to improve the DOE process by utilizing a graph theory based approach to connect similar design points [3]. The conclusion of the previous work illustrated the utility of the graph theory approach for completing a DOE through POST. However, this approach was still dependent upon the use of random repetitions to generate seed points for the graph. As noted in [3], only 8% of these random repetitions resulted in converged trajectories. This ultimately affects the ability of the random reps method to confidently approach the global optima for a given vehicle case in a reasonable amount of time. With only an 8% pass rate, tens or hundreds of thousands of reps may be needed to be confident that the best repetition is at least close to the global optima. However, typical design study time constraints require that fewer repetitions be attempted, sometimes resulting in seed points that have only a handful of successful completions. If a small number of successful repetitions are used to generate a seed point, the graph method may inherit some inaccuracies as it chains DOE cases from the non-global-optimal seed points. This creates inherent noise in the graph data, which can limit the accuracy of the resulting surrogate models. For this reason, the goal of this work is to improve the seed point generation method and ultimately the accuracy of the resulting POST surrogate model. The work focuses on increasing the case pass rate for seed point generation.

Zwack, Matthew R.↗

Numerical Computation of a Continuous-thrust State Transition Matrix Incorporating Accurate Hardware and Ephemeris Models

A significant body of work exists showing that providing a nonlinear programming (NLP) solver with expressions for the problem constraint gradient substantially increases the speed of program execution and can also improve the robustness of convergence, especially for local optimizers. Calculation of these derivatives is often accomplished through the computation of spacecraft's state transition matrix (STM). If the two-body gravitational model is employed as is often done in the context of preliminary design, closed form expressions for these derivatives may be provided. If a high fidelity dynamics model, that might include perturbing forces such as the gravitational effect from multiple third bodies and solar radiation pressure is used then these STM's must be computed numerically. We present a method for the power hardward model and a full ephemeris model. An adaptive-step embedded eight order Dormand-Prince numerical integrator is discussed and a method for the computation of the time of flight derivatives in this framework is presented. The use of these numerically calculated derivatieves offer a substantial improvement over finite differencing in the context of a global optimizer. Specifically the inclusion of these STM's into the low thrust missiondesign tool chain in use at NASA Goddard Spaceflight Center allows for an increased preliminary mission design cadence.

Low Thrust↗

Computation of optimal output-feedback compensators for linear time-invariant systems

The control of linear time-invariant systems with respect to a quadratic performance criterion was considered, subject to the constraint that the control vector be a constant linear transformation of the output vector. The optimal feedback matrix, f*, was selected to optimize the expected performance, given the covariance of the initial state. It is first shown that the expected performance criterion can be expressed as the ratio of two multinomials in the element of f. This expression provides the basis for a feasible method of determining f* in the case of single-input single-output systems. A number of iterative algorithms are then proposed for the calculation of f* for multiple input-output systems. For two of these, monotone convergence is proved, but they involve the solution of nonlinear matrix equations at each iteration. Another is proposed involving the solution of Lyapunov equations at each iteration, and the gradual increase of the magnitude of a penalty function. Experience with this algorithm will be needed to determine whether or not it does, indeed, possess desirable convergence properties, and whether it can be used to determine the globally optimal f*.

Platzman, L. K.↗

The Global Geodetic Observing System: Space Geodesy Networks for the Future

Ground-based networks of co-located space geodetic techniques (VLBI, SLR, GNSS. and DORIS) are the basis for the development and maintenance of the International Terrestrial Reference frame (ITRF), which is our metric of reference for measurements of global change, The Global Geodetic Observing System (GGOS) of the International Association of Geodesy (IAG) has established a task to develop a strategy to design, integrate and maintain the fundamental geodetic network and supporting infrastructure in a sustainable way to satisfy the long-term requirements for the reference frame. The GGOS goal is an origin definition at 1 mm or better and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components. These goals are based on scientific requirements to address sea level rise with confidence, but other applications are not far behind. Recent studies including one by the US National Research Council has strongly stated the need and the urgency for the fundamental space geodesy network. Simulations are underway to examining accuracies for origin, scale and orientation of the resulting ITRF based on various network designs and system performance to determine the optimal global network to achieve this goal. To date these simulations indicate that 24 - 32 co-located stations are adequate to define the reference frame and a more dense GNSS and DORIS network will be required to distribute the reference frame to users anywhere on Earth. Stations in the new global network will require geologically stable sites with good weather, established infrastructure, and local support and personnel. GGOS wil seek groups that are interested in participation. GGOS intends to issues a Call for Participation of groups that would like to contribute in the network implementation and operation. Some examples of integrated stations currently in operation or under development will be presented. We will examine necessary conditions and challenges in designing a co-location station.

Pearlman, Michael↗

Engineering calculations for communications satellite systems planning

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Reilly, C. H.↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, we design an experiment and solve the same problem under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, we present results of practical, rather than statistical, significance. Our implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than our implementation of a gradient search procedure does with our objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, an experiment is designed and the same problem is solved under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, results of practical, rather than statistical, significance are presented. Implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than implementation of a gradient search procedure does with the objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Neural-Network Processor Would Allocate Resources

Global optimization problems solved quickly. Neural-network processor optimizes allocation of M resources among N expenditures according to cost of pairing each resource with each expenditure and subject to limit on number of resources feeding into each expenditure and/or limit on number of expenditures to which each resource allocated. One cell performs several analog and digital functions. Potential applications include assignment of jobs, scheduling, dispatching, and planning of military maneuvers.

Eberhardt, Silvio P.↗

Neural Network Solves "Traveling-Salesman" Problem

Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.

Thakoor, Anilkumar P.↗

Geometric programming prediction of design trends for OMV protective structures

The global optimization trends of protective honeycomb structural designs for spacecraft subject to hypervelocity meteroid and space debris are presented. This nonlinear problem is first formulated for weight minimization of the orbital maneuvering vehicle (OMV) using a generic monomial predictor. Five problem formulations are considered, each dependent on the selection of independent design variables. Each case is optimized by considering the dual geometric programming problem. The dual variables are solved for in terms of the generic estimated exponents of the monomial predictor. The primal variables are then solved for by conversion. Finally, parametric design trends are developed for ranges of the estimated regression parameters. Results specify nonmonotonic relationships for the optimal first and second sheet mass per unit areas in terms of the estimated exponents.

Mog, R. A.↗

Programmable synaptic devices for electronic neural nets

The architecture, design, and operational characteristics of custom VLSI and thin film synaptic devices are described. The devices include CMOS-based synaptic chips containing 1024 reprogrammable synapses with a 6-bit dynamic range, and nonvolatile, write-once, binary synaptic arrays based on memory switching in hydrogenated amorphous silicon films. Their suitability for embodiment of fully parallel and analog neural hardware is discussed. Specifically, a neural network solution to an assignment problem of combinatorial global optimization, implemented in fully parallel hardware using the synaptic chips, is described. The network's ability to provide optimal and near optimal solutions over a time scale of few neuron time constants has been demonstrated and suggests a speedup improvement of several orders of magnitude over conventional search methods.

Moopenn, A.↗

Intelligent control and adaptive systems; Proceedings of the Meeting, Philadelphia, PA, Nov. 7, 8, 1989

Various papers on intelligent control and adaptive systems are presented. Individual topics addressed include: control architecture for a Mars walking vehicle, representation for error detection and recovery in robot task plans, real-time operating system for robots, execution monitoring of a mobile robot system, statistical mechanics models for motion and force planning, global kinematics for manipulator planning and control, exploration of unknown mechanical assemblies through manipulation, low-level representations for robot vision, harmonic functions for robot path construction, simulation of dual behavior of an autonomous system. Also discussed are: control framework for hand-arm coordination, neural network approach to multivehicle navigation, electronic neural networks for global optimization, neural network for L1 norm linear regression, planning for assembly with robot hands, neural networks in dynamical systems, control design with iterative learning, improved fuzzy process control of spacecraft autonomous rendezvous using a genetic algorithm.

Rodriguez, Guillermo↗

Multiple task point control of a redundant manipulator

The kinematic control of a redundant arm based on multiple tasks assigned to different locations of the manipulator is presented. This is equivalent to decomposing a redundant arm into two (or more) nonredundant local arms, the basearm and the forearm, at an intermediate arm location or task point called the elbow. A redundant arm is transformed into a serially cooperating dual-arm system, with the cooperation between the local arms being carried out at the elbow. Then, a manipulator end-effector motion specified by a given task is decomposed into motions of individual local arms as well as an end-effector free motion based on achieving maximum efficiency in task execution. To consider global optimization, elbow control is applied to reshaping and reorientation of a manipulability ellipsoid at the end effector during task execution. The resolved rate control of elbow in the end-effector null and free motion space is used to maximize arm homogeneity and to match the forearm motion space with the task space. Simulation results are shown.

Lee, Sukhan↗