SEARCH · Search NASA

Results for “dynamic programming algorithm”

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 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS2017

MColl: Monte Collocation Trajectory Design Tool

In this paper we describe a prototype low-thrust optimization software being developed at JPL. The software tool is based on a collocation algorithm where a trajectory discretization is fitted and adjusted until the underlying dynamics equations of motion are satisfied. The resulting large scale non-linear programming problem may either be optimized with IPOPT or KNITRO. The user specifies path constraints, boundary constraints, and objectives. We describe the collocation algorithm as well as various mesh refinement strategies, and apply the software tool to solve various example problems.

Grebow, Daniel J.↗

NASA NTRS1990

Flight Dynamics Analysis System

Flight Dynamics Analysis System (FDAS) collection of computer programs provides environment for configuration and study of Ada software. Designed to support flight-dynamics research and analysis activities concerning software models, algorithms, and techniques used within flight Dynamics Division at Goddard Space Flight Center. Assists analysts and programmers in building, testing, and evaluating applications software by providing integrated support system for modification and reconfiguration of software. Includes capability of assembling reusable software components into applications programs, and reconfiguring assembled program after partially or fully completed. Developed in Ada for use on DEC VAX computer operating under VMS 4.3 or higher and version 1.3 or higher of VAX Ada Compilation System (ACS).

Tasaki, Keiji↗

NASA NTRS1993

Nonsmooth trajectory optimization - An approach using continuous simulated annealing

An account is given of the properties of a continuous simulated annealing algorithm that can function as a global optimization tool for nonsmooth dynamic systems, as shown in the case of a trajectory-optimization program implementation. The approach is shown to successfully solve the problem of nonsmooth trajectory optimization for a high performance rigid-body aircraft. The results obtained demonstrate the superiority of the simulated annealing algorithm over widely used algorithms.

Lu, Ping↗

NASA NTRS1980

Decision making and problem solving with computer assistance

In modern guidance and control systems, the human as manager, supervisor, decision maker, problem solver and trouble shooter, often has to cope with a marginal mental workload. To improve this situation, computers should be used to reduce the operator from mental stress. This should not solely be done by increased automation, but by a reasonable sharing of tasks in a human-computer team, where the computer supports the human intelligence. Recent developments in this area are summarized. It is shown that interactive support of operator by intelligent computer is feasible during information evaluation, decision making and problem solving. The applied artificial intelligence algorithms comprehend pattern recognition and classification, adaptation and machine learning as well as dynamic and heuristic programming. Elementary examples are presented to explain basic principles.

Kraiss, F.↗

NASA NTRS1980

Wheat forecast economics effect study

A model to assess the value of improved information regarding the inventories, productions, exports, and imports of crop on a worldwide basis is discussed. A previously proposed model is interpreted in a stochastic control setting and the underlying assumptions of the model are revealed. In solving the stochastic optimization problem, the Markov programming approach is much more powerful and exact as compared to the dynamic programming-simulation approach of the original model. The convergence of a dual variable Markov programming algorithm is shown to be fast and efficient. A computer program for the general model of multicountry-multiperiod is developed. As an example, the case of one country-two periods is treated and the results are presented in detail. A comparison with the original model results reveals certain interesting aspects of the algorithms and the dependence of the value of information on the incremental cost function.

Mehra, R. K.↗

NASA NTRS1989

Automated tracking of arctic ice floes in multitemporal SAR imagery

A discussion is presented of two algorithms to perform shape matching on the boundaries of ice floes in SAR (synthetic aperture radar) images in order to produce an ice motion map. The algorithms match a shape descriptor known as the psi-s curve. The first algorithm uses normalized correlation to match the psi-s curves, while the second uses dynamic programming to compute an elastic match that better accommodates deformation of the ice floe boundary.

Mcconnell, R.↗

NASA NTRS1986

A comparative analysis of static and dynamic load balancing strategies

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but suboptimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the three strategies.

Iqbal, M. Ashraf↗

NASA NTRS1986

Performance tradeoffs in static and dynamic load balancing strategies

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.

Iqbal, M. A.↗

NASA NTRS2011

Robust Control Algorithm for a Two Cart System and an Inverted Pendulum

The Rectilinear Control System can be used to simulate a launch vehicle during liftoff. Several control schemes have been developed that can control different dynamic models of the rectilinear plant. A robust control algorithm was developed that can control a pendulum to maintain an inverted position. A fluid slosh tank will be attached to the pendulum in order to test robustness in the presence of unknown slosh characteristics. The rectilinear plant consists of a DC motor and three carts mounted in series. Each cart s weight can be adjusted with brass masses and the carts can be coupled with springs. The pendulum is mounted on the first cart and an adjustable air damper can be attached to the third cart if desired. Each cart and the pendulum have a quadrature encoder to determine position. Full state feedback was implemented in order to develop the control algorithm along with a state estimator to determine the velocity states of the system. A MATLAB program was used to convert the state space matrices from continuous time to discrete time. This program also used a desired phase margin and damping ratio to determine the feedback gain matrix that would be used in the LabVIEW program. This experiment will allow engineers to gain a better understanding of liquid propellant slosh dynamics, therefore enabling them to develop more robust control algorithms for launch vehicle systems

Wilson, Chris L.↗

NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

NASA NTRS2018

Demonstration of the Space Launch System Augmenting Adaptive Control Algorithm on Pole-Cart Platform

NASA's baseline Space Launch System (SLS) ight control system (FCS) includes an adaptive augmenting control (AAC) portion in addition to the ight-heritage nominal classical controller. The AAC algorithm is intended to improve the robustness and performance of the classical controller. Over the past several years, the AAC algorithm developed at NASA Marshall Space Flight Center (MSFC) has matured significantly through extensive simulation, rigorous analytical proofs, and a series of successful ight tests on a F18 aircraft. This study was part of a SLS program and NASA Engineering and Safety Center (NESC) joint e ort to further increase the confidence level of the AAC algorithm by demonstrating its key functionalities on a classroom type of example, the pole-cart sys- tem, at the NASA Langley Research Center (LaRC) dynamics and control laboratory. The fundamental dynamics behind balancing an inverted pendulum is similar to controlling an aerodynamically unstable rocket. Both systems are inherently open-loop unstable and requires feedback control for attitude stabilization. The principles behind the AAC algorithm is applicable to a wide range of conditionally stable dynamical systems. Hence, the outcomes from this simple and inexpensive exercise has provided the SLS program with additional confidence into the AAC design, operation, robustness, and application.

Pei, Jing↗

NASA NTRS1989

Robot acting on moving bodies (RAMBO): Preliminary results

A robot system called RAMBO is being developed. It is equipped with a camera, which, given a sequence of simple tasks, can perform these tasks on a moving object. RAMBO is given a complete geometric model of the object. A low level vision module extracts and groups characteristic features in images of the object. The positions of the object are determined in a sequence of images, and a motion estimate of the object is obtained. This motion estimate is used to plan trajectories of the robot tool to relative locations nearby the object sufficient for achieving the tasks. More specifically, low level vision uses parallel algorithms for image enchancement by symmetric nearest neighbor filtering, edge detection by local gradient operators, and corner extraction by sector filtering. The object pose estimation is a Hough transform method accumulating position hypotheses obtained by matching triples of image features (corners) to triples of model features. To maximize computing speed, the estimate of the position in space of a triple of features is obtained by decomposing its perspective view into a product of rotations and a scaled orthographic projection. This allows the use of 2-D lookup tables at each stage of the decomposition. The position hypotheses for each possible match of model feature triples and image feature triples are calculated in parallel. Trajectory planning combines heuristic and dynamic programming techniques. Then trajectories are created using parametric cubic splines between initial and goal trajectories. All the parallel algorithms run on a Connection Machine CM-2 with 16K processors.

Davis, Larry S.↗

NASA NTRS1993

Autonomous Frequency-Domain System-Identification Program

Autonomous Frequency Domain Identification (AU-FREDI) computer program implements system of methods, algorithms, and software developed for identification of parameters of mathematical models of dynamics of flexible structures and characterization, by use of system transfer functions, of such models, dynamics, and structures regarded as systems. Software considered collection of routines modified and reassembled to suit system-identification and control experiments on large flexible structures.

Yam, Yeung↗

NASA NTRS1986

Free vibration and dynamic response analysis of spinning structures

The proposed effort involved development of numerical procedures for efficient solution of free vibration problems of spinning structures. An eigenproblem solution procedure, based on a Lanczos method employing complex arithmetic, was successfully developed. This task involved formulation of the numerical procedure, FORTRAN coding of the algorithm, checking and debugging of software, and implementation of the routine in the STARS program. A graphics package for the E/S PS 300 as well as for the Tektronix terminals was successfully generated and consists of the following special capabilities: (1) a dynamic response plot for the stresses and displacements as functions of time; and (2) a menu driven command module enabling input of data on an interactive basis. Finally, the STARS analysis capability was further improved by implementing the dynamic response analysis package that provides information on nodal deformations and element stresses as a function of time. A number of test cases were run utilizing the currently developed algorithm implemented in the STARS program and such results indicate that the newly generated solution technique is significantly more efficient than other existing similar procedures.

Source record↗

DOE OSTI2020

CSRI Summer Proceedings 2020

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program is organized by CSRI and typically includes the organization of a weekly seminar series and the publication of a summer proceedings. In 2020, the CSRI summer program was executed completely virtually; all student interns worked from home, due to the COVID-19 pandemic.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

The multi-disciplinary design study: A life cycle cost algorithm

The approach and results of a Life Cycle Cost (LCC) analysis of the Space Station Solar Dynamic Power Subsystem (SDPS) including gimbal pointing and power output performance are documented. The Multi-Discipline Design Tool (MDDT) computer program developed during the 1986 study has been modified to include the design, performance, and cost algorithms for the SDPS as described. As with the Space Station structural and control subsystems, the LCC of the SDPS can be computed within the MDDT program as a function of the engineering design variables. Two simple examples of MDDT's capability to evaluate cost sensitivity and design based on LCC are included. MDDT was designed to accept NASA's IMAT computer program data as input so that IMAT's detailed structural and controls design capability can be assessed with expected system LCC as computed by MDDT. No changes to IMAT were required. Detailed knowledge of IMAT is not required to perform the LCC analyses as the interface with IMAT is noninteractive.

Harding, R. R.↗

DOE OSTI2024

Comparison of Real-Time Pressure Rail Selection Algorithms for the Hybrid Hydraulic Electric Architecture: Case Study on a Track Loader

Abstract The hybrid hydraulic electric architecture (HHEA) seeks to combine the high power/torque/force density of hydraulics with the efficiency of electric machines. A set of common pressure rails is used to provide a majority of the power and this power is modulated by small electric machines to provide precise control for the operator. The HHEA has been studied in previous work using off-line dynamic programming optimization to determine energy efficient pressure rail selections, but this approach requires drive cycle information apriori. A Lagrange multiplier method has also been investigated where a set of gains (Lagrange multipliers) are optimized off-line with the idea the these gains, once determined, could be used for real-time operation. In this work, three new real-time pressure rail selection algorithms that do not require future drive cycle information are investigated; greedy, torque minimizing, and thresholding. The greedy control is found to only use 1% more energy than the globally optimal dynamic programming solution; but a model of energy loss is required.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

QuaSiMo: A composable library to program hybrid workflows for quantum simulation

Abstract A composable design scheme is presented for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. The proposed object‐oriented approach is based on constructing an expressive set of common data structures and methods that enables programming of a broad variety of complex hybrid quantum simulation applications. The abstract core of the scheme is distilled from the analysis of the current quantum simulation algorithms. Subsequently, it allows synthesis of new hybrid algorithms and workflows via the extension, specialisation, and dynamic customisation of the abstract core classes defined by the proposed design. The design scheme is implemented using the hardware‐agnostic programming language QCOR into the QuaSiMo library. To validate the implementation, the authors test and show its utility on commercial quantum processors from IBM and Rigetti, running some prototypical quantum simulations.

97 MATHEMATICS AND COMPUTING↗