Chebychev Trajectory Optimization Program /CHEBYTOP/ Final report
Digital computer program for interplanetary trajectory optimization and variable thrust data
Hahn, D. W.↗
SEARCH · Engineering Papers
Results for “Computational 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.
Software for Optimizing Plans Involving Interdependent Goals
A computer program enables construction and optimization of plans for activities that are directed toward achievement of goals that are interdependent. Goal interdependence is defined as the achievement of one or more goals affecting the desirability or priority of achieving one or more other goals. This program is overlaid on the Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been described in a number of prior NASA Tech Briefs articles. Unlike other known or related planning programs, this program considers interdependences among goals that can change between problems and provides a language for easily specifying such dependences. Specifications of the interdependences can be formulated dynamically and provided to the associated planning software as part of the goal input. Then an optimization algorithm provided by this program enables the planning software to reason about the interdependences and incorporate them into an overall objective function that it uses to rate the quality of a plan under construction and to direct its optimization search. In tests on a series of problems of planning geological experiments by a team of instrumented robotic vehicles (rovers) on new terrain, this program was found to enhance plan quality.
Estlin, Tara↗
Partitioning problems in parallel, pipelined and distributed computing
The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest.
Bokhari, S.↗
Optimal reconfiguration strategy for a degradable multimodule computing system
The present quantitative approach to the problem of reconfiguring a degradable multimode system assigns some modules to computation and arranges others for reliability. By using expected total reward as the optimal criterion, there emerges an active reconfiguration strategy based not only on the occurrence of failure but the progression of the given mission. This reconfiguration strategy requires specification of the times at which the system should undergo reconfiguration, and the configurations to which the system should change. The optimal reconfiguration problem is converted to integer nonlinear knapsack and fractional programming problems.
Lee, Yann-Hang↗
Automatic design of optical systems by digital computer
Computer program uses geometrical optical techniques and a least squares optimization method employing computing equipment for the automatic design of optical systems. It evaluates changes in various optical parameters, provides comprehensive ray-tracing, and generally determines the acceptability of the optical system characteristics.
Casad, T. A.↗
A formulation and analysis of combat games
Combat is formulated as a dynamical encounter between two opponents, each of whom has offensive capabilities and objectives. With each opponent is associated a target in the event space in which he endeavors to terminate the combat, thereby winning. If the combat terminates in both target sets simultaneously or in neither, a joint capture or a draw, respectively, is said to occur. Resolution of the encounter is formulated as a combat game; namely, as a pair of competing event-constrained differential games. If exactly one of the players can win, the optimal strategies are determined from a resulting constrained zero-sum differential game. Otherwise the optimal strategies are computed from a resulting non-zero-sum game. Since optimal combat strategies frequencies may not exist, approximate of delta-combat games are also formulated leading to approximate or delta-optimal strategies. To illustrate combat games, an example, called the turret game, is considered. This game may be thought of as a highly simplified model of air combat, yet it is sufficiently complex to exhibit a rich variety of combat behavior, much of which is not found in pursuit-evasion games.
Heymann, M.↗
Partitioning problems in parallel, pipelined, and distributed computing
The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.
Bokhari, Shahid H.↗
Advanced launch system trajectory optimization using suboptimal control
The maximum-final mass trajectory of a proposed configuration of the Advanced Launch System is presented. A model for the two-stage rocket is given; the optimal control problem is formulated as a parameter optimization problem; and the optimal trajectory is computed using a nonlinear programming code called VF02AD. Numerical results are presented for the controls (angle of attack and velocity roll angle) and the states. After the initial rotation, the angle of attack goes to a positive value to keep the trajectory as high as possible, returns to near zero to pass through the transonic regime and satisfy the dynamic pressure constraint, returns to a positive value to keep the trajectory high and to take advantage of minimum drag at positive angle of attack due to aerodynamic shading of the booster, and then rolls off to negative values to satisfy the constraints. Because the engines cannot be throttled, the maximum dynamic pressure occurs at a single point; there is no maximum dynamic pressure subarc. To test approximations for obtaining analytical solutions for guidance, two additional optimal trajectories are computed: one using untrimmed aerodynamics and one using no atmospheric effects except for the dynamic pressure constraint. It is concluded that untrimmed aerodynamics has a negligible effect on the optimal trajectory and that approximate optimal controls should be able to be obtained by treating atmospheric effects as perturbations.
Shaver, Douglas A.↗
The Use of General Purpose Computer Programs to Derive Equations of Motion for Optimal Isolation Studies
Techniques were developed that utilize general purpose structural analysis computer programs to generate the equations of motion necessary for limiting performance studies. The methodology necessary to couple available general purpose finite element structural programs to a limiting performance capability was developed. Primary emphasis was given to the use of the general purpose program to develop equations of motion in a form that can be used by the limiting performance program.
Pilkey, W. D.↗
A discussion of techniques for optimizing experiments with data processing.
Data processing and computer related techniques for optimizing analysis of experimental results of space missions
Slaughter, D. W.↗
Efficient Optimization of Low-Thrust Spacecraft Trajectories
A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.
Lee, Seungwon↗
Advanced technologies in the ASI MLRO towards a new generation laser ranging system
Matera Laser Ranging Observatory (MLRO) is a high performance, highly automated optical and astronomical observatory currently under design and development by AlliedSignal for the Italian Space Agency (ASI). It is projected to become operational at the Centro Geodesia Spaziale in Matera, Italy, in 1997. MLRO, based on a 1.5-meter astronomical quality telescope, will perform ranging to spacecraft in earthbound orbits, lunar reflectors, and specially equipped deep space missions. The primary emphasis during design is to incorporate state-of-the-art technologies to produce an intelligent, automated, high accuracy ranging system that will mimic the characteristic features of a fifth generation laser ranging system. The telescope has multiple ports and foci to support future experiments in the areas of laser communications, lidar, astrometry, etc. The key features providing state-of-the-art ranging performance include: a diode-pumped picosecond (50 ps) laser, high speed (3-5 GHz) optoelectronic detection and signal processing, and a high accuracy (6 ps) high resolution (less than 2 ps) time measurement capability. The above combination of technologies is expected to yield millimeter laser ranging precision and accuracy on targets up to 300,000 km, surpassing the best operational instrument performance to date by a factor of five or more. Distributed processing and control using a state-of-the-art computing environment provides the framework for efficient operation, system optimization, and diagnostics. A computationally intelligent environment permits optimal planning, scheduling, tracking, and data processing. It also supports remote access, monitor, and control for joint experiments with other observatories.
Varghese, Thomas↗
Optimizing Simulated Trajectories Of Rigid Bodies
6D POST is general-purpose, six-degree-of-freedom computer program for optimization of simulated trajectories of rigid bodies. Direct extension of three-degree-of-freedom POST program. 6D POST program models trajectory of powered or unpowered vehicle operating at or near rotating planet. Used to solve variety of performance, guidance, and flight-control problems for atmospheric and orbital vehicles. Written in FORTRAN 77 and FORTRAN V.
Brauer, Garry L.↗
Trajectory optimization using fast-time repetitive computation
Perturbation method of computing optimum trajectories on hybrid and digital computers
Raby, J. S.↗
Analysis and optimization of a queueing model of a real-time computer control system
Real time computer control system queueing model to optimize preemptible and nonpreemptible job priority assignment
Schrage, L.↗
Optimization of thrust algorithm calibration for Computing System (TCS) for Thrust the NASA Highly Maneuverable Aircraft Technology (HiMAT) vehicle's propulsion system
A simplified gross thrust computing technique for the HiMAT J85-GE-21 engine using altitude facility data was evaluated. The results over the full engine envelope for both the standard engine mode and the open nozzle engine mode are presented. Results using afterburner casing static pressure taps are compared to those using liner static pressure taps. It is found that the technique is very accurate for both the standard and open nozzle engine modes. The difference in the algorithm accuracy for a calibration based on data from one test condition was small compared to a calibration based on data from all of the test conditions.
Hamer, M. J.↗
Computational and experimental studies of LEBUs at high device Reynolds numbers
The present paper summarizes computational and experimental studies for large-eddy breakup devices (LEBUs). LEBU optimization (using a computational approach considering compressibility, Reynolds number, and the unsteadiness of the flow) and experiments with LEBUs at high Reynolds numbers in flight are discussed. The measurements include streamwise as well as spanwise distributions of local skin friction. The unsteady flows around the LEBU devices and far downstream are characterized by strain-gage measurements on the devices and hot-wire readings downstream. Computations are made with available time-averaged and quasi-stationary techniques to find suitable device profiles with minimum drag.
Bertelrud, Arild↗
Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains
Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.
Eleshaky, Mohamed E.↗