Trajectory optimization using parallel shooting method on parallel computer
Abstract
The efficiency of a parallel shooting method on a parallel computer for solving a variety of optimal control guidance problems is studied. Several examples are considered to demonstrate that a speedup of nearly 7 to 1 is achieved with the use of 16 processors. It is suggested that further improvements in performance can be achieved by parallelizing in the state domain. 10 refs.
 Authors:
 Texas A&M Univ., College Station, TX (United States)
 Publication Date:
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 101965
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Guidance Control and Dynamics; Journal Volume: 18; Journal Issue: 2; Other Information: PBD: Mar 1995
 Country of Publication:
 United States
 Language:
 English
 Subject:
 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; DIFFERENTIAL EQUATIONS; ITERATIVE METHODS; TRAJECTORIES; OPTIMIZATION; PARALLEL PROCESSING; ALGORITHMS
Citation Formats
Wirthman, D.J., Park, S.Y., and Vadali, S.R. Trajectory optimization using parallel shooting method on parallel computer. United States: N. p., 1995.
Web. doi:10.2514/3.21397.
Wirthman, D.J., Park, S.Y., & Vadali, S.R. Trajectory optimization using parallel shooting method on parallel computer. United States. doi:10.2514/3.21397.
Wirthman, D.J., Park, S.Y., and Vadali, S.R. 1995.
"Trajectory optimization using parallel shooting method on parallel computer". United States.
doi:10.2514/3.21397.
@article{osti_101965,
title = {Trajectory optimization using parallel shooting method on parallel computer},
author = {Wirthman, D.J. and Park, S.Y. and Vadali, S.R.},
abstractNote = {The efficiency of a parallel shooting method on a parallel computer for solving a variety of optimal control guidance problems is studied. Several examples are considered to demonstrate that a speedup of nearly 7 to 1 is achieved with the use of 16 processors. It is suggested that further improvements in performance can be achieved by parallelizing in the state domain. 10 refs.},
doi = {10.2514/3.21397},
journal = {Journal of Guidance Control and Dynamics},
number = 2,
volume = 18,
place = {United States},
year = 1995,
month = 3
}
DOI: 10.2514/3.21397
Other availability
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

A parallel computer implementation of power system transient stability assessment using the transient energy function method
This paper describes the development of a parallel version of the transient energy function method program on a supercomputer. The step by step procedure to convert a sequential code to a parallel environment is detailed. The parallel code is then tested on a 50generator Ontario Hydro network. With six parallel processors, an elapsed time speedup of 5.36 is obtained. 
Parallel Shooting solution of the neutron transport equation in spherical geometry
ABS>A direct and efficient parallelshooting method is given for the solution of the spherical harmonics approximation to the neutron transport equation in spherical geometry with arbitrary anisotropic scattering and source. The special numerical difficulties due to the singularity at the center of the sphere are solved in a simple and efficient way. The algorithna measures'' the roundoff instability of the problem and eliminates it by performing a minimum of matrix transformations that ensure the linear independence of the matrix columns. (auth) 
Pseudoconjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
Parallel algorithms and test case results for the solution of the unconstrained optimization problem are presented. The algorithms involve the use of pseudoconjugate directions (directions which tend to become conjugate as the solution is approached). It is shown that the algorithms are both fast and robust. Although all the algorithms of this paper involve the parallel execution of linear search procedures, a critical differentiation can be made among them, depending on whether the linear searches are performed along the same direction (parallel unidirectional algorithms) or different directions (parallel multidirectional algorithms). 14 references. 
The threedimensional nonadiabatic dynamics calculation of DH{sub 2}{sup +} and HD{sub 2}{sup +} systems by using the trajectory surface hopping method based on the ZhuNakamura theory
A theoretical investigation on the nonadiabatic processes of the full threedimensional D{sup +}+H{sub 2} and H{sup +}+D{sub 2} reaction systems has been performed by using trajectory surface hopping (TSH) method based on the ZhuNakamura (ZN) theory. This ZNTSH method refers to not only classically allowed hops but also classically forbidden hops. The potential energy surface constructed by Kamisaka et al. is employed in the calculation. A new iterative method is proposed to yield the twodimensional seam surface from the topography of the adiabatic potential surfaces, in which the inconvenience of directly solving the firstorder partial differential equation is avoided. Themore »