Minimum-fuel, three-dimensional Earth-moon trajectories are obtained for spacecraft using both chemical and electric propulsion stages. The problem involves maximizing the final spacecraft mass delivered to a circular...
详细信息
Minimum-fuel, three-dimensional Earth-moon trajectories are obtained for spacecraft using both chemical and electric propulsion stages. The problem involves maximizing the final spacecraft mass delivered to a circular, polar midlunar orbit, The mission definition involves a chemical-stage boost from low-Earth orbit into a coasting ballistic trajectory followed by a lunar capture trajectory performed by the electric propulsion stage. For this analysis, the ballistic orbit transfer and the powered orbit transfer to a circular orbit within the lunar sphere of influence are modeled by the dynamics of the classical restricted three-body problem, and two body-centered coordinate frames are utilized, The subsequent descending three-dimensional spiral trajectory to circular polar midlunar orbit is computed via Edelbaum's analytic equations in order to eliminate the need to numerically simulate the numerous near-circular lunar orbits, Two classes of current-term electric propulsion thrusters are utilized (arcjet and plasma thrusters) along with current-term launch vehicle configurations, Numerical results are presented, and the optimal chemical-electric propulsion transfers exhibit a substantial reduction in trip time compared to Earth-moon transfers using electric propulsion alone.
We optimized the launch trajectory of an laser-sustained-plasma-type (LSP) laser propulsion rocket at an altitude of 500 km by considering transmission efficiency. The launch cost was calculated based on the results o...
详细信息
We optimized the launch trajectory of an laser-sustained-plasma-type (LSP) laser propulsion rocket at an altitude of 500 km by considering transmission efficiency. The launch cost was calculated based on the results of trajectory calculations. The transmission loss was considered to be the effect of atmospheric turbulence and focusing the performance of the lens. In the optimization problem, the Legendre-Gauss-Lobatto (LGL) method was used for discretization, and the sequential quadratic programming method was used to solve the optimization problem. The payload ratio was 18.0% with a laser power of 200 kW. In the launch calculation, the costs of the laser, electricity, propellant, and airframe were considered for the experience curve effect. The calculation indicated the cost of 267,000 launches was 29.1% of the cost of chemical propulsion.
The acceleration guidance concept is to plan an aerodynamic acceleration profile that integrates to the desired final position and velocity and satisfies all vehicle constraints and to track the acceleration profile. ...
详细信息
The acceleration guidance concept is to plan an aerodynamic acceleration profile that integrates to the desired final position and velocity and satisfies all vehicle constraints and to track the acceleration profile. The longitudinal entry guidance for the space shuttle is acceleration guidance: a drag deceleration profile that integrates to the desired downrange and satisfies the vehicle constraints is planned and tracked primarily by bank-angle adjustments. The kinematics relating the drag profile to the downrange assume that the entry trajectory is a great circle arc. In this paper we consider lateral as well as longitudinal motion in acceleration planning. Three differential equations that are the kinematic relations between the aerodynamic accelerations and the position and velocity variables with energy as the independent variable are used as the basis for two methods of planning the drag and lateral acceleration profiles. The first is simpler and produces a feasible trajectory for a given angle-of-attack profile. The second requires more computation, but produces an optimal trajectory using both angle-of-attack and angle-of-bank variations to control the entry trajectory and has greater capability to shape the entry trajectory. Both methods are demonstrated using an X-33 vehicle model. The optimal method is capable of achieving a specified final heading angle and adjusting the number of bank reversals.
This paper introduces a methodology for the reliability-based design optimization of systems with nonlinear aeroelastic constraints. The approach is based on the construction of explicit flutter and subcritical limit ...
详细信息
This paper introduces a methodology for the reliability-based design optimization of systems with nonlinear aeroelastic constraints. The approach is based on the construction of explicit flutter and subcritical limit cycle oscillation boundaries in terms of deterministic and random design variables. The boundaries are constructed using a support vector machine that provides a way to efficiently evaluate probabilities of failure and solve the reliability-based design optimization problem. Another major advantage of the approach is that it efficiently manages the discontinuities that might appear during subcritical limit cycle oscillations. The proposed approach is applied to the construction of flutter and subcritical limit cycle oscillation boundaries for a two-degree-of-freedom airfoil with nonlinear stiffnesses. The solution of a reliability-based design optimization problem with a constraint on the probability of subcritical limit cycle oscillation is also provided.
An augmented Lagrangian nonlinear programming algorithm has been developed. Its goals are to achieve robust global convergence and fast local convergence. Several unique strategie help the algorithm achieve these dual...
详细信息
An augmented Lagrangian nonlinear programming algorithm has been developed. Its goals are to achieve robust global convergence and fast local convergence. Several unique strategie help the algorithm achieve these dual goals. The algorithm consists of three nested loops. The outer loop estimates the Kuhn-Tucker multipliers at a rapid linear rate of convergence. linear rate of convergence. The middle loop minimizes the augmented Lagrangian function for fixed multipliers. This loop uses the sequential quadratic programming technique with a box trust region stepsize restriction. The inner loop solves a single quadratic program. Slack variables and a constrained form of the fixed-multiplier middle-loop problem work together with curved line searches in the inner-loop problem to allow large penalty weights for rapid outer-loop convergence. The inner-loop quadratic programs include quadratic constraint terms, which complicate the inner loop, but speed the middle-loop progress when the constraint curvature is large. The new algorithm compares favorably with a commercial sequential quadratic programming algorithm on five low-order test problems. Its convergence is more robust, and its speed is not much slower.
The noninvasive reconstruction of optical parameter fields in participating phantom is investigated experimentally based on the measured time-resolved radiative signals, which are detected by the time-correlated singl...
详细信息
The noninvasive reconstruction of optical parameter fields in participating phantom is investigated experimentally based on the measured time-resolved radiative signals, which are detected by the time-correlated single-photon counting system. The discrete ordinate method is employed to solve the forward transient radiative transfer equation to simulate the time-resolved radiative transfer in the physical phantom exposed to ultra-short pulse laser irradiation. On top of that, the sequential quadratic programming algorithm based on the generalized Gaussian Markov random field is applied to solve the inverse problem. To improve the computational efficiency, an adjoint equation technique is adopted to determine the gradient of objective function. Good agreement was obtained between the predicted optical parameter fields and realistic ones. All the reconstruction results demonstrate that the proposed reconstruction methods are proved to be accurate and efficient experimentally. (C) 2018 Elsevier Ltd. All rights reserved.
Studies the effect of both ply angle variation and the position of lumped massed on flutter speed for uniform thickness wind-tunnel models. Parametric study for uniform thickness beam; Optimization of nonuniform thick...
详细信息
Studies the effect of both ply angle variation and the position of lumped massed on flutter speed for uniform thickness wind-tunnel models. Parametric study for uniform thickness beam; Optimization of nonuniform thickness beam.
Concentrating on far-distance and fuel cooperative rendezvous between two coplanar spacecraft under impulse thrust, this paper presents fuel-optimal results obtained by optimization algorithms numerically. Former rese...
详细信息
Concentrating on far-distance and fuel cooperative rendezvous between two coplanar spacecraft under impulse thrust, this paper presents fuel-optimal results obtained by optimization algorithms numerically. Former research works have formulated optimization models of multiple-impulse orbit transfer and cooperative rendezvous under continuous thrust. In this paper, optimization models of cooperative rendezvous under impulse thrust are formulated based on these former researches. The process of cooperative rendezvous is simplified by introducing a hypothetical spacecraft. The degradation from cooperative rendezvous to active-passive rendezvous is prevented by revising objective functions. Quantum-behaved particle swarm optimization and sequential quadratic programming are combined to solve a practical problem, which is used to illustrate advantages of cooperative rendezvous when fuel consumption of one spacecraft is limited.
A trust-region sequential quadratic programming (SQP) method is developed and analyzed for the solution of smooth equality constrained optimization problems. The trust-region SQP algorithm is based on filter line se...
详细信息
A trust-region sequential quadratic programming (SQP) method is developed and analyzed for the solution of smooth equality constrained optimization problems. The trust-region SQP algorithm is based on filter line search technique and a composite-step approach, which decomposes the overall step as sum of a vertical step and a horizontal step. The algorithm includes critical modifications of horizontal step computation. One orthogonal projective matrix of the Jacobian of constraint functions is employed in trust-region subproblems. The orthogonal projection gives the null space of the trans- position of the Jacobian of the constraint function. Theoretical analysis shows that the new algorithm retains the global convergence to the first-order critical points under rather general conditions. The preliminary numerical results are reported.
sequential quadratic programming and interior point methods are effective general purpose optimization algorithms that sometimes exhibit poor performance in topology optimization applications. We postulate that this p...
详细信息
sequential quadratic programming and interior point methods are effective general purpose optimization algorithms that sometimes exhibit poor performance in topology optimization applications. We postulate that this performance behavior stems from the frequent failure of BFGS updates for common topology optimization problem formulations that reduces the effectiveness of the resulting Hessian approximations. To address this issue, we propose a computationally efficient correction technique that utilizes problem-specific second-order derivative information to remove negative curvature contributions and achieve better overall optimizer performance. The proposed technique is tested on compliance and natural frequency topology optimization problem sets and compared against the quasi-Newton optimizers ParOpt, IPOPT, and SNOPT with the BFGS and SR1 Hessian approximations, as well as MMA. The results show that the optimizer with the proposed correction produces optimized designs in fewer function evaluations with either lower or competitive objective and discreteness metric values compared to other quasi-Newton based optimizers. Finally, scalability of the implementation is demonstrated by solving large-scale problems that have up to 96.9 million degrees of freedom with adaptively refined meshes.
暂无评论