Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multiple shooting method”

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

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.↗

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↗

Non-Linear Structural Dynamics Characterization using a Scanning Laser Vibrometer

This paper presents the use of a scanning laser vibrometer and a signal decomposition method to characterize non-linear dynamics of highly flexible structures. A Polytec PI PSV-200 scanning laser vibrometer is used to measure transverse velocities of points on a structure subjected to a harmonic excitation. Velocity profiles at different times are constructed using the measured velocities, and then each velocity profile is decomposed using the first four linear mode shapes and a least-squares curve-fitting method. From the variations of the obtained modal \ielocities with time we search for possible non-linear phenomena. A cantilevered titanium alloy beam subjected to harmonic base-excitations around the second. third, and fourth natural frequencies are examined in detail. Influences of the fixture mass. gravity. mass centers of mode shapes. and non-linearities are evaluated. Geometrically exact equations governing the planar, harmonic large-amplitude vibrations of beams are solved for operational deflection shapes using the multiple shooting method. Experimental results show the existence of 1:3 and 1:2:3 external and internal resonances. energy transfer from high-frequency modes to the first mode. and amplitude- and phase- modulation among several modes. Moreover, the existence of non-linear normal modes is found to be questionable.

Pai, P. F.↗

A new technique for calculating reentry base heating

The laminar base flow field of a two-dimensional reentry body has been studied by Telenin's method. The flow domain was divided into strips along the x-axis, and the flow variations were represented by Lagrange interpolation polynomials in the transformed vertical coordinate. The complete Navier-Stokes equations were used in the near wake region, and the boundary layer equations were applied elsewhere. The boundary conditions consisted of the flat plate thermal boundary layer in the forebody region and the near wake profile in the downstream region. The resulting two-point boundary value problem of 33 ordinary differential equations was then solved by the multiple shooting method. The detailed flow field and thermal environment in the base region are presented in the form of temperature contours, Mach number contours, velocity vectors, pressure distributions, and heat transfer coefficients on the base surface. The maximum heating rate was found on the centerline, and the two-dimensional stagnation point flow solution was adquate to estimate the maximum heating rate so long as the local Reynolds number could be obtained.

Meng, J. C. S.↗

Guidance and control strategies for aerospace vehicles

The optimal control problem arising in coplanar, orbital transfer employing aeroassist technology is addressed. The maneuver involves the transfer from high Earth orbit to low Earth orbit. A performance index is chosen the minimize the fuel consumpltion for the transfer. Simulations are carried out for establishing a corridor of entry conditions which are suitable for flying the spacecraft through the atmosphere. A highlight of the paper is the application of an efficient multiple shooting method for taming the notorious nonlinear, two-point, boundary value problem resulting from optimization procedure.

Naidu, Desineni S.↗

Fuel-optimal trajectories for aeroassisted coplanar orbital transfer problem

The optimal-control problem arising in coplanar orbital transfer using aeroassist technology is addressed. The maneuver involves the transfer from high earth orbit to low earth orbit with minimum fuel consumption. Simulations are carried out to obtain a corridor of entry conditions which are suitable for flying the spacecraft through the atmosphere. A highlight of the present work is the application of an efficient multiple shooting method for handling the difficult nonlinear two-point boundary value problem resulting from the optimization procedure.

Naidu, D. S.↗

Fuel-optimal trajectories for aeroassisted coplanar orbital transfer problem

The optimal control problem arising in coplanar orbital transfer employing aeroassist technology is addressed. The maneuver involves the transfer from high to low earth orbit via the atmosphere, with the object of minimizing the total fuel consumption. Simulations are carried out to obtain the fuel-optimal trajectories for flying the spacecraft through the atmosphere. A highlight is the application of an efficient multiple-shooting method for treating the nonlinear two-point boundary value problem resulting from the optimizaion procedure. The strategy for the atmospheric portion of the minimum-fuel transfer is to fly at the maximum lift-to-drag ratio L/D initially in order to recover from the downward plunge, and then to fly at a negative L/D to level off the flight so that the vehicle skips out of the atmosphere with a flight path angle near zero degrees.

Naidu, Desineni Subbaramaiah↗

Computation of optimal low- and medium-thrust orbit transfers

This paper presents the formulation of the optimal low- and medium-thrust orbit transfer control problem, numerical methods for solution, and numerical solutions of the problem. The problem formulation is for final mass maximization and allows for second-harmonic oblateness, atmospheric drag, and 3D noncoplanar nonaligned elliptic terminal orbits. We set up examples to demonstrate the ability of two indirect methods to solve the resulting two point boundary value problems (TPBVP). The methods demonstrated are the multiple point shooting method as formulated in Oberle's (1987) subroutine BOUNDSCO, and the minimizing boundary-condition method (MBCM). We find that although both methods can converge solutions, there are tradeoffs to using either method. We present numerical solutions of planar transfers in which both the initial orbit exit and final orbit entry points have been optimized. These solutions include two- and three-burn transfers. The methods used show an ability to handle thrust down to at least T/W(o) = O(10 exp -3). They also show similar convergence abilities with or without the oblateness and drag terms. We discuss the issue of maximizing with respect to the final time and provide evidence that implies a local optimum at a maximum final time for a given number of burns.

Chuang, C.-H.↗

Theory and computation of optimal low- and medium-thrust transfers

This report presents the formulation of the optimal low- and medium-thrust orbit transfer control problem and methods for numerical solution of the problem. The problem formulation is for final mass maximization and allows for second-harmonic oblateness, atmospheric drag, and three-dimensional, non-coplanar, non-aligned elliptic terminal orbits. We setup some examples to demonstrate the ability of two indirect methods to solve the resulting TPBVP's. The methods demonstrated are the multiple-point shooting method as formulated in H. J. Oberle's subroutine BOUNDSCO, and the minimizing boundary-condition method (MBCM). We find that although both methods can converge solutions, there are trade-offs to using either method. BOUNDSCO has very poor convergence for guesses that do not exhibit the correct switching structure. MBCM, however, converges for a wider range of guesses. However, BOUNDSCO's multi-point structure allows more freedom in quesses by increasing the node points as opposed to only quessing the initial state in MBCM. Finally, we note an additional drawback for BOUNDSCO: the routine does not supply information to the users routines for switching function polarity but only the location of a preset number of switching points.

Chuang, C.-H.↗

Small UAV Flight Planning in Urban Environments

This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.

Path planning↗

Fully Nonlinear Modeling and Analysis of Precision Membranes

High precision membranes are used in many current space applications. This paper presents a fully nonlinear membrane theory with forward and inverse analyses of high precision membrane structures. The fully nonlinear membrane theory is derived from Jaumann strains and stresses, exact coordinate transformations, the concept of local relative displacements, and orthogonal virtual rotations. In this theory, energy and Newtonian formulations are fully correlated, and every structural term can be interpreted in terms of vectors. Fully nonlinear ordinary differential equations (ODES) governing the large static deformations of known axisymmetric membranes under known axisymmetric loading (i.e., forward problems) are presented as first-order ODES, and a method for obtaining numerically exact solutions using the multiple shooting procedure is shown. A method for obtaining the undeformed geometry of any axisymmetric membrane with a known inflated geometry and a known internal pressure (i.e., inverse problems) is also derived. Numerical results from forward analysis are verified using results in the literature, and results from inverse analysis are verified using known exact solutions and solutions from the forward analysis. Results show that the membrane theory and the proposed numerical methods for solving nonlinear forward and inverse membrane problems are accurate.

Pai, P. Frank↗

Trajectory Optimization: OTIS 4

The latest release of the Optimal Trajectories by Implicit Simulation (OTIS4) allows users to simulate and optimize aerospace vehicle trajectories. With OTIS4, one can seamlessly generate optimal trajectories and parametric vehicle designs simultaneously. New features also allow OTIS4 to solve non-aerospace continuous time optimal control problems. The inputs and outputs of OTIS4 have been updated extensively from previous versions. Inputs now make use of objectoriented constructs, including one called a metastring. Metastrings use a greatly improved calculator and common nomenclature to reduce the user s workload. They allow for more flexibility in specifying vehicle physical models, boundary conditions, and path constraints. The OTIS4 calculator supports common mathematical functions, Boolean operations, and conditional statements. This allows users to define their own variables for use as outputs, constraints, or objective functions. The user-defined outputs can directly interface with other programs, such as spreadsheets, plotting packages, and visualization programs. Internally, OTIS4 has more explicit and implicit integration procedures, including high-order collocation methods, the pseudo-spectral method, and several variations of multiple shooting. Users may switch easily between the various methods. Several unique numerical techniques such as automated variable scaling and implicit integration grid refinement, support the integration methods. OTIS4 is also significantly more user friendly than previous versions. The installation process is nearly identical on various platforms, including Microsoft Windows, Apple OS X, and Linux operating systems. Cross-platform scripts also help make the execution of OTIS and post-processing of data easier. OTIS4 is supplied free by NASA and is subject to ITAR (International Traffic in Arms Regulations) restrictions. Users must have a Fortran compiler, and a Python interpreter is highly recommended.

Riehl, John P.↗

End-to-End Performance Optimization of a Crewed Lunar Landing Mission Staged from a Near Rectilinear Halo Orbit

A crewed lunar landing mission staged from a Near Rectilinear Halo Orbit (NRHO) presents a unique set of challenges not considered before for the Apollo-type direct missions. The NRHO does not have a fixed orbital plane and its period also changes with time, due to which the mission performance is very sensitive to the timing and location of the NRHO departure and arrival burns for a near-polar surface landing site. For such type of mission staged from the NRHO, an end-to-end optimization approach for the entire mission, from the NRHO departure to surface landing and from surface lift-off to the NRHO insertion, is well-suited for extracting the maximum performance out of this design. In this paper, an integrated approach for performing end-to-end optimization of a NRHO-staged crewed lunar landing mission is proposed that optimizes the in-space and powered flight segments simultaneously using Copernicus trajectory optimization tool. Copernicus is augmented with analytical approximations for the in-space, powered descent, and powered ascent segments in this work to improve the convergence of its multiple-shooting based direct optimization method. New analytical solutions are derived for the different phases of the powered flight segments by solving associated guidance problems. These analytical solutions act as initial guesses for starting the numerical optimization of the integrated mission in Copernicus. An example lunar landing mission is simulated to validate the proposed end-to-end optimization approach and the results are compared with the conventional patched trajectory approach.

Bharat Mahajan↗

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass- Or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood-allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass-or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood---allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗

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↗

Finite element method for optimal guidance of an advanced launch vehicle

A temporal finite element based on a mixed form of Hamilton's weak principle is summarized for optimal control problems. The resulting weak Hamiltonian finite element method is extended to allow for discontinuities in the states and/or discontinuities in the system equations. An extension of the formulation to allow for control inequality constraints is also presented. The formulation does not require element quadrature, and it produces a sparse system of nonlinear algebraic equations. To evaluate its feasibility for real-time guidance applications, this approach is applied to the trajectory optimization of a four-state, two-stage model with inequality constraints for an advanced launch vehicle. Numerical results for this model are presented and compared to results from a multiple-shooting code. The results show the accuracy and computational efficiency of the finite element method.

Hodges, Dewey H.↗