Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Multiple shooting”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Reducing the number of variational equations in the implementation of multiple shooting

The standard method of multiple shooting for a system of n first-order differential equations with k unknown initial conditions requires the integration of k sets of variational equations on the first shot and n sets of variational equations on every shot thereafter. This paper describes a variant of multiple shooting that requires the solution of k sets of variational equations on every shot. The technique applies to both linear and nonlinear boundary-value problems. Techniques to deal with difficulties unique to the solution of nonlinear problems are suggested.

Krogh, F. T.↗
NASA NTRS1991

Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation

Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.

Mook, D. J.↗
DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗
NASA NTRS2019

High-Fidelity Multiple-Flyby Trajectory Optimization Using Multiple-Shooting

Rendering a complex spacecraft trajectory in high fidelity can be an expensive endeavor, both computationally and from a human time/cost standpoint. However, in many cases, a low-fidelity trajectory that reasonably approximates a high-fidelity counterpart is much easier to obtain. Thus, it is important to have an efficient process for converting a trajectory from lower-fidelity model to high fidelity. We present a method for converting low-fidelity trajectories into high fidelity that relies on multiple shooting, nonlinear programming, and numerical integration. The procedure converts any zero-radius sphere-of-influence gravity-assist events to fully integrated flyby events. Several numerical examples are presented that showcase the flexibility of the high-fidelity rendering process across multiple mission types and flight regimes.

high-fidelity↗
NASA NTRS2016

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allowing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for computational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

optimization↗
NASA NTRS2015

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allow-ing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for com-putational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

trajectory design↗
NASA NTRS2009

Direct Multiple Shooting Optimization with Variable Problem Parameters

Taking advantage of a novel approach to the design of the orbital transfer optimization problem and advanced non-linear programming algorithms, several optimal transfer trajectories are found for problems with and without known analytic solutions. This method treats the fixed known gravitational constants as optimization variables in order to reduce the need for an advanced initial guess. Complex periodic orbits are targeted with very simple guesses and the ability to find optimal transfers in spite of these bad guesses is successfully demonstrated. Impulsive transfers are considered for orbits in both the 2-body frame as well as the circular restricted three-body problem (CRTBP). The results with this new approach demonstrate the potential for increasing robustness for all types of orbit transfer problems.

Whitley, Ryan J.↗
DOE OSTI2021

Improved node culture methods for rapid vegetative propagation of switchgrass (Panicum virgatum L.)

Abstract Background Switchgrass ( Panicum virgatum L.) is an important bioenergy and forage crop. The outcrossing nature of switchgrass makes it infeasible to maintain a genotype through sexual propagation. Current asexual propagation protocols in switchgrass have various limitations. An easy and highly-efficient vegetative propagation method is needed to propagate large natural collections of switchgrass genotypes for genome-wide association studies (GWAS). Results Micropropagation by node culture was found to be a rapid method for vegetative propagation of switchgrass. Bacterial and fungal contamination during node culture is a major cause for cultural failure. Adding the biocide, Plant Preservative Mixture (PPM, 0.2%), and the fungicide, Benomyl (5 mg/l), in the incubation solution after surface sterilization and in the culture medium significantly decreased bacterial and fungal contamination. In addition, “shoot trimming” before subculture had a positive effect on shoot multiplication for most genotypes tested. Using the optimized node culture procedure, we successfully propagated 330 genotypes from a switchgrass GWAS panel in three separate experiments. Large variations in shoot induction efficiency and shoot growth were observed among genotypes. Separately, we developed an in planta node culture method by stimulating the growth of aerial axillary buds into shoots directly on the parent plants, through which rooted plants can be generated within 6 weeks. By circumventing the tissue culture step and avoiding application of exterior hormones, the in planta node culture method is labor- and cost-efficient, easy to master, and has a high success rate. Plants generated by the in planta node culture method are similar to seedlings and can be used directly for various experiments. Conclusions In this study, we optimized a switchgrass node culture protocol by minimizing bacterial and fungal contamination and increasing shoot multiplication. With this improved protocol, we successfully propagated three quarters of the genotypes in a diverse switchgrass GWAS panel. Furthermore, we established a novel and high-throughput in planta node culture method. Together, these methods provide better options for researchers to accelerate vegetative propagation of switchgrass.

Wang, Yongqin↗
NASA NTRS2020

Implicit Formulations of Bounded-Impulse Trajectory Models for Preliminary Interplanetary Low-Thrust Analysis

The bounded-impulse approach to low-thrust interplanetary trajectory optimization is widely used. In an effort to efficiently implement this approach using NASA’s OpenMDAO optimization software, the authors have implemented implicit formulations of the forward shooting/backwards-shooting methods commonly used in bounded-impulse models. These implicit approaches allow for vectorization of the underlying calculations which can significantly reduce runtime in interpreted languages. An implicit approach may be either converged by using an underlying nonlinear solver to converge the state propagation, or as a constraint in an optimizer-driven multiple-shooting approach. Significant computational efficiency gains are realized through the utilization of the modular approach to unified derivatives. Further computational efficiency is achieved by capitalizing on the sparsity of the constraint Jacobian matrix. This work demonstrates that a vectorized multiple-shooting approach for propagating a state-time history is superior in terms of computational efficiency as the number of segments in the state-propagation is increased.

Falck, Robert D↗
NASA NTRS2002

Three-Dimensional Postbuckling Analysis of Curved Beams

Presented here is a method of solving highly flexible curved beam undergoing huge static or quasi-static deformations. A geometrically exact beam theory based on the use of Jaumann stresses and strains and exact coordinate transformation is presented in terms of 17 first-order ordinary differential equations, and a multiple shooting method is used to solve the corresponding nonlinear two-point boundary value problems. The geometrically exact beam theory accounts far large rotations, large displacements, initial curvatures, extensionality, and transverse shear strains. Four examples are used to demonstrate this method, including a rotating clamped-free beam under the influence of gravity and centrifugal forces, an L-frame subjected to an in-plane tip load, a circular arch subjected to a concentrated load, and a clamped-hinged helical spring subjected to an axial displacement. Results show that the combination of the multiple shooting method and the geometrically exact beam theory works very well. Moreover, the obtained numerically exact solutions can be used to verify the accuracy of nonlinear finite element codes for nonlinear analysis of complex structures.

Pai, P. Frank↗
DOE OSTI2022

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Cloning crops in a CELSS via tissue culture: Prospects and problems

Micropropagation is currently used to clone fruits, nuts, and vegetables and involves controlling the outgrowth in vitro of basal, axillary, or adventitious buds. Following clonal multiplication, shoots are divided and rooted. This process has greatly reduced space and energy requirements in greenhouses and field nurseries and has increased multiplication rates by greater than 20 fold for some vegetatively propagated crops and breeding lines. Cereal and legume crops can also be cloned by tissue culture through somatic embryogenesis. Somatic embryos can be used to produce 'synthetic seed', which can tolerate desiccation and germinate upon rehydration. Synthetic seed of hybrid wheat, rice, soybean and other crops could be produced in a controlled ecological life support system. Thus, yield advantages of hybreds over inbreds (10 to 20 percent) could be exploited without having to provide additional facilities and energy for parental-line and hybrid seed nurseries.

Carman, John G.↗
NASA NTRS2017

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗
DOE OSTI2021

A new method to compute periodic orbits in general symplectic maps

The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work proposes a new method to compute high-order periodic orbits in twist maps without the use of symmetries. The method is a combination of the parameterization method in Fourier space and a Newton–Gauss multiple shooting scheme. The parameterization method has been successfully used in the past to compute quasi-periodic invariant circles. However, this is the first time that this method is used in the context of periodic orbits. Numerical examples are presented showing the accuracy and efficiency of the proposed method. Furthermore, the method is also applied to verify the renormalization prediction of the residues’ convergence at criticality (extensively studied in reversible maps) in the relatively unexplored case of maps without symmetries.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Probing reaction channels via reinforcement learning

Abstract Chemical reactions are dynamical processes involving the correlated reorganization of atomic configurations, driving the conversion of an initial reactant into a result product. By virtue of the metastability of both the reactants and products, chemical reactions are rare events, proceeding fleetingly. Reaction pathways can be modelled probabilistically by using the notion of reactive density in the phase space of the molecular system. Such density is related to a function known as the committor function, which describes the likelihood of a configuration evolving to one of the nearby metastable regions. In theory, the committor function can be obtained by solving the backward Kolmogorov equation (BKE), which is a partial differential equation (PDE) defined in the full dimensional phase space. However, using traditional methods to solve this problem is not practical for high dimensional systems. In this work, we propose a reinforcement learning based method to identify important configurations that connect reactant and product states along chemical reaction paths. By shooting multiple trajectories from these configurations, we can generate an ensemble of states that concentrate on the transition path ensemble. This configuration ensemble can be effectively employed in a neural network-based PDE solver to obtain an approximation solution of a restricted BKE, even when the dimension of the problem is very high. The resulting solution provides an approximation for the committor function that encodes mechanistic information for the reaction, paving a new way for understanding of complex chemical reactions and evaluation of reaction rates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗