Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 1,729 records · Page 96

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

Preliminary design of low-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed and in some cases the final destination. In addition, a time-history of control variables must be chosen which defines the trajectory. There are often many thousands, if not millions, of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very diserable. This work presents such as an approach by posing the mission design problem as a multi-objective hybrid optimal control problem. The method is demonstrated on a hypothetical mission to the main asteroid belt.

Optimization↗

A fast, space-efficient average-case algorithm for the 'Greedy' Triangulation of a point set, and a proof that the Greedy Triangulation is not approximately optimal

The paper addresses the problem of how to find the Greedy Triangulation (GT) efficiently in the average case. It is noted that the problem is open whether there exists an efficient approximation algorithm to the Optimum Triangulation. It is first shown how in the worst case, the GT may be obtained in time O(n to the 3) and space O(n). Attention is then given to how the algorithm may be slightly modified to produce a time O(n to the 2), space O(n) solution in the average case. Finally, it is mentioned that Gilbert has found a worst case solution using totally different techniques that require space O(n to the 2) and time O(n to the 2 log n).

Manacher, G. K.↗

Rapid near-optimal aerospace plane trajectory generation and guidance

Effort was directed toward the problems of the real time trajectory optimization and guidance law development for the National Aerospace Plane (NASP) applications. In particular, singular perturbation methods were used to develop guidance algorithms suitable for onboard, real time implementation. The progress made in this research effort is reported.

Calise, A. J.↗

Optimal integer resolution for attitude determination using global positioning system signals

In this paper, a new motion-based algorithm for GPS integer ambiguity resolution is derived. The first step of this algorithm converts the reference sightline vectors into body frame vectors. This is accomplished by an optimal vectorized transformation of the phase difference measurements. The result of this transformation leads to the conversion of the integer ambiguities to vectorized biases. This essentially converts the problem to the familiar magnetometer-bias determination problem, for which an optimal and efficient solution exists. Also, the formulation in this paper is re-derived to provide a sequential estimate, so that a suitable stopping condition can be found during the vehicle motion. The advantages of the new algorithm include: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can sequentially estimate the ambiguities during the vehicle motion. The only disadvantage of the new algorithm is that it requires at least three non-coplanar baselines. The performance of the new algorithm is tested on a dynamic hardware simulator.

Crassidis, John L.↗

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

Preliminary design of low-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed, and in some cases the final destination. Because low-thrust trajectory design is tightly coupled with systems design, power and propulsion characteristics must be chosen as well. In addition, a time-history of control variables must be chosen which defines the trajectory. There are often many thousands, if not millions, of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the mission design problem as a multi-objective hybrid optimal control problem. The methods is demonstrated on hypothetical mission to the main asteroid belt and to Deimos.

Trajectory Design↗

Multi-Objective Hybrid Optimal Control for Multiple-Flyby Low-Thrust Mission Design

Preliminary design of low-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed, and in some cases the final destination. In addition, a time-history of control variables must be chosen that defines the trajectory. There are often many thousands, if not millions, of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the mission design problem as a multi-objective hybrid optimal control problem. The method is demonstrated on a hypothetical mission to the main asteroid belt.

Optimization↗

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

Preliminary design of low-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed, and in some cases the final destination. Because low-thrust trajectory design is tightly coupled with systems design, power and propulsion characteristics must be chosen as well. In addition, a time-history of control variables must be chosen which defines the trajectory. There are often may thousands, if not millions, of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the mission design problem as a multi-objective hybrid optimal control problem. The method is demonstrated on hypothetical mission to the main asteroid belt and to Deimos.

Low Thrust↗

Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

This paper investigates a convex optimization based method that can rapidly generate the fuel optimal asteroid powered descent trajectory. The ultimate goal is to autonomously design the optimal powered descent trajectory on-board the spacecraft immediately prior to the descent burn. Compared to a planetary powered landing problem, the major difficulty is the complex gravity field near the surface of an asteroid that cannot be approximated by a constant gravity field. This paper uses relaxation techniques and a successive solution process that seeks the solution to the original nonlinear, nonconvex problem through the solutions to a sequence of convex optimal control problems.

Pinson, Robin↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

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

Optimization in the systems engineering process

The objective is to look at optimization as it applies to the design process at a large aircraft company. The design process at Lockheed-Georgia is described. Some examples of the impact that optimization has had on that process are given, and then some areas that must be considered if optimization is to be successful and supportive in the total design process are indicated. Optimization must continue to be sold and this selling is best done by consistent good performance. For this good performance to occur, the future approaches must be clearly thought out so that the optimization methods solve the problems that actually occur during design. The visibility of the design process must be maintained as further developments are proposed. Careful attention must be given to the management of data in the optimization process, both for technical reasons and for administrative purposes. Finally, to satisfy program needs, provisions must be included to supply data to support program decisions, and to communicate with design processes outside of the optimization process. If designers fail to adequately consider all of these needs, the future acceptance of optimization will be impeded.

Lemmerman, L. A.↗

Fuel optimal reorientation of axisymmetric spin-stabilized satellites

The fuel optimal spin axis reorientation problem for large and small maneuver times is solved using a new numerical technique. The approach, which employs the adaptive grid bisection search, is shown to be useful in determining the fuel optimal impulsive control strategy, particularly when rapid maneuvers are desired. For large enough maneuver times, the method produces the two-impulse reorientation maneuver. For even larger maneuver times, the existence of multiple optimal pulsing schemes is demonstrated.

Redmond, Jim↗

Set covering algorithm, a subprogram of the scheduling algorithm for mission planning and logistic evaluation

A computer program using Lemke, Salkin and Spielberg's Set Covering Algorithm (SCA) to optimize a traffic model problem in the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) was documented. SCA forms a submodule of SAMPLE and provides for input and output, subroutines, and an interactive feature for performing the optimization and arranging the results in a readily understandable form for output.

Chang, H.↗

Airport Pricing Strategies

Conventional economic wisdom suggests that congestion pricing would be an appropriate response to cope with the growing congestion levels currently experienced at many airports. Several characteristics of aviation markets, however, may make naive congestion prices equal to the value of marginal travel delays a non-optimal response. This paper has developed a model of airport pricing that captures a number of these features. The model in particular reflects that airlines typically have market power and are engaged in oligopolistic competition at different sub-markets; that part of external travel delays that aircraft impose are internal to an operator and hence should not be accounted for in congestion tolls. We presented an analytical treatment for a simple bi-nodal symmetric network, which through the use of 'hyper-networks' would be readily applicable to dynamic problems (in discrete time) such as peak - off-peak differences, and some numerical exercises for the same symmetric network, which was only designed to illustrate the possible comparative static impacts of tolling, in addition to marginal equilibrium conditions as could be derived for the general model specification. Some main conclusions are that second-best optimal tolls are typically lower than what would be suggested by congestion costs alone and may even be negative, and that the toll as derived by Brueckner (2002) may not lead to an increase in total welfare. While Brueckner (2002) has made clear that congestion tolls on airports may be smaller than expected when congestion costs among aircraft are internal for a firm, our analysis adds to this that a further downward adjustment may be in order due to market power. The presence of market power (which causes prices to exceed marginal costs) may cause the pure congestion toll to be suboptimal, because the resulting decrease in demand is too high (the pure congestion tall does not take into account the decrease in consumer surplus). The various downward adjustments in welfare maximizing tolls may well cause the optimal values of these to be negative. Insofar as subsidization is considered unacceptable for whichever reason, our results warn that the most efficient among the non-negative tolls may actually be a zero toll; the pure congestion toll may actually decrease welfare compared to the base case. The model in this paper contains a few simplifying assumptions that may be relaxed in future work. Load factors and aircraft capacity are fixed in this model for simplicity. In a more advanced version of this model, load factors and aircraft capacity can be endogenized. This makes the derivation of the optimality conditions far more complicated, but it should be feasible in a numerical experiment. One can also add a fourth layer to the model, describing the airport's optimization problem. For example, the airport can maximize profits under a cost recovery constraint. The model then deals with interactions between four types of agents. No distinction is made between peak and off-peak traffic in this paper. Finally, the results of the numerical exercise in this paper need to be checked against an asymmetric equilibrium.

Pels, Eric↗

A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

Banks, H. T.↗

The powered swingby and its application to Jupiter orbit mission design

This paper is a description of recent studies of constrained optimal transfer between given hyperbolic asymptotes with an emphasis on the practical aspects of the concept for powered Galilean satellite swingby Jupiter orbit insertion. The effects of orbital inclination on performance gain are discussed and the targeting problem for establishing the optimal swingby is solved. Comparisons of some candidate mission profiles are presented and the advantages and disadvantages of the powered swingby orbit insertion are discussed in the context of recent interactions with the scientific community on the relative merits of several mission profiles now under consideration.

Uphoff, C.↗