Four-body trajectory optimization

NASA Technical Reports Server (NTRS)

Pu, C. L.; Edelbaum, T. N.

1973-01-01

A collection of typical three-body trajectories from the L1 libration point on the sun-earth line to the earth is presented. These trajectories in the sun-earth system are grouped into four distinct families which differ in transfer time and delta V requirements. Curves showing the variations of delta V with respect to transfer time, and typical two and three-impulse primer vector histories, are included. The development of a four-body trajectory optimization program to compute fuel optimal trajectories between the earth and a point in the sun-earth-moon system are also discussed. Methods for generating fuel optimal two-impulse trajectories which originate at the earth or a point in space, and fuel optimal three-impulse trajectories between two points in space, are presented. A brief qualitative comparison of these methods is given. An example of a four-body two-impulse transfer from the Li libration point to the earth is included.

Survey of optimization techniques for nonlinear spacecraft trajectory searches

NASA Technical Reports Server (NTRS)

Wang, Tseng-Chan; Stanford, Richard H.; Sunseri, Richard F.; Breckheimer, Peter J.

1988-01-01

Mathematical analysis of the optimal search of a nonlinear spacecraft trajectory to arrive at a set of desired targets is presented. A high precision integrated trajectory program and several optimization software libraries are used to search for a converged nonlinear spacecraft trajectory. Several examples for the Galileo Jupiter Orbiter and the Ocean Topography Experiment (TOPEX) are presented that illustrate a variety of the optimization methods used in nonlinear spacecraft trajectory searches.

Constrained Multi-Level Algorithm for Trajectory Optimization

NASA Astrophysics Data System (ADS)

Adimurthy, V.; Tandon, S. R.; Jessy, Antony; Kumar, C. Ravi

The emphasis on low cost access to space inspired many recent developments in the methodology of trajectory optimization. Ref.1 uses a spectral patching method for optimization, where global orthogonal polynomials are used to describe the dynamical constraints. A two-tier approach of optimization is used in Ref.2 for a missile mid-course trajectory optimization. A hybrid analytical/numerical approach is described in Ref.3, where an initial analytical vacuum solution is taken and gradually atmospheric effects are introduced. Ref.4 emphasizes the fact that the nonlinear constraints which occur in the initial and middle portions of the trajectory behave very nonlinearly with respect the variables making the optimization very difficult to solve in the direct and indirect shooting methods. The problem is further made complex when different phases of the trajectory have different objectives of optimization and also have different path constraints. Such problems can be effectively addressed by multi-level optimization. In the multi-level methods reported so far, optimization is first done in identified sub-level problems, where some coordination variables are kept fixed for global iteration. After all the sub optimizations are completed, higher-level optimization iteration with all the coordination and main variables is done. This is followed by further sub system optimizations with new coordination variables. This process is continued until convergence. In this paper we use a multi-level constrained optimization algorithm which avoids the repeated local sub system optimizations and which also removes the problem of non-linear sensitivity inherent in the single step approaches. Fall-zone constraints, structural load constraints and thermal constraints are considered. In this algorithm, there is only a single multi-level sequence of state and multiplier updates in a framework of an augmented Lagrangian. Han Tapia multiplier updates are used in view of their special role in diagonalised methods, being the only single update with quadratic convergence. For a single level, the diagonalised multiplier method (DMM) is described in Ref.5. The main advantage of the two-level analogue of the DMM approach is that it avoids the inner loop optimizations required in the other methods. The scheme also introduces a gradient change measure to reduce the computational time needed to calculate the gradients. It is demonstrated that the new multi-level scheme leads to a robust procedure to handle the sensitivity of the constraints, and the multiple objectives of different trajectory phases. Ref. 1. Fahroo, F and Ross, M., " A Spectral Patching Method for Direct Trajectory Optimization" The Journal of the Astronautical Sciences, Vol.48, 2000, pp.269-286 Ref. 2. Phililps, C.A. and Drake, J.C., "Trajectory Optimization for a Missile using a Multitier Approach" Journal of Spacecraft and Rockets, Vol.37, 2000, pp.663-669 Ref. 3. Gath, P.F., and Calise, A.J., " Optimization of Launch Vehicle Ascent Trajectories with Path Constraints and Coast Arcs", Journal of Guidance, Control, and Dynamics, Vol. 24, 2001, pp.296-304 Ref. 4. Betts, J.T., " Survey of Numerical Methods for Trajectory Optimization", Journal of Guidance, Control, and Dynamics, Vol.21, 1998, pp. 193-207 Ref. 5. Adimurthy, V., " Launch Vehicle Trajectory Optimization", Acta Astronautica, Vol.15, 1987, pp.845-850.

Reliability-based trajectory optimization using nonintrusive polynomial chaos for Mars entry mission

NASA Astrophysics Data System (ADS)

Huang, Yuechen; Li, Haiyang

2018-06-01

This paper presents the reliability-based sequential optimization (RBSO) method to settle the trajectory optimization problem with parametric uncertainties in entry dynamics for Mars entry mission. First, the deterministic entry trajectory optimization model is reviewed, and then the reliability-based optimization model is formulated. In addition, the modified sequential optimization method, in which the nonintrusive polynomial chaos expansion (PCE) method and the most probable point (MPP) searching method are employed, is proposed to solve the reliability-based optimization problem efficiently. The nonintrusive PCE method contributes to the transformation between the stochastic optimization (SO) and the deterministic optimization (DO) and to the approximation of trajectory solution efficiently. The MPP method, which is used for assessing the reliability of constraints satisfaction only up to the necessary level, is employed to further improve the computational efficiency. The cycle including SO, reliability assessment and constraints update is repeated in the RBSO until the reliability requirements of constraints satisfaction are satisfied. Finally, the RBSO is compared with the traditional DO and the traditional sequential optimization based on Monte Carlo (MC) simulation in a specific Mars entry mission to demonstrate the effectiveness and the efficiency of the proposed method.

A Robot Trajectory Optimization Approach for Thermal Barrier Coatings Used for Free-Form Components

NASA Astrophysics Data System (ADS)

Cai, Zhenhua; Qi, Beichun; Tao, Chongyuan; Luo, Jie; Chen, Yuepeng; Xie, Changjun

2017-10-01

This paper is concerned with a robot trajectory optimization approach for thermal barrier coatings. As the requirements of high reproducibility of complex workpieces increase, an optimal thermal spraying trajectory should not only guarantee an accurate control of spray parameters defined by users (e.g., scanning speed, spray distance, scanning step, etc.) to achieve coating thickness homogeneity but also help to homogenize the heat transfer distribution on the coating surface. A mesh-based trajectory generation approach is introduced in this work to generate path curves on a free-form component. Then, two types of meander trajectories are generated by performing a different connection method. Additionally, this paper presents a research approach for introducing the heat transfer analysis into the trajectory planning process. Combining heat transfer analysis with trajectory planning overcomes the defects of traditional trajectory planning methods (e.g., local over-heating), which helps form the uniform temperature field by optimizing the time sequence of path curves. The influence of two different robot trajectories on the process of heat transfer is estimated by coupled FEM models which demonstrates the effectiveness of the presented optimization approach.

A Method of Trajectory Design for Manned Asteroid Explorations1,2

NASA Astrophysics Data System (ADS)

Gan, Qing-Bo; Zhang, Yang; Zhu, Zheng-Fan; Han, Wei-Hua; Dong, Xin

2015-07-01

A trajectory optimization method for the nuclear-electric propulsion manned asteroid explorations is presented. In the case of launching between 2035 and 2065, based on the two-pulse single-cycle Lambert transfer orbit, the phases of departure from and return to the Earth are searched at first. Then the optimal flight trajectory is selected by pruning the flight sequences in two feasible regions. Setting the flight strategy of propelling-taxiing-propelling, and taking the minimal fuel consumption as the performance index, the nuclear-electric propulsion flight trajectory is optimized using the hybrid method. Finally, taking the segmentally optimized parameters as the initial values, in accordance with the overall mission constraints, the globally optimized parameters are obtained. And the numerical and diagrammatical results are given at the same time.

Trajectory optimization for the National Aerospace Plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1993-01-01

The objective of this second phase research is to investigate the optimal ascent trajectory for the National Aerospace Plane (NASP) from runway take-off to orbital insertion and address the unique problems associated with the hypersonic flight trajectory optimization. The trajectory optimization problem for an aerospace plane is a highly challenging problem because of the complexity involved. Previous work has been successful in obtaining sub-optimal trajectories by using energy-state approximation and time-scale decomposition techniques. But it is known that the energy-state approximation is not valid in certain portions of the trajectory. This research aims at employing full dynamics of the aerospace plane and emphasizing direct trajectory optimization methods. The major accomplishments of this research include the first-time development of an inverse dynamics approach in trajectory optimization which enables us to generate optimal trajectories for the aerospace plane efficiently and reliably, and general analytical solutions to constrained hypersonic trajectories that has wide application in trajectory optimization as well as in guidance and flight dynamics. Optimal trajectories in abort landing and ascent augmented with rocket propulsion and thrust vectoring control were also investigated. Motivated by this study, a new global trajectory optimization tool using continuous simulated annealing and a nonlinear predictive feedback guidance law have been under investigation and some promising results have been obtained, which may well lead to more significant development and application in the near future.

Automated trajectory planning for multiple-flyby interplanetary missions

NASA Astrophysics Data System (ADS)

Englander, Jacob

Many space mission planning problems may be formulated as hybrid optimal control problems (HOCP), i.e. problems that include both real-valued variables and categorical variables. In interplanetary trajectory design problems the categorical variables will typically specify the sequence of planets at which to perform flybys, and the real-valued variables will represent the launch date, ight times between planets, magnitudes and directions of thrust, flyby altitudes, etc. The contribution of this work is a framework for the autonomous optimization of multiple-flyby interplanetary trajectories. The trajectory design problem is converted into a HOCP with two nested loops: an "outer-loop" that finds the sequence of flybys and an "inner-loop" that optimizes the trajectory for each candidate yby sequence. The problem of choosing a sequence of flybys is posed as an integer programming problem and solved using a genetic algorithm (GA). This is an especially difficult problem to solve because GAs normally operate on a fixed-length set of decision variables. Since in interplanetary trajectory design the number of flyby maneuvers is not known a priori, it was necessary to devise a method of parameterizing the problem such that the GA can evolve a variable-length sequence of flybys. A novel "null gene" transcription was developed to meet this need. Then, for each candidate sequence of flybys, a trajectory must be found that visits each of the flyby targets and arrives at the final destination while optimizing some cost metric, such as minimizing ▵v or maximizing the final mass of the spacecraft. Three different classes of trajectory are described in this work, each of which requireda different physical model and optimization method. The choice of a trajectory model and optimization method is especially challenging because of the nature of the hybrid optimal control problem. Because the trajectory optimization problem is generated in real time by the outer-loop, the inner-loop optimization algorithm cannot require any a priori information and must always return a solution. In addition, the upper and lower bounds on each decision variable cannot be chosen a priori by the user because the user has no way to know what problem will be solved. Instead a method of choosing upper and lower bounds via a set of simple rules was developed and used for all three types of trajectory optimization problem. Many optimization algorithms were tested and discarded until suitable algorithms were found for each type of trajectory. The first class of trajectories use chemical propulsion and may only apply a ▵v at the periapse of each flyby. These Multiple Gravity Assist (MGA) trajectories are optimized using a cooperative algorithm of Differential Evolution (DE) and Particle Swarm Optimization (PSO). The second class of trajectories, known as Multiple Gravity Assist with one Deep Space Maneuver (MGA-DSM), also use chemical propulsion but instead of maneuvering at the periapse of each flyby as in the MGA case a maneuver is applied at a free point along each planet-to-planet arc, i.e. there is one maneuver for each pair of flybys. MGA-DSM trajectories are parameterized by more variables than MGA trajectories, and so the cooperative algorithm of DE and PSO that was used to optimize MGA trajectories was found to be less effective when applied to MGA-DSM. Instead, either PSO or DE alone were found to be more effective. The third class of trajectories addressed in this work are those using continuousthrust propulsion. Continuous-thrust trajectory optimization problems are more challenging than impulsive-thrust problems because the control variables are a continuous time series rather than a small set of parameters and because the spacecraft does not follow a conic section trajectory, leading to a large number of nonlinear constraints that must be satisfied to ensure that the spacecraft obeys the equations of motion. Many models and optimization algorithms were applied including direct transcription with nonlinear programming (DTNLP), the inverse-polynomial shapebased method, and feasible region analysis. However the only physical model and optimization method that proved reliable enough were the Sims-Flanagan transcription coupled with a nonlinear programming solver and the monotonic basin hopping (MBH) global search heuristic. The methods developed here are demonstrated to optimize a set of example trajectories, including a recreation of the Cassini mission, a Galileo-like mission, and conceptual continuous-thrust missions to Jupiter, Mercury, and Uranus.

Interplanetary Program to Optimize Simulated Trajectories (IPOST). Volume 2: Analytic manual

NASA Technical Reports Server (NTRS)

Hong, P. E.; Kent, P. D.; Olson, D. W.; Vallado, C. A.

1992-01-01

The Interplanetary Program to Optimize Space Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence of trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the cost function. Targeting and optimization is performed using the Stanford NPSOL algorithm. IPOST structure allows subproblems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Trajectory optimization for an asymmetric launch vehicle. M.S. Thesis - MIT

NASA Technical Reports Server (NTRS)

Sullivan, Jeanne Marie

1990-01-01

A numerical optimization technique is used to fully automate the trajectory design process for an symmetric configuration of the proposed Advanced Launch System (ALS). The objective of the ALS trajectory design process is the maximization of the vehicle mass when it reaches the desired orbit. The trajectories used were based on a simple shape that could be described by a small set of parameters. The use of a simple trajectory model can significantly reduce the computation time required for trajectory optimization. A predictive simulation was developed to determine the on-orbit mass given an initial vehicle state, wind information, and a set of trajectory parameters. This simulation utilizes an idealized control system to speed computation by increasing the integration time step. The conjugate gradient method is used for the numerical optimization of on-orbit mass. The method requires only the evaluation of the on-orbit mass function using the predictive simulation, and the gradient of the on-orbit mass function with respect to the trajectory parameters. The gradient is approximated with finite differencing. Prelaunch trajectory designs were carried out using the optimization procedure. The predictive simulation is used in flight to redesign the trajectory to account for trajectory deviations produced by off-nominal conditions, e.g., stronger than expected head winds.

Safe-trajectory optimization and tracking control in ultra-close proximity to a failed satellite

NASA Astrophysics Data System (ADS)

Zhang, Jingrui; Chu, Xiaoyu; Zhang, Yao; Hu, Quan; Zhai, Guang; Li, Yanyan

2018-03-01

This paper presents a trajectory-optimization method for a chaser spacecraft operating in ultra-close proximity to a failed satellite. Based on the combination of active and passive trajectory protection, the constraints in the optimization framework are formulated for collision avoidance and successful docking in the presence of any thruster failure. The constraints are then handled by an adaptive Gauss pseudospectral method, in which the dynamic residuals are used as the metric to determine the distribution of collocation points. A finite-time feedback control is further employed in tracking the optimized trajectory. In particular, the stability and convergence of the controller are proved. Numerical results are given to demonstrate the effectiveness of the proposed methods.

Minimum impulse three-body trajectories.

NASA Technical Reports Server (NTRS)

D'Amario, L.; Edelbaum, T. N.

1973-01-01

A rapid and accurate method of calculating optimal impulsive transfers in the restricted problem of three bodies has been developed. The technique combines a multi-conic method of trajectory integration with primer vector theory and an accelerated gradient method of trajectory optimization. A unique feature is that the state transition matrix and the primer vector are found analytical without additional integrations or differentiations. The method has been applied to the determination of optimal two and three impulse transfers between the L2 libration point and circular orbits about both the earth and the moon.

Multiobjective Optimization of Low-Energy Trajectories Using Optimal Control on Dynamical Channels

NASA Technical Reports Server (NTRS)

Coffee, Thomas M.; Anderson, Rodney L.; Lo, Martin W.

2011-01-01

We introduce a computational method to design efficient low-energy trajectories by extracting initial solutions from dynamical channels formed by invariant manifolds, and improving these solutions through variational optimal control. We consider trajectories connecting two unstable periodic orbits in the circular restricted 3-body problem (CR3BP). Our method leverages dynamical channels to generate a range of solutions, and approximates the areto front for impulse and time of flight through a multiobjective optimization of these solutions based on primer vector theory. We demonstrate the application of our method to a libration orbit transfer in the Earth-Moon system.

Fuzzy physical programming for Space Manoeuvre Vehicles trajectory optimization based on hp-adaptive pseudospectral method

NASA Astrophysics Data System (ADS)

Chai, Runqi; Savvaris, Al; Tsourdos, Antonios

2016-06-01

In this paper, a fuzzy physical programming (FPP) method has been introduced for solving multi-objective Space Manoeuvre Vehicles (SMV) skip trajectory optimization problem based on hp-adaptive pseudospectral methods. The dynamic model of SMV is elaborated and then, by employing hp-adaptive pseudospectral methods, the problem has been transformed to nonlinear programming (NLP) problem. According to the mission requirements, the solutions were calculated for each single-objective scenario. To get a compromised solution for each target, the fuzzy physical programming (FPP) model is proposed. The preference function is established with considering the fuzzy factor of the system such that a proper compromised trajectory can be acquired. In addition, the NSGA-II is tested to obtain the Pareto-optimal solution set and verify the Pareto optimality of the FPP solution. Simulation results indicate that the proposed method is effective and feasible in terms of dealing with the multi-objective skip trajectory optimization for the SMV.

Co-state initialization for the minimum-time low-thrust trajectory optimization

NASA Astrophysics Data System (ADS)

Taheri, Ehsan; Li, Nan I.; Kolmanovsky, Ilya

2017-05-01

This paper presents an approach for co-state initialization which is a critical step in solving minimum-time low-thrust trajectory optimization problems using indirect optimal control numerical methods. Indirect methods used in determining the optimal space trajectories typically result in two-point boundary-value problems and are solved by single- or multiple-shooting numerical methods. Accurate initialization of the co-state variables facilitates the numerical convergence of iterative boundary value problem solvers. In this paper, we propose a method which exploits the trajectory generated by the so-called pseudo-equinoctial and three-dimensional finite Fourier series shape-based methods to estimate the initial values of the co-states. The performance of the approach for two interplanetary rendezvous missions from Earth to Mars and from Earth to asteroid Dionysus is compared against three other approaches which, respectively, exploit random initialization of co-states, adjoint-control transformation and a standard genetic algorithm. The results indicate that by using our proposed approach the percent of the converged cases is higher for trajectories with higher number of revolutions while the computation time is lower. These features are advantageous for broad trajectory search in the preliminary phase of mission designs.

Optimal short-range trajectories for helicopters

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slater, G.L.; Erzberger, H.

1982-12-01

An optimal flight path algorithm using a simplified altitude state model and a priori climb cruise descent flight profile was developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. In addition, a method was developed for obtaining a performance model in simplified form which is based on standard flight manual data and which is applicable to the computation of optimal trajectories. The entire performance optimization algorithm is simple enough that on line trajectory optimization is feasible with a relatively small computer. The helicopter model used is the Silorsky S-61N. Themore » results show that for this vehicle the optimal flight path and optimal cruise altitude can represent a 10% fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability because of helicopter weight, ambient winds, and the relative cost trade off between time and fuel. In general, reasonable variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost. For fuel optimal trajectories, the optimum cruise altitude varies from the maximum (12,000 ft) to the minimum (0 ft) depending on helicopter weight.« less

Interplanetary program to optimize simulated trajectories (IPOST). Volume 4: Sample cases

NASA Technical Reports Server (NTRS)

Hong, P. E.; Kent, P. D; Olson, D. W.; Vallado, C. A.

1992-01-01

The Interplanetary Program to Optimize Simulated Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence of trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the cost function. Targeting and optimization are performed using the Standard NPSOL algorithm. The IPOST structure allows sub-problems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Optimal solar sail planetocentric trajectories

NASA Technical Reports Server (NTRS)

Sackett, L. L.

1977-01-01

The analysis of solar sail planetocentric optimal trajectory problem is described. A computer program was produced to calculate optimal trajectories for a limited performance analysis. A square sail model is included and some consideration is given to a heliogyro sail model. Orbit to a subescape point and orbit to orbit transfer are considered. Trajectories about the four inner planets can be calculated and shadowing, oblateness, and solar motion may be included. Equinoctial orbital elements are used to avoid the classical singularities, and the method of averaging is applied to increase computational speed. Solution of the two-point boundary value problem which arises from the application of optimization theory is accomplished with a Newton procedure. Time optimal trajectories are emphasized, but a penalty function has been considered to prevent trajectories which intersect a planet's surface.

Comparison of kinematic and dynamic leg trajectory optimization techniques for biped robot locomotion

NASA Astrophysics Data System (ADS)

Khusainov, R.; Klimchik, A.; Magid, E.

2017-01-01

The paper presents comparison analysis of two approaches in defining leg trajectories for biped locomotion. The first one operates only with kinematic limitations of leg joints and finds the maximum possible locomotion speed for given limits. The second approach defines leg trajectories from the dynamic stability point of view and utilizes ZMP criteria. We show that two methods give different trajectories and demonstrate that trajectories based on pure dynamic optimization cannot be realized due to joint limits. Kinematic optimization provides unstable solution which can be balanced by upper body movement.

Adaptive surrogate model based multi-objective transfer trajectory optimization between different libration points

NASA Astrophysics Data System (ADS)

Peng, Haijun; Wang, Wei

2016-10-01

An adaptive surrogate model-based multi-objective optimization strategy that combines the benefits of invariant manifolds and low-thrust control toward developing a low-computational-cost transfer trajectory between libration orbits around the L1 and L2 libration points in the Sun-Earth system has been proposed in this paper. A new structure for a multi-objective transfer trajectory optimization model that divides the transfer trajectory into several segments and gives the dominations for invariant manifolds and low-thrust control in different segments has been established. To reduce the computational cost of multi-objective transfer trajectory optimization, a mixed sampling strategy-based adaptive surrogate model has been proposed. Numerical simulations show that the results obtained from the adaptive surrogate-based multi-objective optimization are in agreement with the results obtained using direct multi-objective optimization methods, and the computational workload of the adaptive surrogate-based multi-objective optimization is only approximately 10% of that of direct multi-objective optimization. Furthermore, the generating efficiency of the Pareto points of the adaptive surrogate-based multi-objective optimization is approximately 8 times that of the direct multi-objective optimization. Therefore, the proposed adaptive surrogate-based multi-objective optimization provides obvious advantages over direct multi-objective optimization methods.

Linearization methods for optimizing the low thrust spacecraft trajectory: Theoretical aspects

NASA Astrophysics Data System (ADS)

Kazmerchuk, P. V.

2016-12-01

The theoretical aspects of the modified linearization method, which makes it possible to solve a wide class of nonlinear problems on optimizing low-thrust spacecraft trajectories (V. V. Efanov et al., 2009; V. V. Khartov et al., 2010) are examined. The main modifications of the linearization method are connected with its refinement for optimizing the main dynamic systems and design parameters of the spacecraft.

Analytical Approach to the Fuel Optimal Impulsive Transfer Problem Using Primer Vector Method

NASA Astrophysics Data System (ADS)

Fitrianingsih, E.; Armellin, R.

2018-04-01

One of the objectives of mission design is selecting an optimum orbital transfer which often translated as a transfer which requires minimum propellant consumption. In order to assure the selected trajectory meets the requirement, the optimality of transfer should first be analyzed either by directly calculating the ΔV of the candidate trajectories and select the one that gives a minimum value or by evaluating the trajectory according to certain criteria of optimality. The second method is performed by analyzing the profile of the modulus of the thrust direction vector which is known as primer vector. Both methods come with their own advantages and disadvantages. However, it is possible to use the primer vector method to verify if the result from the direct method is truly optimal or if the ΔV can be reduced further by implementing correction maneuver to the reference trajectory. In addition to its capability to evaluate the transfer optimality without the need to calculate the transfer ΔV, primer vector also enables us to identify the time and position to apply correction maneuver in order to optimize a non-optimum transfer. This paper will present the analytical approach to the fuel optimal impulsive transfer using primer vector method. The validity of the method is confirmed by comparing the result to those from the numerical method. The investigation of the optimality of direct transfer is used to give an example of the application of the method. The case under study is the prograde elliptic transfers from Earth to Mars. The study enables us to identify the optimality of all the possible transfers.

Implementation of a Low-Thrust Trajectory Optimization Algorithm for Preliminary Design

NASA Technical Reports Server (NTRS)

Sims, Jon A.; Finlayson, Paul A.; Rinderle, Edward A.; Vavrina, Matthew A.; Kowalkowski, Theresa D.

2006-01-01

A tool developed for the preliminary design of low-thrust trajectories is described. The trajectory is discretized into segments and a nonlinear programming method is used for optimization. The tool is easy to use, has robust convergence, and can handle many intermediate encounters. In addition, the tool has a wide variety of features, including several options for objective function and different low-thrust propulsion models (e.g., solar electric propulsion, nuclear electric propulsion, and solar sail). High-thrust, impulsive trajectories can also be optimized.

Method of interplanetary trajectory optimization for the spacecraft with low thrust and swing-bys

NASA Astrophysics Data System (ADS)

Konstantinov, M. S.; Thein, M.

2017-07-01

The method developed to avoid the complexity of solving the multipoint boundary value problem while optimizing interplanetary trajectories of the spacecraft with electric propulsion and a sequence of swing-bys is presented in the paper. This method is based on the use of the preliminary problem solutions for the impulsive trajectories. The preliminary problem analyzed at the first stage of the study is formulated so that the analysis and optimization of a particular flight path is considered as the unconstrained minimum in the space of the selectable parameters. The existing methods can effectively solve this problem and make it possible to identify rational flight paths (the sequence of swing-bys) to receive the initial approximation for the main characteristics of the flight path (dates, values of the hyperbolic excess velocity, etc.). These characteristics can be used to optimize the trajectory of the spacecraft with electric propulsion. The special feature of the work is the introduction of the second (intermediate) stage of the research. At this stage some characteristics of the analyzed flight path (e.g. dates of swing-bys) are fixed and the problem is formulated so that the trajectory of the spacecraft with electric propulsion is optimized on selected sites of the flight path. The end-to-end optimization is carried out at the third (final) stage of the research. The distinctive feature of this stage is the analysis of the full set of optimal conditions for the considered flight path. The analysis of the characteristics of the optimal flight trajectories to Jupiter with Earth, Venus and Mars swing-bys for the spacecraft with electric propulsion are presented. The paper shows that the spacecraft weighing more than 7150 kg can be delivered into the vicinity of Jupiter along the trajectory with two Earth swing-bys by use of the space transportation system based on the "Angara A5" rocket launcher, the chemical upper stage "KVTK" and the electric propulsion system with input electrical power of 100 kW.

Trajectory Optimization for Missions to Small Bodies with a Focus on Scientific Merit.

PubMed

Englander, Jacob A; Vavrina, Matthew A; Lim, Lucy F; McFadden, Lucy A; Rhoden, Alyssa R; Noll, Keith S

2017-01-01

Trajectory design for missions to small bodies is tightly coupled both with the selection of targets for a mission and with the choice of spacecraft power, propulsion, and other hardware. Traditional methods of trajectory optimization have focused on finding the optimal trajectory for an a priori selection of destinations and spacecraft parameters. Recent research has expanded the field of trajectory optimization to multidisciplinary systems optimization that includes spacecraft parameters. The logical next step is to extend the optimization process to include target selection based not only on engineering figures of merit but also scientific value. This paper presents a new technique to solve the multidisciplinary mission optimization problem for small-bodies missions, including classical trajectory design, the choice of spacecraft power and propulsion systems, and also the scientific value of the targets. This technique, when combined with modern parallel computers, enables a holistic view of the small body mission design process that previously required iteration among several different design processes.

Interplanetary Program to Optimize Simulated Trajectories (IPOST). Volume 1: User's guide

NASA Technical Reports Server (NTRS)

Hong, P. E.; Kent, P. D.; Olson, D. W.; Vallado, C. A.

1992-01-01

IPOST is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence fo trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the coat function. Targeting and optimization is performed using the Stanford NPSOL algorithm. IPOST structure allows sub-problems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Low-thrust trajectory optimization of asteroid sample return mission with multiple revolutions and moon gravity assists

NASA Astrophysics Data System (ADS)

Tang, Gao; Jiang, FanHuag; Li, JunFeng

2015-11-01

Near-Earth asteroids have gained a lot of interest and the development in low-thrust propulsion technology makes complex deep space exploration missions possible. A mission from low-Earth orbit using low-thrust electric propulsion system to rendezvous with near-Earth asteroid and bring sample back is investigated. By dividing the mission into five segments, the complex mission is solved separately. Then different methods are used to find optimal trajectories for every segment. Multiple revolutions around the Earth and multiple Moon gravity assists are used to decrease the fuel consumption to escape from the Earth. To avoid possible numerical difficulty of indirect methods, a direct method to parameterize the switching moment and direction of thrust vector is proposed. To maximize the mass of sample, optimal control theory and homotopic approach are applied to find the optimal trajectory. Direct methods of finding proper time to brake the spacecraft using Moon gravity assist are also proposed. Practical techniques including both direct and indirect methods are investigated to optimize trajectories for different segments and they can be easily extended to other missions and more precise dynamic model.

Numerical optimization of actuator trajectories for ITER hybrid scenario profile evolution

NASA Astrophysics Data System (ADS)

van Dongen, J.; Felici, F.; Hogeweij, G. M. D.; Geelen, P.; Maljaars, E.

2014-12-01

Optimal actuator trajectories for an ITER hybrid scenario ramp-up are computed using a numerical optimization method. For both L-mode and H-mode scenarios, the time trajectory of plasma current, EC heating and current drive distribution is determined that minimizes a chosen cost function, while satisfying constraints. The cost function is formulated to reflect two desired properties of the plasma q profile at the end of the ramp-up. The first objective is to maximize the ITG turbulence threshold by maximizing the volume-averaged s/q ratio. The second objective is to achieve a stationary q profile by having a flat loop voltage profile. Actuator and physics-derived constraints are included, imposing limits on plasma current, ramp rates, internal inductance and q profile. This numerical method uses the fast control-oriented plasma profile evolution code RAPTOR, which is successfully benchmarked against more complete CRONOS simulations for L-mode and H-mode mode ITER hybrid scenarios. It is shown that the optimized trajectories computed using RAPTOR also result in an improved ramp-up scenario for CRONOS simulations using the same input trajectories. Furthermore, the optimal trajectories are shown to vary depending on the precise timing of the L-H transition.

Fast Optimization for Aircraft Descent and Approach Trajectory

NASA Technical Reports Server (NTRS)

Luchinsky, Dmitry G.; Schuet, Stefan; Brenton, J.; Timucin, Dogan; Smith, David; Kaneshige, John

2017-01-01

We address problem of on-line scheduling of the aircraft descent and approach trajectory. We formulate a general multiphase optimal control problem for optimization of the descent trajectory and review available methods of its solution. We develop a fast algorithm for solution of this problem using two key components: (i) fast inference of the dynamical and control variables of the descending trajectory from the low dimensional flight profile data and (ii) efficient local search for the resulting reduced dimensionality non-linear optimization problem. We compare the performance of the proposed algorithm with numerical solution obtained using optimal control toolbox General Pseudospectral Optimal Control Software. We present results of the solution of the scheduling problem for aircraft descent using novel fast algorithm and discuss its future applications.

Singular-Arc Time-Optimal Trajectory of Aircraft in Two-Dimensional Wind Field

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2006-01-01

This paper presents a study of a minimum time-to-climb trajectory analysis for aircraft flying in a two-dimensional altitude dependent wind field. The time optimal control problem possesses a singular control structure when the lift coefficient is taken as a control variable. A singular arc analysis is performed to obtain an optimal control solution on the singular arc. Using a time-scale separation with the flight path angle treated as a fast state, the dimensionality of the optimal control solution is reduced by eliminating the lift coefficient control. A further singular arc analysis is used to decompose the original optimal control solution into the flight path angle solution and a trajectory solution as a function of the airspeed and altitude. The optimal control solutions for the initial and final climb segments are computed using a shooting method with known starting values on the singular arc The numerical results of the shooting method show that the optimal flight path angle on the initial and final climb segments are constant. The analytical approach provides a rapid means for analyzing a time optimal trajectory for aircraft performance.

Autonomous optimal trajectory design employing convex optimization for powered descent on an asteroid

NASA Astrophysics Data System (ADS)

Pinson, Robin Marie

Mission proposals that land spacecraft on asteroids are becoming increasingly popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site with pinpoint precision. The problem under investigation is how to design a propellant (fuel) optimal powered descent trajectory that can be quickly computed onboard the spacecraft, without interaction from ground control. The goal is to autonomously design the optimal powered descent trajectory onboard the spacecraft immediately prior to the descent burn for use during the burn. Compared to a planetary powered landing problem, the challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies, and low thrust vehicles. The nonlinear gravity fields cannot be represented by a constant gravity model nor a Newtonian model. The trajectory design algorithm needs to be robust and efficient to guarantee a designed trajectory and complete the calculations in a reasonable time frame. This research investigates the following questions: Can convex optimization be used to design the minimum propellant powered descent trajectory for a soft landing on an asteroid? Is this method robust and reliable to allow autonomy onboard the spacecraft without interaction from ground control? This research designed a convex optimization based method that rapidly generates the propellant optimal asteroid powered descent trajectory. The solution to the convex optimization problem is the thrust magnitude and direction, which designs and determines the trajectory. The propellant optimal problem was formulated as a second order cone program, a subset of convex optimization, through relaxation techniques by including a slack variable, change of variables, and incorporation of the successive solution method. Convex optimization solvers, especially second order cone programs, are robust, reliable, and are guaranteed to find the global minimum provided one exists. In addition, an outer optimization loop using Brent's method determines the optimal flight time corresponding to the minimum propellant usage over all flight times. Inclusion of additional trajectory constraints, solely vertical motion near the landing site and glide slope, were evaluated. Through a theoretical proof involving the Minimum Principle from Optimal Control Theory and the Karush-Kuhn-Tucker conditions it was shown that the relaxed problem is identical to the original problem at the minimum point. Therefore, the optimal solution of the relaxed problem is an optimal solution of the original problem, referred to as lossless convexification. A key finding is that this holds for all levels of gravity model fidelity. The designed thrust magnitude profiles were the bang-bang predicted by Optimal Control Theory. The first high fidelity gravity model employed was the 2x2 spherical harmonics model assuming a perfect triaxial ellipsoid and placement of the coordinate frame at the asteroid's center of mass and aligned with the semi-major axes. The spherical harmonics model is not valid inside the Brillouin sphere and this becomes relevant for irregularly shaped asteroids. Then, a higher fidelity model was implemented combining the 4x4 spherical harmonics gravity model with the interior spherical Bessel gravity model. All gravitational terms in the equations of motion are evaluated with the position vector from the previous iteration, creating the successive solution method. Methodology success was shown by applying the algorithm to three triaxial ellipsoidal asteroids with four different rotation speeds using the 2x2 gravity model. Finally, the algorithm was tested using the irregularly shaped asteroid, Castalia.

Near-Optimal Re-Entry Trajectories for Reusable Launch Vehicles

NASA Technical Reports Server (NTRS)

Chou, H.-C.; Ardema, M. D.; Bowles, J. V.

1997-01-01

A near-optimal guidance law for the descent trajectory for earth orbit re-entry of a fully reusable single-stage-to-orbit pure rocket launch vehicle is derived. A methodology is developed to investigate using both bank angle and altitude as control variables and selecting parameters that maximize various performance functions. The method is based on the energy-state model of the aircraft equations of motion. The major task of this paper is to obtain optimal re-entry trajectories under a variety of performance goals: minimum time, minimum surface temperature, minimum heating, and maximum heading change; four classes of trajectories were investigated: no banking, optimal left turn banking, optimal right turn banking, and optimal bank chattering. The cost function is in general a weighted sum of all performance goals. In particular, the trade-off between minimizing heat load into the vehicle and maximizing cross range distance is investigated. The results show that the optimization methodology can be used to derive a wide variety of near-optimal trajectories.

Rapid design and optimization of low-thrust rendezvous/interception trajectory for asteroid deflection missions

NASA Astrophysics Data System (ADS)

Li, Shuang; Zhu, Yongsheng; Wang, Yukai

2014-02-01

Asteroid deflection techniques are essential in order to protect the Earth from catastrophic impacts by hazardous asteroids. Rapid design and optimization of low-thrust rendezvous/interception trajectories is considered as one of the key technologies to successfully deflect potentially hazardous asteroids. In this paper, we address a general framework for the rapid design and optimization of low-thrust rendezvous/interception trajectories for future asteroid deflection missions. The design and optimization process includes three closely associated steps. Firstly, shape-based approaches and genetic algorithm (GA) are adopted to perform preliminary design, which provides a reasonable initial guess for subsequent accurate optimization. Secondly, Radau pseudospectral method is utilized to transcribe the low-thrust trajectory optimization problem into a discrete nonlinear programming (NLP) problem. Finally, sequential quadratic programming (SQP) is used to efficiently solve the nonlinear programming problem and obtain the optimal low-thrust rendezvous/interception trajectories. The rapid design and optimization algorithms developed in this paper are validated by three simulation cases with different performance indexes and boundary constraints.

Optimal heliocentric trajectories for solar sail with minimum area

NASA Astrophysics Data System (ADS)

Petukhov, Vyacheslav G.

2018-05-01

The fixed-time heliocentric trajectory optimization problem is considered for planar solar sail with minimum area. Necessary optimality conditions are derived, a numerical method for solving the problem is developed, and numerical examples of optimal trajectories to Mars, Venus and Mercury are presented. The dependences of the minimum area of the solar sail from the date of departure from the Earth, the time of flight and the departing hyperbolic excess of velocity are analyzed. In particular, for the rendezvous problem (approaching a target planet with zero relative velocity) with zero departing hyperbolic excess of velocity for a flight duration of 1200 days it was found that the minimum area-to-mass ratio should be about 12 m2/kg for trajectory to Venus, 23.5 m2/kg for the trajectory to Mercury and 25 m2/kg for trajectory to Mars.

Optimal trajectory generation for mechanical arms. M.S. Thesis

NASA Technical Reports Server (NTRS)

Iemenschot, J. A.

1972-01-01

A general method of generating optimal trajectories between an initial and a final position of an n degree of freedom manipulator arm with nonlinear equations of motion is proposed. The method is based on the assumption that the time history of each of the coordinates can be expanded in a series of simple time functions. By searching over the coefficients of the terms in the expansion, trajectories which minimize the value of a given cost function can be obtained. The method has been applied to a planar three degree of freedom arm.

Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm

NASA Astrophysics Data System (ADS)

Wang, Mingming; Luo, Jianjun; Fang, Jing; Yuan, Jianping

2018-03-01

The existence of the path dependent dynamic singularities limits the volume of available workspace of free-floating space robot and induces enormous joint velocities when such singularities are met. In order to overcome this demerit, this paper presents an optimal joint trajectory planning method using forward kinematics equations of free-floating space robot, while joint motion laws are delineated with application of the concept of reaction null-space. Bézier curve, in conjunction with the null-space column vectors, are applied to describe the joint trajectories. Considering the forward kinematics equations of the free-floating space robot, the trajectory planning issue is consequently transferred to an optimization issue while the control points to construct the Bézier curve are the design variables. A constrained differential evolution (DE) scheme with premature handling strategy is implemented to find the optimal solution of the design variables while specific objectives and imposed constraints are satisfied. Differ from traditional methods, we synthesize null-space and specialized curve to provide a novel viewpoint for trajectory planning of free-floating space robot. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) kinematically redundant manipulator mounted on a free-floating spacecraft and demonstrate the feasibility and effectiveness of the proposed method.

A modular approach to intensity-modulated arc therapy optimization with noncoplanar trajectories

NASA Astrophysics Data System (ADS)

Papp, Dávid; Bortfeld, Thomas; Unkelbach, Jan

2015-07-01

Utilizing noncoplanar beam angles in volumetric modulated arc therapy (VMAT) has the potential to combine the benefits of arc therapy, such as short treatment times, with the benefits of noncoplanar intensity modulated radiotherapy (IMRT) plans, such as improved organ sparing. Recently, vendors introduced treatment machines that allow for simultaneous couch and gantry motion during beam delivery to make noncoplanar VMAT treatments possible. Our aim is to provide a reliable optimization method for noncoplanar isocentric arc therapy plan optimization. The proposed solution is modular in the sense that it can incorporate different existing beam angle selection and coplanar arc therapy optimization methods. Treatment planning is performed in three steps. First, a number of promising noncoplanar beam directions are selected using an iterative beam selection heuristic; these beams serve as anchor points of the arc therapy trajectory. In the second step, continuous gantry/couch angle trajectories are optimized using a simple combinatorial optimization model to define a beam trajectory that efficiently visits each of the anchor points. Treatment time is controlled by limiting the time the beam needs to trace the prescribed trajectory. In the third and final step, an optimal arc therapy plan is found along the prescribed beam trajectory. In principle any existing arc therapy optimization method could be incorporated into this step; for this work we use a sliding window VMAT algorithm. The approach is demonstrated using two particularly challenging cases. The first one is a lung SBRT patient whose planning goals could not be satisfied with fewer than nine noncoplanar IMRT fields when the patient was treated in the clinic. The second one is a brain tumor patient, where the target volume overlaps with the optic nerves and the chiasm and it is directly adjacent to the brainstem. Both cases illustrate that the large number of angles utilized by isocentric noncoplanar VMAT plans can help improve dose conformity, homogeneity, and organ sparing simultaneously using the same beam trajectory length and delivery time as a coplanar VMAT plan.

Coordinated trajectory planning of dual-arm space robot using constrained particle swarm optimization

NASA Astrophysics Data System (ADS)

Wang, Mingming; Luo, Jianjun; Yuan, Jianping; Walter, Ulrich

2018-05-01

Application of the multi-arm space robot will be more effective than single arm especially when the target is tumbling. This paper investigates the application of particle swarm optimization (PSO) strategy to coordinated trajectory planning of the dual-arm space robot in free-floating mode. In order to overcome the dynamics singularities issue, the direct kinematics equations in conjunction with constrained PSO are employed for coordinated trajectory planning of dual-arm space robot. The joint trajectories are parametrized with Bézier curve to simplify the calculation. Constrained PSO scheme with adaptive inertia weight is implemented to find the optimal solution of joint trajectories while specific objectives and imposed constraints are satisfied. The proposed method is not sensitive to the singularity issue due to the application of forward kinematic equations. Simulation results are presented for coordinated trajectory planning of two kinematically redundant manipulators mounted on a free-floating spacecraft and demonstrate the effectiveness of the proposed method.

Trajectory planning of free-floating space robot using Particle Swarm Optimization (PSO)

NASA Astrophysics Data System (ADS)

Wang, Mingming; Luo, Jianjun; Walter, Ulrich

2015-07-01

This paper investigates the application of Particle Swarm Optimization (PSO) strategy to trajectory planning of the kinematically redundant space robot in free-floating mode. Due to the path dependent dynamic singularities, the volume of available workspace of the space robot is limited and enormous joint velocities are required when such singularities are met. In order to overcome this effect, the direct kinematics equations in conjunction with PSO are employed for trajectory planning of free-floating space robot. The joint trajectories are parametrized with the Bézier curve to simplify the calculation. Constrained PSO scheme with adaptive inertia weight is implemented to find the optimal solution of joint trajectories while specific objectives and imposed constraints are satisfied. The proposed method is not sensitive to the singularity issue due to the application of forward kinematic equations. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) redundant manipulator mounted on a free-floating spacecraft and demonstrate the effectiveness of the proposed method.

Exact and explicit optimal solutions for trajectory planning and control of single-link flexible-joint manipulators

NASA Technical Reports Server (NTRS)

Chen, Guanrong

1991-01-01

An optimal trajectory planning problem for a single-link, flexible joint manipulator is studied. A global feedback-linearization is first applied to formulate the nonlinear inequality-constrained optimization problem in a suitable way. Then, an exact and explicit structural formula for the optimal solution of the problem is derived and the solution is shown to be unique. It turns out that the optimal trajectory planning and control can be done off-line, so that the proposed method is applicable to both theoretical analysis and real time tele-robotics control engineering.

Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

NASA Technical Reports Server (NTRS)

Pinson, Robin; Lu, Ping

2015-01-01

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.

Task driven optimal leg trajectories in insect-scale legged microrobots

NASA Astrophysics Data System (ADS)

Doshi, Neel; Goldberg, Benjamin; Jayaram, Kaushik; Wood, Robert

Origami inspired layered manufacturing techniques and 3D-printing have enabled the development of highly articulated legged robots at the insect-scale, including the 1.43g Harvard Ambulatory MicroRobot (HAMR). Research on these platforms has expanded its focus from manufacturing aspects to include design optimization and control for application-driven tasks. Consequently, the choice of gait selection, body morphology, leg trajectory, foot design, etc. have become areas of active research. HAMR has two controlled degrees-of-freedom per leg, making it an ideal candidate for exploring leg trajectory. We will discuss our work towards optimizing HAMR's leg trajectories for two different tasks: climbing using electroadhesives and level ground running (5-10 BL/s). These tasks demonstrate the ability of single platform to adapt to vastly different locomotive scenarios: quasi-static climbing with controlled ground contact, and dynamic running with un-controlled ground contact. We will utilize trajectory optimization methods informed by existing models and experimental studies to determine leg trajectories for each task. We also plan to discuss how task specifications and choice of objective function have contributed to the shape of these optimal leg trajectories.

Mystic: Implementation of the Static Dynamic Optimal Control Algorithm for High-Fidelity, Low-Thrust Trajectory Design

NASA Technical Reports Server (NTRS)

Whiffen, Gregory J.

2006-01-01

Mystic software is designed to compute, analyze, and visualize optimal high-fidelity, low-thrust trajectories, The software can be used to analyze inter-planetary, planetocentric, and combination trajectories, Mystic also provides utilities to assist in the operation and navigation of low-thrust spacecraft. Mystic will be used to design and navigate the NASA's Dawn Discovery mission to orbit the two largest asteroids, The underlying optimization algorithm used in the Mystic software is called Static/Dynamic Optimal Control (SDC). SDC is a nonlinear optimal control method designed to optimize both 'static variables' (parameters) and dynamic variables (functions of time) simultaneously. SDC is a general nonlinear optimal control algorithm based on Bellman's principal.

OTIS 3.2 Software Released

NASA Technical Reports Server (NTRS)

Riehl, John P.; Sjauw, Waldy K.

2004-01-01

Trajectory, mission, and vehicle engineers concern themselves with finding the best way for an object to get from one place to another. These engineers rely upon special software to assist them in this. For a number of years, many engineers have used the OTIS program for this assistance. With OTIS, an engineer can fully optimize trajectories for airplanes, launch vehicles like the space shuttle, interplanetary spacecraft, and orbital transfer vehicles. OTIS provides four modes of operation, with each mode providing successively stronger optimization capability. The most powerful mode uses a mathematical method called implicit integration to solve what engineers and mathematicians call the optimal control problem. OTIS 3.2, which was developed at the NASA Glenn Research Center, is the latest release of this industry workhorse and features new capabilities for parameter optimization and mission design. OTIS stands for Optimal Control by Implicit Simulation, and it is implicit integration that makes OTIS so powerful at solving trajectory optimization problems. Why is this so important? The optimization process not only determines how to get from point A to point B, but it can also determine how to do this with the least amount of propellant, with the lightest starting weight, or in the fastest time possible while avoiding certain obstacles along the way. There are numerous conditions that engineers can use to define optimal, or best. OTIS provides a framework for defining the starting and ending points of the trajectory (point A and point B), the constraints on the trajectory (requirements like "avoid these regions where obstacles occur"), and what is being optimized (e.g., minimize propellant). The implicit integration method can find solutions to very complicated problems when there is not a lot of information available about what the optimal trajectory might be. The method was first developed for solving two-point boundary value problems and was adapted for use in OTIS. Implicit integration usually allows OTIS to find solutions to problems much faster than programs that use explicit integration and parametric methods. Consequently, OTIS is best suited to solving very complicated and highly constrained problems.

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

NASA Technical Reports Server (NTRS)

Hughes, Kyle M.; Knittel, Jeremy M.; Englander, Jacob A.

2017-01-01

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.

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

NASA Technical Reports Server (NTRS)

Hughes, Kyle M.; Knittel, Jeremy M.; Englander, Jacob A.

2017-01-01

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.

Optimal Trajectories for the Helicopter in One-Engine-Inoperative Terminal-Area Operations

NASA Technical Reports Server (NTRS)

Zhao, Yiyuan; Chen, Robert T. N.

1996-01-01

This paper presents a summary of a series of recent analytical studies conducted to investigate One-Engine-Inoperative (OEI) optimal control strategies and the associated optimal trajectories for a twin engine helicopter in Category-A terminal-area operations. These studies also examine the associated heliport size requirements and the maximum gross weight capability of the helicopter. Using an eight states, two controls, augmented point-mass model representative of the study helicopter, Continued TakeOff (CTO), Rejected TakeOff (RTO), Balked Landing (BL), and Continued Landing (CL) are investigated for both Vertical-TakeOff-and-Landing (VTOL) and Short-TakeOff-and-Landing (STOL) terminal-area operations. The formulation of the nonlinear optimal control problems with considerations for realistic constraints, solution methods for the two-point boundary-value problem, a new real-time generation method for the optimal OEI trajectories, and the main results of this series of trajectory optimization studies are presented. In particular, a new balanced- weight concept for determining the takeoff decision point for VTOL Category-A operations is proposed, extending the balanced-field length concept used for STOL operations.

Shaping low-thrust trajectories with thrust-handling feature

NASA Astrophysics Data System (ADS)

Taheri, Ehsan; Kolmanovsky, Ilya; Atkins, Ella

2018-02-01

Shape-based methods are becoming popular in low-thrust trajectory optimization due to their fast computation speeds. In existing shape-based methods constraints are treated at the acceleration level but not at the thrust level. These two constraint types are not equivalent since spacecraft mass decreases over time as fuel is expended. This paper develops a shape-based method based on a Fourier series approximation that is capable of representing trajectories defined in spherical coordinates and that enforces thrust constraints. An objective function can be incorporated to minimize overall mission cost, i.e., achieve minimum ΔV . A representative mission from Earth to Mars is studied. The proposed Fourier series technique is demonstrated capable of generating feasible and near-optimal trajectories. These attributes can facilitate future low-thrust mission designs where different trajectory alternatives must be rapidly constructed and evaluated.

An Energy-Aware Trajectory Optimization Layer for sUAS

NASA Astrophysics Data System (ADS)

Silva, William A.

The focus of this work is the implementation of an energy-aware trajectory optimization algorithm that enables small unmanned aircraft systems (sUAS) to operate in unknown, dynamic severe weather environments. The software is designed as a component of an Energy-Aware Dynamic Data Driven Application System (EA-DDDAS) for sUAS. This work addresses the challenges of integrating and executing an online trajectory optimization algorithm during mission operations in the field. Using simplified aircraft kinematics, the energy-aware algorithm enables extraction of kinetic energy from measured winds to optimize thrust use and endurance during flight. The optimization layer, based upon a nonlinear program formulation, extracts energy by exploiting strong wind velocity gradients in the wind field, a process known as dynamic soaring. The trajectory optimization layer extends the energy-aware path planner developed by Wenceslao Shaw-Cortez te{Shaw-cortez2013} to include additional mission configurations, simulations with a 6-DOF model, and validation of the system with flight testing in June 2015 in Lubbock, Texas. The trajectory optimization layer interfaces with several components within the EA-DDDAS to provide an sUAS with optimal flight trajectories in real-time during severe weather. As a result, execution timing, data transfer, and scalability are considered in the design of the software. Severe weather also poses a measure of unpredictability to the system with respect to communication between systems and available data resources during mission operations. A heuristic mission tree with different cost functions and constraints is implemented to provide a level of adaptability to the optimization layer. Simulations and flight experiments are performed to assess the efficacy of the trajectory optimization layer. The results are used to assess the feasibility of flying dynamic soaring trajectories with existing controllers as well as to verify the interconnections between EA-DDDAS components. Results also demonstrate the usage of the trajectory optimization layer in conjunction with a lattice-based path planner as a method of guiding the optimization layer and stitching together subsequent trajectories.

A Smoothed Eclipse Model for Solar Electric Propulsion Trajectory Optimization

NASA Technical Reports Server (NTRS)

Aziz, Jonathan D.; Scheeres, Daniel J.; Parker, Jeffrey S.; Englander, Jacob A.

2017-01-01

Solar electric propulsion (SEP) is the dominant design option for employing low-thrust propulsion on a space mission. Spacecraft solar arrays power the SEP system but are subject to blackout periods during solar eclipse conditions. Discontinuity in power available to the spacecraft must be accounted for in trajectory optimization, but gradient-based methods require a differentiable power model. This work presents a power model that smooths the eclipse transition from total eclipse to total sunlight with a logistic function. Example trajectories are computed with differential dynamic programming, a second-order gradient-based method.

Real-time control of optimal low-thrust transfer to the Sun-Earth L 1 halo orbit in the bicircular four-body problem

NASA Astrophysics Data System (ADS)

Salmani, Majid; Büskens, Christof

2011-11-01

In this article, after describing a procedure to construct trajectories for a spacecraft in the four-body model, a method to correct the trajectory violations is presented. To construct the trajectories, periodic orbits as the solutions of the three-body problem are used. On the other hand, the bicircular model based on the Sun-Earth rotating frame governs the dynamics of the spacecraft and other bodies. A periodic orbit around the first libration-point L1 is the destination of the mission which is one of the equilibrium points in the Sun-Earth/Moon three-body problem. In the way to reach such a far destination, there are a lot of disturbances such as solar radiation and winds that make the plans untrustworthy. However, the solar radiation pressure is considered in the system dynamics. To prevail over these difficulties, considering the whole transfer problem as an optimal control problem makes the designer to be able to correct the unavoidable violations from the pre-designed trajectory and strategies. The optimal control problem is solved by a direct method, transcribing it into a nonlinear programming problem. This transcription gives an unperturbed optimal trajectory and its sensitivities with respect perturbations. Modeling these perturbations as parameters embedded in a parametric optimal control problem, one can take advantage of the parametric sensitivity analysis of nonlinear programming problem to recalculate the optimal trajectory with a very smaller amount of computation costs. This is obtained by evaluating a first-order Taylor expansion of the perturbed solution in an iterative process which is aimed to achieve an admissible solution. At the end, the numerical results show the applicability of the presented method.

An Expert System-Driven Method for Parametric Trajectory Optimization During Conceptual Design

NASA Technical Reports Server (NTRS)

Dees, Patrick D.; Zwack, Mathew R.; Steffens, Michael; Edwards, Stephen; Diaz, Manuel J.; Holt, James B.

2015-01-01

During the early phases of engineering design, the costs committed are high, costs incurred are low, and the design freedom is high. It is well documented that decisions made in these early design phases drive the entire design's life cycle cost. In a traditional paradigm, key design decisions are made when little is known about the design. As the design matures, design changes become more difficult in both cost and schedule to enact. The current capability-based paradigm, which has emerged because of the constrained economic environment, calls for the infusion of knowledge usually acquired during later design phases into earlier design phases, i.e. bringing knowledge acquired during preliminary and detailed design into pre-conceptual and conceptual design. An area of critical importance to launch vehicle design is the optimization of its ascent trajectory, as the optimal trajectory will be able to take full advantage of the launch vehicle's capability to deliver a maximum amount of payload into orbit. Hence, the optimal ascent trajectory plays an important role in the vehicle's affordability posture yet little of the information required to successfully optimize a trajectory is known early in the design phase. Thus, the current paradigm of optimizing ascent trajectories involves generating point solutions for every change in a vehicle's design parameters. This is often a very tedious, manual, and time-consuming task for the analysts. Moreover, the trajectory design space is highly non-linear and multi-modal due to the interaction of various constraints. When these obstacles are coupled with the Program to Optimize Simulated Trajectories (POST), an industry standard program to optimize ascent trajectories that is difficult to use, expert trajectory analysts are required to effectively optimize a vehicle's ascent trajectory. Over the course of this paper, the authors discuss a methodology developed at NASA Marshall's Advanced Concepts Office to address these issues. The methodology is two-fold: first, capture the heuristics developed by human analysts over their many years of experience; and secondly, leverage the power of modern computing to evaluate multiple trajectories simultaneously and therefore enable the exploration of the trajectory's design space early during the pre- conceptual and conceptual phases of design. This methodology is coupled with design of experiments in order to train surrogate models, which enables trajectory design space visualization and parametric optimal ascent trajectory information to be available when early design decisions are being made.

Optimization of the interplanetary trajectories of spacecraft with a solar electric propulsion power plant of minimal power

NASA Astrophysics Data System (ADS)

Ivanyukhin, A. V.; Petukhov, V. G.

2016-12-01

The problem of optimizing the interplanetary trajectories of a spacecraft (SC) with a solar electric propulsion system (SEPS) is examined. The problem of investigating the permissible power minimum of the solar electric propulsion power plant required for a successful flight is studied. Permissible ranges of thrust and exhaust velocity are analyzed for the given range of flight time and final mass of the spacecraft. The optimization is performed according to Portnyagin's maximum principle, and the continuation method is used for reducing the boundary problem of maximal principle to the Cauchy problem and to study the solution/ parameters dependence. Such a combination results in the robust algorithm that reduces the problem of trajectory optimization to the numerical integration of differential equations by the continuation method.

Parallel Aircraft Trajectory Optimization with Analytic Derivatives

NASA Technical Reports Server (NTRS)

Falck, Robert D.; Gray, Justin S.; Naylor, Bret

2016-01-01

Trajectory optimization is an integral component for the design of aerospace vehicles, but emerging aircraft technologies have introduced new demands on trajectory analysis that current tools are not well suited to address. Designing aircraft with technologies such as hybrid electric propulsion and morphing wings requires consideration of the operational behavior as well as the physical design characteristics of the aircraft. The addition of operational variables can dramatically increase the number of design variables which motivates the use of gradient based optimization with analytic derivatives to solve the larger optimization problems. In this work we develop an aircraft trajectory analysis tool using a Legendre-Gauss-Lobatto based collocation scheme, providing analytic derivatives via the OpenMDAO multidisciplinary optimization framework. This collocation method uses an implicit time integration scheme that provides a high degree of sparsity and thus several potential options for parallelization. The performance of the new implementation was investigated via a series of single and multi-trajectory optimizations using a combination of parallel computing and constraint aggregation. The computational performance results show that in order to take full advantage of the sparsity in the problem it is vital to parallelize both the non-linear analysis evaluations and the derivative computations themselves. The constraint aggregation results showed a significant numerical challenge due to difficulty in achieving tight convergence tolerances. Overall, the results demonstrate the value of applying analytic derivatives to trajectory optimization problems and lay the foundation for future application of this collocation based method to the design of aircraft with where operational scheduling of technologies is key to achieving good performance.

A New Unified Analysis of Estimate Errors by Model-Matching Phase-Estimation Methods for Sensorless Drive of Permanent-Magnet Synchronous Motors and New Trajectory-Oriented Vector Control, Part II

NASA Astrophysics Data System (ADS)

Shinnaka, Shinji

This paper presents a new unified analysis of estimate errors by model-matching extended-back-EMF estimation methods for sensorless drive of permanent-magnet synchronous motors. Analytical solutions about estimate errors, whose validity is confirmed by numerical experiments, are rich in universality and applicability. As an example of universality and applicability, a new trajectory-oriented vector control method is proposed, which can realize directly quasi-optimal strategy minimizing total losses with no additional computational loads by simply orienting one of vector-control coordinates to the associated quasi-optimal trajectory. The coordinate orientation rule, which is analytically derived, is surprisingly simple. Consequently the trajectory-oriented vector control method can be applied to a number of conventional vector control systems using model-matching extended-back-EMF estimation methods.

Optimal reorientation of asymmetric underactuated spacecraft using differential flatness and receding horizon control

NASA Astrophysics Data System (ADS)

Cai, Wei-wei; Yang, Le-ping; Zhu, Yan-wei

2015-01-01

This paper presents a novel method integrating nominal trajectory optimization and tracking for the reorientation control of an underactuated spacecraft with only two available control torque inputs. By employing a pseudo input along the uncontrolled axis, the flatness property of a general underactuated spacecraft is extended explicitly, by which the reorientation trajectory optimization problem is formulated into the flat output space with all the differential constraints eliminated. Ultimately, the flat output optimization problem is transformed into a nonlinear programming problem via the Chebyshev pseudospectral method, which is improved by the conformal map and barycentric rational interpolation techniques to overcome the side effects of the differential matrix's ill-conditions on numerical accuracy. Treating the trajectory tracking control as a state regulation problem, we develop a robust closed-loop tracking control law using the receding-horizon control method, and compute the feedback control at each control cycle rapidly via the differential transformation method. Numerical simulation results show that the proposed control scheme is feasible and effective for the reorientation maneuver.

Trajectories for High Specific Impulse High Specific Power Deep Space Exploration

NASA Technical Reports Server (NTRS)

Polsgrove, T.; Adams, R. B.; Brady, Hugh J. (Technical Monitor)

2002-01-01

Preliminary results are presented for two methods to approximate the mission performance of high specific impulse high specific power vehicles. The first method is based on an analytical approximation derived by Williams and Shepherd and can be used to approximate mission performance to outer planets and interstellar space. The second method is based on a parametric analysis of trajectories created using the well known trajectory optimization code, VARITOP. This parametric analysis allows the reader to approximate payload ratios and optimal power requirements for both one-way and round-trip missions. While this second method only addresses missions to and from Jupiter, future work will encompass all of the outer planet destinations and some interstellar precursor missions.

System and method for bullet tracking and shooter localization

DOEpatents

Roberts, Randy S [Livermore, CA; Breitfeller, Eric F [Dublin, CA

2011-06-21

A system and method of processing infrared imagery to determine projectile trajectories and the locations of shooters with a high degree of accuracy. The method includes image processing infrared image data to reduce noise and identify streak-shaped image features, using a Kalman filter to estimate optimal projectile trajectories, updating the Kalman filter with new image data, determining projectile source locations by solving a combinatorial least-squares solution for all optimal projectile trajectories, and displaying all of the projectile source locations. Such a shooter-localization system is of great interest for military and law enforcement applications to determine sniper locations, especially in urban combat scenarios.

Large scale nonlinear programming for the optimization of spacecraft trajectories

NASA Astrophysics Data System (ADS)

Arrieta-Camacho, Juan Jose

Despite the availability of high fidelity mathematical models, the computation of accurate optimal spacecraft trajectories has never been an easy task. While simplified models of spacecraft motion can provide useful estimates on energy requirements, sizing, and cost; the actual launch window and maneuver scheduling must rely on more accurate representations. We propose an alternative for the computation of optimal transfers that uses an accurate representation of the spacecraft dynamics. Like other methodologies for trajectory optimization, this alternative is able to consider all major disturbances. In contrast, it can handle explicitly equality and inequality constraints throughout the trajectory; it requires neither the derivation of costate equations nor the identification of the constrained arcs. The alternative consist of two steps: (1) discretizing the dynamic model using high-order collocation at Radau points, which displays numerical advantages, and (2) solution to the resulting Nonlinear Programming (NLP) problem using an interior point method, which does not suffer from the performance bottleneck associated with identifying the active set, as required by sequential quadratic programming methods; in this way the methodology exploits the availability of sound numerical methods, and next generation NLP solvers. In practice the methodology is versatile; it can be applied to a variety of aerospace problems like homing, guidance, and aircraft collision avoidance; the methodology is particularly well suited for low-thrust spacecraft trajectory optimization. Examples are presented which consider the optimization of a low-thrust orbit transfer subject to the main disturbances due to Earth's gravity field together with Lunar and Solar attraction. Other example considers the optimization of a multiple asteroid rendezvous problem. In both cases, the ability of our proposed methodology to consider non-standard objective functions and constraints is illustrated. Future research directions are identified, involving the automatic scheduling and optimization of trajectory correction maneuvers. The sensitivity information provided by the methodology is expected to be invaluable in such research pursuit. The collocation scheme and nonlinear programming algorithm presented in this work, complement other existing methodologies by providing reliable and efficient numerical methods able to handle large scale, nonlinear dynamic models.

Numerical approach of collision avoidance and optimal control on robotic manipulators

NASA Technical Reports Server (NTRS)

Wang, Jyhshing Jack

1990-01-01

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured.

Research in navigation and optimization for space trajectories

NASA Technical Reports Server (NTRS)

Pines, S.; Kelley, H. J.

1979-01-01

Topics covered include: (1) initial Cartesian coordinates for rapid precision orbit prediction; (2) accelerating convergence in optimization methods using search routines by applying curvilinear projection ideas; (3) perturbation-magnitude control for difference-quotient estimation of derivatives; and (4) determining the accelerometer bias for in-orbit shuttle trajectories.

Techniques for shuttle trajectory optimization

NASA Technical Reports Server (NTRS)

Edge, E. R.; Shieh, C. J.; Powers, W. F.

1973-01-01

The application of recently developed function-space Davidon-type techniques to the shuttle ascent trajectory optimization problem is discussed along with an investigation of the recently developed PRAXIS algorithm for parameter optimization. At the outset of this analysis, the major deficiency of the function-space algorithms was their potential storage problems. Since most previous analyses of the methods were with relatively low-dimension problems, no storage problems were encountered. However, in shuttle trajectory optimization, storage is a problem, and this problem was handled efficiently. Topics discussed include: the shuttle ascent model and the development of the particular optimization equations; the function-space algorithms; the operation of the algorithm and typical simulations; variable final-time problem considerations; and a modification of Powell's algorithm.

Validation of Multibody Program to Optimize Simulated Trajectories II Parachute Simulation with Interacting Forces

NASA Technical Reports Server (NTRS)

Raiszadeh, Behzad; Queen, Eric M.; Hotchko, Nathaniel J.

2009-01-01

A capability to simulate trajectories of multiple interacting rigid bodies has been developed, tested and validated. This capability uses the Program to Optimize Simulated Trajectories II (POST 2). The standard version of POST 2 allows trajectory simulation of multiple bodies without force interaction. In the current implementation, the force interaction between the parachute and the suspended bodies has been modeled using flexible lines, allowing accurate trajectory simulation of the individual bodies in flight. The POST 2 multibody capability is intended to be general purpose and applicable to any parachute entry trajectory simulation. This research paper explains the motivation for multibody parachute simulation, discusses implementation methods, and presents validation of this capability.

Launch Vehicle Ascent Trajectory Simulation Using the Program to Optimize Simulated Trajectories II (POST2)

NASA Technical Reports Server (NTRS)

Lugo, Rafael A.; Shidner, Jeremy D.; Powell, Richard W.; Marsh, Steven M.; Hoffman, James A.; Litton, Daniel K.; Schmitt, Terri L.

2017-01-01

The Program to Optimize Simulated Trajectories II (POST2) has been continuously developed for over 40 years and has been used in many flight and research projects. Recently, there has been an effort to improve the POST2 architecture by promoting modularity, flexibility, and ability to support multiple simultaneous projects. The purpose of this paper is to provide insight into the development of trajectory simulation in POST2 by describing methods and examples of various improved models for a launch vehicle liftoff and ascent.

Application of Modern Fortran to Spacecraft Trajectory Design and Optimization

NASA Technical Reports Server (NTRS)

Williams, Jacob; Falck, Robert D.; Beekman, Izaak B.

2018-01-01

In this paper, applications of the modern Fortran programming language to the field of spacecraft trajectory optimization and design are examined. Modern object-oriented Fortran has many advantages for scientific programming, although many legacy Fortran aerospace codes have not been upgraded to use the newer standards (or have been rewritten in other languages perceived to be more modern). NASA's Copernicus spacecraft trajectory optimization program, originally a combination of Fortran 77 and Fortran 95, has attempted to keep up with modern standards and makes significant use of the new language features. Various algorithms and methods are presented from trajectory tools such as Copernicus, as well as modern Fortran open source libraries and other projects.

Optimization of cooling strategy and seeding by FBRM analysis of batch crystallization

NASA Astrophysics Data System (ADS)

Zhang, Dejiang; Liu, Lande; Xu, Shijie; Du, Shichao; Dong, Weibing; Gong, Junbo

2018-03-01

A method is presented for optimizing the cooling strategy and seed loading simultaneously. Focused beam reflectance measurement (FBRM) was used to determine the approximating optimal cooling profile. Using these results in conjunction with constant growth rate assumption, modified Mullin-Nyvlt trajectory could be calculated. This trajectory could suppress secondary nucleation and has the potential to control product's polymorph distribution. Comparing with linear and two step cooling, modified Mullin-Nyvlt trajectory have a larger size distribution and a better morphology. Based on the calculating results, the optimized seed loading policy was also developed. This policy could be useful for guiding the batch crystallization process.

Rapid near-optimal aerospace plane trajectory generation and guidance

NASA Technical Reports Server (NTRS)

Calise, A. J.; Corban, J. E.; Markopoulos, N.

1991-01-01

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.

Optimization methods of laws control of electric propulsion spacecraft in the restricted three-body task

NASA Astrophysics Data System (ADS)

Starinova, Olga L.

2014-12-01

This paper outlines the optimization methods of the control law of the low thrust spacecraft for the restrict problem of three-body. The conditions for fragmentation trajectory on the specific parts of trajectory are formulated. The mathematical statement and methods to solve the optimal control problem on these parts are stated. Results of the decision of applied problems for various classes of spacecrafts which are carrying out maneuvers with low thrust are presented. In particular, the non-coplanar maneuvers of the low thrust spacecraft in the Earth-Moon system are viewed.

A study of numerical methods for computing reentry trajectories for shuttle-type space vehicles

NASA Technical Reports Server (NTRS)

1972-01-01

The reuseable exterior insulation system (REI) is studied to determine the optimal reentry trajectory for a space shuttle, which minimizes the heat input to the fuselage. The REI is composed of titanium, covered by a surface insulation material. The method of perturbation functions was used to generate the trajectories, and proved to be an effective technique for generating families of solutions, once an initial trajectory has been obtained.

Guidance and Control strategies for aerospace vehicles

NASA Technical Reports Server (NTRS)

Hibey, J. L.; Naidu, D. S.; Charalambous, C. D.

1989-01-01

A neighboring optimal guidance scheme was devised for a nonlinear dynamic system with stochastic inputs and perfect measurements as applicable to fuel optimal control of an aeroassisted orbital transfer vehicle. For the deterministic nonlinear dynamic system describing the atmospheric maneuver, a nominal trajectory was determined. Then, a neighboring, optimal guidance scheme was obtained for open loop and closed loop control configurations. Taking modelling uncertainties into account, a linear, stochastic, neighboring optimal guidance scheme was devised. Finally, the optimal trajectory was approximated as the sum of the deterministic nominal trajectory and the stochastic neighboring optimal solution. Numerical results are presented for a typical vehicle. A fuel-optimal control problem in aeroassisted noncoplanar orbital transfer is also addressed. The equations of motion for the atmospheric maneuver are nonlinear and the optimal (nominal) trajectory and control are obtained. In order to follow the nominal trajectory under actual conditions, a neighboring optimum guidance scheme is designed using linear quadratic regulator theory for onboard real-time implementation. One of the state variables is used as the independent variable in reference to the time. The weighting matrices in the performance index are chosen by a combination of a heuristic method and an optimal modal approach. The necessary feedback control law is obtained in order to minimize the deviations from the nominal conditions.

Particle Swarm Optimization of Low-Thrust, Geocentric-to-Halo-Orbit Transfers

NASA Astrophysics Data System (ADS)

Abraham, Andrew J.

Missions to Lagrange points are becoming increasingly popular amongst spacecraft mission planners. Lagrange points are locations in space where the gravity force from two bodies, and the centrifugal force acting on a third body, cancel. To date, all spacecraft that have visited a Lagrange point have done so using high-thrust, chemical propulsion. Due to the increasing availability of low-thrust (high efficiency) propulsive devices, and their increasing capability in terms of fuel efficiency and instantaneous thrust, it has now become possible for a spacecraft to reach a Lagrange point orbit without the aid of chemical propellant. While at any given time there are many paths for a low-thrust trajectory to take, only one is optimal. The traditional approach to spacecraft trajectory optimization utilizes some form of gradient-based algorithm. While these algorithms offer numerous advantages, they also have a few significant shortcomings. The three most significant shortcomings are: (1) the fact that an initial guess solution is required to initialize the algorithm, (2) the radius of convergence can be quite small and can allow the algorithm to become trapped in local minima, and (3) gradient information is not always assessable nor always trustworthy for a given problem. To avoid these problems, this dissertation is focused on optimizing a low-thrust transfer trajectory from a geocentric orbit to an Earth-Moon, L1, Lagrange point orbit using the method of Particle Swarm Optimization (PSO). The PSO method is an evolutionary heuristic that was originally written to model birds swarming to locate hidden food sources. This PSO method will enable the exploration of the invariant stable manifold of the target Lagrange point orbit in an effort to optimize the spacecraft's low-thrust trajectory. Examples of these optimized trajectories are presented and contrasted with those found using traditional, gradient-based approaches. In summary, the results of this dissertation find that the PSO method does, indeed, successfully optimize the low-thrust trajectory transfer problem without the need for initial guessing. Furthermore, a two-degree-of-freedom PSO problem formulation significantly outperformed a one-degree-of-freedom formulation by at least an order of magnitude, in terms of CPU time. Finally, the PSO method is also used to solve a traditional, two-burn, impulsive transfer to a Lagrange point orbit using a hybrid optimization algorithm that incorporates a gradient-based shooting algorithm as a pre-optimizer. Surprisingly, the results of this study show that "fast" transfers outperform "slow" transfers in terms of both Deltav and time of flight.

An Optimized Trajectory Planning for Welding Robot

NASA Astrophysics Data System (ADS)

Chen, Zhilong; Wang, Jun; Li, Shuting; Ren, Jun; Wang, Quan; Cheng, Qunchao; Li, Wentao

2018-03-01

In order to improve the welding efficiency and quality, this paper studies the combined planning between welding parameters and space trajectory for welding robot and proposes a trajectory planning method with high real-time performance, strong controllability and small welding error. By adding the virtual joint at the end-effector, the appropriate virtual joint model is established and the welding process parameters are represented by the virtual joint variables. The trajectory planning is carried out in the robot joint space, which makes the control of the welding process parameters more intuitive and convenient. By using the virtual joint model combined with the B-spline curve affine invariant, the welding process parameters are indirectly controlled by controlling the motion curve of the real joint. To solve the optimal time solution as the goal, the welding process parameters and joint space trajectory joint planning are optimized.

Conjugate gradient optimization programs for shuttle reentry

NASA Technical Reports Server (NTRS)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

Guidance control of small UAV with energy and maneuverability limitations for a search and coverage mission

NASA Astrophysics Data System (ADS)

Gramajo, German G.

This thesis presents an algorithm for a search and coverage mission that has increased autonomy in generating an ideal trajectory while explicitly considering the available energy in the optimization. Further, current algorithms used to generate trajectories depend on the operator providing a discrete set of turning rate requirements to obtain an optimal solution. This work proposes an additional modification to the algorithm so that it optimizes the trajectory for a range of turning rates instead of a discrete set of turning rates. This thesis conducts an evaluation of the algorithm with variation in turn duration, entry-heading angle, and entry point. Comparative studies of the algorithm with existing method indicates improved autonomy in choosing the optimization parameters while producing trajectories with better coverage area and closer final distance to the desired terminal point.

Implementation of optimal trajectory control of series resonant converter

NASA Technical Reports Server (NTRS)

Oruganti, Ramesh; Yang, James J.; Lee, Fred C.

1987-01-01

Due to the presence of a high-frequency LC tank circuit, the dynamics of a resonant converter are unpredictable. There is often a large surge of tank energy during transients. Using state-plane analysis technique, an optimal trajectory control utilizing the desired solution trajectory as the control law was previously proposed for the series resonant converters. The method predicts the fastest response possible with minimum energy surge in the resonant tank. The principle of the control and its experimental implementation are described here. The dynamics of the converter are shown to be close to time-optimal.

Constrained Burn Optimization for the International Space Station

NASA Technical Reports Server (NTRS)

Brown, Aaron J.; Jones, Brandon A.

2017-01-01

In long-term trajectory planning for the International Space Station (ISS), translational burns are currently targeted sequentially to meet the immediate trajectory constraints, rather than simultaneously to meet all constraints, do not employ gradient-based search techniques, and are not optimized for a minimum total deltav (v) solution. An analytic formulation of the constraint gradients is developed and used in an optimization solver to overcome these obstacles. Two trajectory examples are explored, highlighting the advantage of the proposed method over the current approach, as well as the potential v and propellant savings in the event of propellant shortages.

Optimization of Composite Structures with Curved Fiber Trajectories

NASA Astrophysics Data System (ADS)

Lemaire, Etienne; Zein, Samih; Bruyneel, Michael

2014-06-01

This paper studies the problem of optimizing composites shells manufactured using Automated Tape Layup (ATL) or Automated Fiber Placement (AFP) processes. The optimization procedure relies on a new approach to generate equidistant fiber trajectories based on Fast Marching Method. Starting with a (possibly curved) reference fiber direction defined on a (possibly curved) meshed surface, the new method allows determining fibers orientation resulting from a uniform thickness layup. The design variables are the parameters defining the position and the shape of the reference curve which results in very few design variables. Thanks to this efficient parameterization, maximum stiffness optimization numerical applications are proposed. The shape of the design space is discussed, regarding local and global optimal solutions.

A New Unified Analysis of Estimate Errors by Model-Matching Phase-Estimation Methods for Sensorless Drive of Permanent-Magnet Synchronous Motors and New Trajectory-Oriented Vector Control, Part I

NASA Astrophysics Data System (ADS)

Shinnaka, Shinji; Sano, Kousuke

This paper presents a new unified analysis of estimate errors by model-matching phase-estimation methods such as rotor-flux state-observers, back EMF state-observers, and back EMF disturbance-observers, for sensorless drive of permanent-magnet synchronous motors. Analytical solutions about estimate errors, whose validity is confirmed by numerical experiments, are rich in universality and applicability. As an example of universality and applicability, a new trajectory-oriented vector control method is proposed, which can realize directly quasi-optimal strategy minimizing total losses with no additional computational loads by simply orienting one of vector-control coordinates to the associated quasi-optimal trajectory. The coordinate orientation rule, which is analytically derived, is surprisingly simple. Consequently the trajectory-oriented vector control method can be applied to a number of conventional vector control systems using one of the model-matching phase-estimation methods.

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

NASA Technical Reports Server (NTRS)

Dees, Patrick D.; Zwack, Mathew R.; Michelson, Diane K.

2017-01-01

During conceptual design speed and accuracy are often at odds. Specifically in the realm of launch vehicles, optimizing the ascent trajectory requires a larger pool of analytical power and expertise. Experienced analysts working on familiar vehicles can produce optimal trajectories in a short time frame, however whenever either "experienced" or "familiar " is not applicable the optimization process can become quite lengthy. In order to construct a vehicle agnostic method an established global optimization algorithm is needed. In this work the authors develop an "artificial" error term to map arbitrary control vectors to non-zero error by which a global method can operate. Two global methods are compared alongside Design of Experiments and random sampling and are shown to produce comparable results to analysis done by a human expert.

The design of transfer trajectory for Ivar asteroid exploration mission

NASA Astrophysics Data System (ADS)

Qiao, Dong; Cui, Hutao; Cui, Pingyuan

2009-12-01

An impending demand for exploring the small bodies, such as the comets and the asteroids, envisioned the Chinese Deep Space exploration mission to the Near Earth asteroid Ivar. A design and optimal method of transfer trajectory for asteroid Ivar is discussed in this paper. The transfer trajectory for rendezvous with asteroid Ivar is designed by means of Earth gravity assist with deep space maneuver (Delta-VEGA) technology. A Delta-VEGA transfer trajectory is realized by several trajectory segments, which connect the deep space maneuver and swingby point. Each trajectory segment is found by solving Lambert problem. Through adjusting deep maneuver and arrival time, the match condition of swingby is satisfied. To reduce the total mission velocity increments further, a procedure is developed which minimizes total velocity increments for this scheme of transfer trajectory for asteroid Ivar. The trajectory optimization problem is solved with a quasi-Newton algorithm utilizing analytic first derivatives, which are derived from the transversality conditions associated with the optimization formulation and primer vector theory. The simulation results show the scheme for transfer trajectory causes C3 and total velocity increments decrease of 48.80% and 13.20%, respectively.

Optimal transfers between unstable periodic orbits using invariant manifolds

NASA Astrophysics Data System (ADS)

Davis, Kathryn E.; Anderson, Rodney L.; Scheeres, Daniel J.; Born, George H.

2011-03-01

This paper presents a method to construct optimal transfers between unstable periodic orbits of differing energies using invariant manifolds. The transfers constructed in this method asymptotically depart the initial orbit on a trajectory contained within the unstable manifold of the initial orbit and later, asymptotically arrive at the final orbit on a trajectory contained within the stable manifold of the final orbit. Primer vector theory is applied to a transfer to determine the optimal maneuvers required to create the bridging trajectory that connects the unstable and stable manifold trajectories. Transfers are constructed between unstable periodic orbits in the Sun-Earth, Earth-Moon, and Jupiter-Europa three-body systems. Multiple solutions are found between the same initial and final orbits, where certain solutions retrace interior portions of the trajectory. All transfers created satisfy the conditions for optimality. The costs of transfers constructed using manifolds are compared to the costs of transfers constructed without the use of manifolds. In all cases, the total cost of the transfer is significantly lower when invariant manifolds are used in the transfer construction. In many cases, the transfers that employ invariant manifolds are three times more efficient, in terms of fuel expenditure, than the transfer that do not. The decrease in transfer cost is accompanied by an increase in transfer time of flight.

Nonlinear dynamic analysis and optimal trajectory planning of a high-speed macro-micro manipulator

NASA Astrophysics Data System (ADS)

Yang, Yi-ling; Wei, Yan-ding; Lou, Jun-qiang; Fu, Lei; Zhao, Xiao-wei

2017-09-01

This paper reports the nonlinear dynamic modeling and the optimal trajectory planning for a flexure-based macro-micro manipulator, which is dedicated to the large-scale and high-speed tasks. In particular, a macro- micro manipulator composed of a servo motor, a rigid arm and a compliant microgripper is focused. Moreover, both flexure hinges and flexible beams are considered. By combining the pseudorigid-body-model method, the assumed mode method and the Lagrange equation, the overall dynamic model is derived. Then, the rigid-flexible-coupling characteristics are analyzed by numerical simulations. After that, the microscopic scale vibration excited by the large-scale motion is reduced through the trajectory planning approach. Especially, a fitness function regards the comprehensive excitation torque of the compliant microgripper is proposed. The reference curve and the interpolation curve using the quintic polynomial trajectories are adopted. Afterwards, an improved genetic algorithm is used to identify the optimal trajectory by minimizing the fitness function. Finally, the numerical simulations and experiments validate the feasibility and the effectiveness of the established dynamic model and the trajectory planning approach. The amplitude of the residual vibration reduces approximately 54.9%, and the settling time decreases 57.1%. Therefore, the operation efficiency and manipulation stability are significantly improved.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reister, D.B.; Pin, F.G.

This paper addresses the problem of time-optional motions for a mobile platform in a planar environment. The platform has two non-steerable independently driven wheels. The overall mission of the robot is expressed in terms of a sequence of via points at which the platform must be at rest in a given configuration (position and orientation). The objective is to plan time-optimal trajectories between these configurations assuming an unobstructed environment. Using Pontryagin's maximum principle (PMP), we formally demonstrate that all time optimal motions of the platform for this problem occur for bang-bang controls on the wheels (at each instant, the accelerationmore » on each wheel is either at its upper or lower limit). The PMP, however, only provides necessary conditions for time optimality. To find the time optimal robot trajectories, we first parameterize the bang-bang trajectories using the switch times on the wheels (the times at which the wheel accelerations change sign). With this parameterization, we can fully search the robot trajectory space and find the switch times that will produce particular paths to a desired final configuration of the platform. We show numerically that robot trajectories with three switch times (two on one wheel, one on the other) can reach any position, while trajectories with four switch times can reach any configuration. By numerical comparison with other trajectories involving similar or greater numbers of switch times, we then identify the sets of time-optimal trajectories. These are uniquely defined using ranges of the parameters, and consist of subsets of trajectories with three switch times for the problem when the final orientation of the robot is not specified, and four switch times when a full final configuration is specified. We conclude with a description of the use of the method for trajectory planning for one of our robots.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reister, D.B.; Pin, F.G.

This paper addresses the problem of time-optional motions for a mobile platform in a planar environment. The platform has two non-steerable independently driven wheels. The overall mission of the robot is expressed in terms of a sequence of via points at which the platform must be at rest in a given configuration (position and orientation). The objective is to plan time-optimal trajectories between these configurations assuming an unobstructed environment. Using Pontryagin`s maximum principle (PMP), we formally demonstrate that all time optimal motions of the platform for this problem occur for bang-bang controls on the wheels (at each instant, the accelerationmore » on each wheel is either at its upper or lower limit). The PMP, however, only provides necessary conditions for time optimality. To find the time optimal robot trajectories, we first parameterize the bang-bang trajectories using the switch times on the wheels (the times at which the wheel accelerations change sign). With this parameterization, we can fully search the robot trajectory space and find the switch times that will produce particular paths to a desired final configuration of the platform. We show numerically that robot trajectories with three switch times (two on one wheel, one on the other) can reach any position, while trajectories with four switch times can reach any configuration. By numerical comparison with other trajectories involving similar or greater numbers of switch times, we then identify the sets of time-optimal trajectories. These are uniquely defined using ranges of the parameters, and consist of subsets of trajectories with three switch times for the problem when the final orientation of the robot is not specified, and four switch times when a full final configuration is specified. We conclude with a description of the use of the method for trajectory planning for one of our robots.« less

Multi-step optimization strategy for fuel-optimal orbital transfer of low-thrust spacecraft

NASA Astrophysics Data System (ADS)

Rasotto, M.; Armellin, R.; Di Lizia, P.

2016-03-01

An effective method for the design of fuel-optimal transfers in two- and three-body dynamics is presented. The optimal control problem is formulated using calculus of variation and primer vector theory. This leads to a multi-point boundary value problem (MPBVP), characterized by complex inner constraints and a discontinuous thrust profile. The first issue is addressed by embedding the MPBVP in a parametric optimization problem, thus allowing a simplification of the set of transversality constraints. The second problem is solved by representing the discontinuous control function by a smooth function depending on a continuation parameter. The resulting trajectory optimization method can deal with different intermediate conditions, and no a priori knowledge of the control structure is required. Test cases in both the two- and three-body dynamics show the capability of the method in solving complex trajectory design problems.

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

NASA Technical Reports Server (NTRS)

Dees, Patrick D.; Zwack, Mathew R.

2017-01-01

During early conceptual design of complex systems, speed and accuracy are often at odds with one another. While many characteristics of the design are fluctuating rapidly during this phase there is nonetheless a need to acquire accurate data from which to down-select designs as these decisions will have a large impact upon program life-cycle cost. Therefore enabling the conceptual designer to produce accurate data in a timely manner is tantamount to program viability. For conceptual design of launch vehicles, trajectory analysis and optimization is a large hurdle. Tools such as the industry standard Program to Optimize Simulated Trajectories (POST) have traditionally required an expert in the loop for setting up inputs, running the program, and analyzing the output. The solution space for trajectory analysis is in general non-linear and multi-modal requiring an experienced analyst to weed out sub-optimal designs in pursuit of the global optimum. While an experienced analyst presented with a vehicle similar to one which they have already worked on can likely produce optimal performance figures in a timely manner, as soon as the "experienced" or "similar" adjectives are invalid the process can become lengthy. In addition, an experienced analyst working on a similar vehicle may go into the analysis with preconceived ideas about what the vehicle's trajectory should look like which can result in sub-optimal performance being recorded. Thus, in any case but the ideal either time or accuracy can be sacrificed. In the authors' previous work a tool called multiPOST was created which captures the heuristics of a human analyst over the process of executing trajectory analysis with POST. However without the instincts of a human in the loop, this method relied upon Monte Carlo simulation to find successful trajectories. Overall the method has mixed results, and in the context of optimizing multiple vehicles it is inefficient in comparison to the method presented POST's internal optimizer functions like any other gradient-based optimizer. It has a specified variable to optimize whose value is represented as optval, a set of dependent constraints to meet with associated forms and tolerances whose value is represented as p2, and a set of independent variables known as the u-vector to modify in pursuit of optimality. Each of these quantities are calculated or manipulated at a certain phase within the trajectory. The optimizer is further constrained by the requirement that the input u-vector must result in a trajectory which proceeds through each of the prescribed events in the input file. For example, if the input u-vector causes the vehicle to crash before it can achieve the orbital parameters required for a parking orbit, then the run will fail without engaging the optimizer, and a p2 value of exactly zero is returned. This poses a problem, as this "non-connecting" region of the u-vector space is far larger than the "connecting" region which returns a non-zero value of p2 and can be worked on by the internal optimizer. Finding this connecting region and more specifically the global optimum within this region has traditionally required the use of an expert analyst.

Time-optimal control of the spacecraft trajectories in the Earth-Moon system

NASA Astrophysics Data System (ADS)

Starinova, O. L.; Fain, M. K.; Materova, I. L.

2017-01-01

This paper outlines the multiparametric optimization of the L1-L2 and L2-L1 missions in the Earth-Moon system using electric propulsion. The optimal control laws are obtained using the Fedorenko successful linearization method to estimate the derivatives and the gradient method to optimize the control laws. The study of the transfers is based on the restricted circular three-body problem. The mathematical model of the missions is described within the barycentric system of coordinates. The optimization criterion is the total flight time. The perturbation from the Earth, the Moon and the Sun are taking into account. The impact of the shaded areas, induced by the Earth and the Moon, is also accounted. As the results of the optimization we obtained optimal control laws, corresponding trajectories and minimal total flight times.

Trajectory planning of mobile robots using indirect solution of optimal control method in generalized point-to-point task

NASA Astrophysics Data System (ADS)

Nazemizadeh, M.; Rahimi, H. N.; Amini Khoiy, K.

2012-03-01

This paper presents an optimal control strategy for optimal trajectory planning of mobile robots by considering nonlinear dynamic model and nonholonomic constraints of the system. The nonholonomic constraints of the system are introduced by a nonintegrable set of differential equations which represent kinematic restriction on the motion. The Lagrange's principle is employed to derive the nonlinear equations of the system. Then, the optimal path planning of the mobile robot is formulated as an optimal control problem. To set up the problem, the nonlinear equations of the system are assumed as constraints, and a minimum energy objective function is defined. To solve the problem, an indirect solution of the optimal control method is employed, and conditions of the optimality derived as a set of coupled nonlinear differential equations. The optimality equations are solved numerically, and various simulations are performed for a nonholonomic mobile robot to illustrate effectiveness of the proposed method.

SU-E-T-436: Fluence-Based Trajectory Optimization for Non-Coplanar VMAT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smyth, G; Bamber, JC; Bedford, JL

2015-06-15

Purpose: To investigate a fluence-based trajectory optimization technique for non-coplanar VMAT for brain cancer. Methods: Single-arc non-coplanar VMAT trajectories were determined using a heuristic technique for five patients. Organ at risk (OAR) volume intersected during raytracing was minimized for two cases: absolute volume and the sum of relative volumes weighted by OAR importance. These trajectories and coplanar VMAT formed starting points for the fluence-based optimization method. Iterative least squares optimization was performed on control points 24° apart in gantry rotation. Optimization minimized the root-mean-square (RMS) deviation of PTV dose from the prescription (relative importance 100), maximum dose to the brainstemmore » (10), optic chiasm (5), globes (5) and optic nerves (5), plus mean dose to the lenses (5), hippocampi (3), temporal lobes (2), cochleae (1) and brain excluding other regions of interest (1). Control point couch rotations were varied in steps of up to 10° and accepted if the cost function improved. Final treatment plans were optimized with the same objectives in an in-house planning system and evaluated using a composite metric - the sum of optimization metrics weighted by importance. Results: The composite metric decreased with fluence-based optimization in 14 of the 15 plans. In the remaining case its overall value, and the PTV and OAR components, were unchanged but the balance of OAR sparing differed. PTV RMS deviation was improved in 13 cases and unchanged in two. The OAR component was reduced in 13 plans. In one case the OAR component increased but the composite metric decreased - a 4 Gy increase in OAR metrics was balanced by a reduction in PTV RMS deviation from 2.8% to 2.6%. Conclusion: Fluence-based trajectory optimization improved plan quality as defined by the composite metric. While dose differences were case specific, fluence-based optimization improved both PTV and OAR dosimetry in 80% of cases.« less

Design and optimization of interplanetary spacecraft trajectories

NASA Astrophysics Data System (ADS)

McConaghy, Thomas Troy

Scientists involved in space exploration are always looking for ways to accomplish more with their limited budgets. Mission designers can decrease operational costs by crafting trajectories with low launch costs, short time-of-flight, or low propellant requirements. Gravity-assist maneuvers and low-thrust, high-efficiency ion propulsion can be of great help. This dissertation describes advances in methods to design and optimize interplanetary spacecraft trajectories. particularly for missions using gravity-assist maneuvers or low-thrust engines (or both). The first part of this dissertation describes a new, efficient, two-step methodology to design and optimize low-thrust gravity-assist trajectories. Models for the launch vehicle, solar arrays, and engines are introduced and several examples of optimized trajectories are presented. For example, a 3.7-year Earth-Venus-Earth-Mars-Jupiter flyby trajectory with maximized final mass is described. The way that the parameterization of the optimization problem affects convergence speed and reliability is also investigated. The choice of coordinate system is shown to make a significant difference. The second part of this dissertation describes a way to construct Earth-Mars cycler trajectories---periodic orbits that repeatedly encounter Earth and Mars, yet require little or no propellant. We find that well-known cyclers, such as the Aldrin cycler, are special cases of a much larger family of cyclers. In fact, so many new cyclers are found that a comprehensive naming system (nomenclature) is proposed. One particularly promising new cycler, the "ballistic S1L1 cycler" is analyzed in greater detail.

Development of a Smooth Trajectory Maneuver Method to Accommodate the Ares I Flight Control Constraints

NASA Technical Reports Server (NTRS)

Pinson, Robin M.; Schmitt, Terri L.; Hanson, John M.

2008-01-01

Six degree-of-freedom (DOF) launch vehicle trajectories are designed to follow an optimized 3-DOF reference trajectory. A vehicle has a finite amount of control power that it can allocate to performing maneuvers. Therefore, the 3-DOF trajectory must be designed to refrain from using 100% of the allowable control capability to perform maneuvers, saving control power for handling off-nominal conditions, wind gusts and other perturbations. During the Ares I trajectory analysis, two maneuvers were found to be hard for the control system to implement; a roll maneuver prior to the gravity turn and an angle of attack maneuver immediately after the J-2X engine start-up. It was decided to develop an approach for creating smooth maneuvers in the optimized reference trajectories that accounts for the thrust available from the engines. A feature of this method is that no additional angular velocity in the direction of the maneuver has been added to the vehicle after the maneuver completion. This paper discusses the equations behind these new maneuvers and their implementation into the Ares I trajectory design cycle. Also discussed is a possible extension to adjusting closed-loop guidance.

Optimization of Low-Thrust Spiral Trajectories by Collocation

NASA Technical Reports Server (NTRS)

Falck, Robert D.; Dankanich, John W.

2012-01-01

As NASA examines potential missions in the post space shuttle era, there has been a renewed interest in low-thrust electric propulsion for both crewed and uncrewed missions. While much progress has been made in the field of software for the optimization of low-thrust trajectories, many of the tools utilize higher-fidelity methods which, while excellent, result in extremely high run-times and poor convergence when dealing with planetocentric spiraling trajectories deep within a gravity well. Conversely, faster tools like SEPSPOT provide a reasonable solution but typically fail to account for other forces such as third-body gravitation, aerodynamic drag, solar radiation pressure. SEPSPOT is further constrained by its solution method, which may require a very good guess to yield a converged optimal solution. Here the authors have developed an approach using collocation intended to provide solution times comparable to those given by SEPSPOT while allowing for greater robustness and extensible force models.

Preliminary Design of Low-Thrust Interplanetary Missions

NASA Technical Reports Server (NTRS)

Sims, Jon A.; Flanagan, Steve N.

1997-01-01

For interplanetary missions, highly efficient electric propulsion systems can be used to increase the mass delivered to the destination and/or reduce the trip time over typical chemical propulsion systems. This technology is being demonstrated on the Deep Space 1 mission - part of NASA's New Millennium Program validating technologies which can lower the cost and risk and enhance the performance of future missions. With the successful demonstration on Deep Space 1, future missions can consider electric propulsion as a viable propulsion option. Electric propulsion systems, while highly efficient, produce only a small amount of thrust. As a result, the engines operate during a significant fraction of the trajectory. This characteristic makes it much more difficult to find optimal trajectories. The methods for optimizing low-thrust trajectories are typically categorized as either indirect, or direct. Indirect methods are based on calculus of variations, resulting in a two-point boundary value problem that is solved by satisfying terminal constraints and targeting conditions. These methods are subject to extreme sensitivity to the initial guess of the variables - some of which are not physically intuitive. Adding a gravity assist to the trajectory compounds the sensitivity. Direct methods parameterize the problem and use nonlinear programming techniques to optimize an objective function by adjusting a set of variables. A variety of methods of this type have been examined with varying results. These methods are subject to the limitations of the nonlinear programming techniques. In this paper we present a direct method intended to be used primarily for preliminary design of low-thrust interplanetary trajectories, including those with multiple gravity assists. Preliminary design implies a willingness to accept limited accuracy to achieve an efficient algorithm that executes quickly.

Optimal cooperative time-fixed impulsive rendezvous

NASA Technical Reports Server (NTRS)

Mirfakhraie, Koorosh; Conway, Bruce A.

1990-01-01

New capabilities have been added to a method that had been developed for determining optimal, i.e., minimum fuel, trajectories for the fixed-time cooperative rendezvous of two spacecraft. The method utilizes the primer vector theory. The new capabilities enable the method to accomodate cases in which there are fuel constraints on the spacecraft and/or enable the addition of a mid-course impulse to one of the vehicle's trajectories. Results are presented for a large number of cases, and the effect of varying parameters, such as vehicle fuel constraints, vehicle initial masses, and time allowed for the rendezvous, is demonstrated.

Non-Rigid Structure Estimation in Trajectory Space from Monocular Vision

PubMed Central

Wang, Yaming; Tong, Lingling; Jiang, Mingfeng; Zheng, Junbao

2015-01-01

In this paper, the problem of non-rigid structure estimation in trajectory space from monocular vision is investigated. Similar to the Point Trajectory Approach (PTA), based on characteristic points’ trajectories described by a predefined Discrete Cosine Transform (DCT) basis, the structure matrix was also calculated by using a factorization method. To further optimize the non-rigid structure estimation from monocular vision, the rank minimization problem about structure matrix is proposed to implement the non-rigid structure estimation by introducing the basic low-rank condition. Moreover, the Accelerated Proximal Gradient (APG) algorithm is proposed to solve the rank minimization problem, and the initial structure matrix calculated by the PTA method is optimized. The APG algorithm can converge to efficient solutions quickly and lessen the reconstruction error obviously. The reconstruction results of real image sequences indicate that the proposed approach runs reliably, and effectively improves the accuracy of non-rigid structure estimation from monocular vision. PMID:26473863

Design and Analysis of Optimal Ascent Trajectories for Stratospheric Airships

NASA Astrophysics Data System (ADS)

Mueller, Joseph Bernard

Stratospheric airships are lighter-than-air vehicles that have the potential to provide a long-duration airborne presence at altitudes of 18-22 km. Designed to operate on solar power in the calm portion of the lower stratosphere and above all regulated air traffic and cloud cover, these vehicles represent an emerging platform that resides between conventional aircraft and satellites. A particular challenge for airship operation is the planning of ascent trajectories, as the slow moving vehicle must traverse the high wind region of the jet stream. Due to large changes in wind speed and direction across altitude and the susceptibility of airship motion to wind, the trajectory must be carefully planned, preferably optimized, in order to ensure that the desired station be reached within acceptable performance bounds of flight time and energy consumption. This thesis develops optimal ascent trajectories for stratospheric airships, examines the structure and sensitivity of these solutions, and presents a strategy for onboard guidance. Optimal ascent trajectories are developed that utilize wind energy to achieve minimum-time and minimum-energy flights. The airship is represented by a three-dimensional point mass model, and the equations of motion include aerodynamic lift and drag, vectored thrust, added mass effects, and accelerations due to mass flow rate, wind rates, and Earth rotation. A representative wind profile is developed based on historical meteorological data and measurements. Trajectory optimization is performed by first defining an optimal control problem with both terminal and path constraints, then using direct transcription to develop an approximate nonlinear parameter optimization problem of finite dimension. Optimal ascent trajectories are determined using SNOPT for a variety of upwind, downwind, and crosswind launch locations. Results of extensive optimization solutions illustrate definitive patterns in the ascent path for minimum time flights across varying launch locations, and show that significant energy savings can be realized with minimum-energy flights, compared to minimum-time time flights, given small increases in flight time. The performance of the optimal trajectories are then studied with respect to solar energy production during ascent, as well as sensitivity of the solutions to small changes in drag coefficient and wind model parameters. Results of solar power model simulations indicate that solar energy is sufficient to power ascent flights, but that significant energy loss can occur for certain types of trajectories. Sensitivity to the drag and wind model is approximated through numerical simulations, showing that optimal solutions change gradually with respect to changing wind and drag parameters and providing deeper insight into the characteristics of optimal airship flights. Finally, alternative methods are developed to generate near-optimal ascent trajectories in a manner suitable for onboard implementation. The structures and characteristics of previously developed minimum-time and minimum-energy ascent trajectories are used to construct simplified trajectory models, which are efficiently solved in a smaller numerical optimization problem. Comparison of these alternative solutions to the original SNOPT solutions show excellent agreement, suggesting the alternate formulations are an effective means to develop near-optimal solutions in an onboard setting.

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

NASA Technical Reports Server (NTRS)

Patrick, Nicholas J. M.; Sheridan, Thomas B.

1996-01-01

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance vary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are: (1) determining what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major u.s. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort-topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimality with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider unmodelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Advanced methods of structural and trajectory analysis for transport aircraft

NASA Technical Reports Server (NTRS)

Ardema, Mark D.

1995-01-01

This report summarizes the efforts in two areas: (1) development of advanced methods of structural weight estimation, and (2) development of advanced methods of trajectory optimization. The majority of the effort was spent in the structural weight area. A draft of 'Analytical Fuselage and Wing Weight Estimation of Transport Aircraft', resulting from this research, is included as an appendix.

Optimization of transfer trajectories to the Apophis asteroid for spacecraft with high and low thrust

NASA Astrophysics Data System (ADS)

Ivashkin, V. V.; Krylov, I. V.

2014-03-01

The problem of optimization of a spacecraft transfer to the Apophis asteroid is investigated. The scheme of transfer under analysis includes a geocentric stage of boosting the spacecraft with high thrust, a heliocentric stage of control by a low thrust engine, and a stage of deceleration with injection to an orbit of the asteroid's satellite. In doing this, the problem of optimal control is solved for cases of ideal and piecewise-constant low thrust, and the optimal magnitude and direction of spacecraft's hyperbolic velocity "at infinity" during departure from the Earth are determined. The spacecraft trajectories are found based on a specially developed comprehensive method of optimization. This method combines the method of dynamic programming at the first stage of analysis and the Pontryagin maximum principle at the concluding stage, together with the parameter continuation method. The estimates are obtained for the spacecraft's final mass and for the payload mass that can be delivered to the asteroid using the Soyuz-Fregat carrier launcher.

Rapid Preliminary Design of Interplanetary Trajectories Using the Evolutionary Mission Trajectory Generator

NASA Technical Reports Server (NTRS)

Englander, Jacob

2016-01-01

Preliminary design of 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. 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 hybrid optimal control problem. The method is demonstrated on notional high-thrust chemical and low-thrust electric propulsion missions. In the low-thrust case, the hybrid optimal control problem is augmented to include systems design optimization.

Optimal trajectories of aircraft and spacecraft

NASA Technical Reports Server (NTRS)

Miele, A.

1990-01-01

Work done on algorithms for the numerical solutions of optimal control problems and their application to the computation of optimal flight trajectories of aircraft and spacecraft is summarized. General considerations on calculus of variations, optimal control, numerical algorithms, and applications of these algorithms to real-world problems are presented. The sequential gradient-restoration algorithm (SGRA) is examined for the numerical solution of optimal control problems of the Bolza type. Both the primal formulation and the dual formulation are discussed. Aircraft trajectories, in particular, the application of the dual sequential gradient-restoration algorithm (DSGRA) to the determination of optimal flight trajectories in the presence of windshear are described. Both take-off trajectories and abort landing trajectories are discussed. Take-off trajectories are optimized by minimizing the peak deviation of the absolute path inclination from a reference value. Abort landing trajectories are optimized by minimizing the peak drop of altitude from a reference value. Abort landing trajectories are optimized by minimizing the peak drop of altitude from a reference value. The survival capability of an aircraft in a severe windshear is discussed, and the optimal trajectories are found to be superior to both constant pitch trajectories and maximum angle of attack trajectories. Spacecraft trajectories, in particular, the application of the primal sequential gradient-restoration algorithm (PSGRA) to the determination of optimal flight trajectories for aeroassisted orbital transfer are examined. Both the coplanar case and the noncoplanar case are discussed within the frame of three problems: minimization of the total characteristic velocity; minimization of the time integral of the square of the path inclination; and minimization of the peak heating rate. The solution of the second problem is called nearly-grazing solution, and its merits are pointed out as a useful engineering compromise between energy requirements and aerodynamics heating requirements.

Trajectory Optimization: OTIS 4

NASA Technical Reports Server (NTRS)

Riehl, John P.; Sjauw, Waldy K.; Falck, Robert D.; Paris, Stephen W.

2010-01-01

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.

A Class of Prediction-Correction Methods for Time-Varying Convex Optimization

NASA Astrophysics Data System (ADS)

Simonetto, Andrea; Mokhtari, Aryan; Koppel, Alec; Leus, Geert; Ribeiro, Alejandro

2016-09-01

This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or multiple gradient steps or Newton steps, which respectively correspond to the gradient trajectory tracking (GTT) or Newton trajectory tracking (NTT) algorithms. Under suitable conditions, we establish that the asymptotic error incurred by both proposed methods behaves as $O(h^2)$, and in some cases as $O(h^4)$, which outperforms the state-of-the-art error bound of $O(h)$ for correction-only methods in the gradient-correction step. Moreover, when the characteristics of the objective function variation are not available, we propose approximate gradient and Newton tracking algorithms (AGT and ANT, respectively) that still attain these asymptotical error bounds. Numerical simulations demonstrate the practical utility of the proposed methods and that they improve upon existing techniques by several orders of magnitude.

Multi-objective trajectory optimization for the space exploration vehicle

NASA Astrophysics Data System (ADS)

Qin, Xiaoli; Xiao, Zhen

2016-07-01

The research determines temperature-constrained optimal trajectory for the space exploration vehicle by developing an optimal control formulation and solving it using a variable order quadrature collocation method with a Non-linear Programming(NLP) solver. The vehicle is assumed to be the space reconnaissance aircraft that has specified takeoff/landing locations, specified no-fly zones, and specified targets for sensor data collections. A three degree of freedom aircraft model is adapted from previous work and includes flight dynamics, and thermal constraints.Vehicle control is accomplished by controlling angle of attack, roll angle, and propellant mass flow rate. This model is incorporated into an optimal control formulation that includes constraints on both the vehicle and mission parameters, such as avoidance of no-fly zones and exploration of space targets. In addition, the vehicle models include the environmental models(gravity and atmosphere). How these models are appropriately employed is key to gaining confidence in the results and conclusions of the research. Optimal trajectories are developed using several performance costs in the optimal control formation,minimum time,minimum time with control penalties,and maximum distance.The resulting analysis demonstrates that optimal trajectories that meet specified mission parameters and constraints can be quickly determined and used for large-scale space exloration.

On the analytic and numeric optimisation of airplane trajectories under real atmospheric conditions

NASA Astrophysics Data System (ADS)

Gonzalo, J.; Domínguez, D.; López, D.

2014-12-01

From the beginning of aviation era, economic constraints have forced operators to continuously improve the planning of the flights. The revenue is proportional to the cost per flight and the airspace occupancy. Many methods, the first started in the middle of last century, have explore analytical, numerical and artificial intelligence resources to reach the optimal flight planning. In parallel, advances in meteorology and communications allow an almost real-time knowledge of the atmospheric conditions and a reliable, error-bounded forecast for the near future. Thus, apart from weather risks to be avoided, airplanes can dynamically adapt their trajectories to minimise their costs. International regulators are aware about these capabilities, so it is reasonable to envisage some changes to allow this dynamic planning negotiation to soon become operational. Moreover, current unmanned airplanes, very popular and often small, suffer the impact of winds and other weather conditions in form of dramatic changes in their performance. The present paper reviews analytic and numeric solutions for typical trajectory planning problems. Analytic methods are those trying to solve the problem using the Pontryagin principle, where influence parameters are added to state variables to form a split condition differential equation problem. The system can be solved numerically -indirect optimisation- or using parameterised functions -direct optimisation-. On the other hand, numerical methods are based on Bellman's dynamic programming (or Dijkstra algorithms), where the fact that two optimal trajectories can be concatenated to form a new optimal one if the joint point is demonstrated to belong to the final optimal solution. There is no a-priori conditions for the best method. Traditionally, analytic has been more employed for continuous problems whereas numeric for discrete ones. In the current problem, airplane behaviour is defined by continuous equations, while wind fields are given in a discrete grid at certain time intervals. The research demonstrates advantages and disadvantages of each method as well as performance figures of the solutions found for typical flight conditions under static and dynamic atmospheres. This provides significant parameters to be used in the selection of solvers for optimal trajectories.

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

NASA Technical Reports Server (NTRS)

Pinson, Robin M.; Lu, Ping

2016-01-01

Mission proposals that land spacecraft on asteroids are becoming increasingly popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site with pinpoint precision. The problem under investigation is how to design a propellant optimal powered descent trajectory that can be quickly computed onboard the spacecraft, without interaction from the ground control. The propellant optimal control problem in this work is to determine the optimal finite thrust vector to land the spacecraft at a specified location, in the presence of a highly nonlinear gravity field, subject to various mission and operational constraints. The proposed solution uses convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process for a fixed final time problem. In addition, a second optimization method is wrapped around the convex optimization problem to determine the optimal flight time that yields the lowest propellant usage over all flight times. Gravity models designed for irregularly shaped asteroids are investigated. Success of the algorithm is demonstrated by designing powered descent trajectories for the elongated binary asteroid Castalia.

Singular perturbation analysis of AOTV-related trajectory optimization problems

NASA Technical Reports Server (NTRS)

Calise, Anthony J.; Bae, Gyoung H.

1990-01-01

The problem of real time guidance and optimal control of Aeroassisted Orbit Transfer Vehicles (AOTV's) was addressed using singular perturbation theory as an underlying method of analysis. Trajectories were optimized with the objective of minimum energy expenditure in the atmospheric phase of the maneuver. Two major problem areas were addressed: optimal reentry, and synergetic plane change with aeroglide. For the reentry problem, several reduced order models were analyzed with the objective of optimal changes in heading with minimum energy loss. It was demonstrated that a further model order reduction to a single state model is possible through the application of singular perturbation theory. The optimal solution for the reduced problem defines an optimal altitude profile dependent on the current energy level of the vehicle. A separate boundary layer analysis is used to account for altitude and flight path angle dynamics, and to obtain lift and bank angle control solutions. By considering alternative approximations to solve the boundary layer problem, three guidance laws were derived, each having an analytic feedback form. The guidance laws were evaluated using a Maneuvering Reentry Research Vehicle model and all three laws were found to be near optimal. For the problem of synergetic plane change with aeroglide, a difficult terminal boundary layer control problem arises which to date is found to be analytically intractable. Thus a predictive/corrective solution was developed to satisfy the terminal constraints on altitude and flight path angle. A composite guidance solution was obtained by combining the optimal reentry solution with the predictive/corrective guidance method. Numerical comparisons with the corresponding optimal trajectory solutions show that the resulting performance is very close to optimal. An attempt was made to obtain numerically optimized trajectories for the case where heating rate is constrained. A first order state variable inequality constraint was imposed on the full order AOTV point mass equations of motion, using a simple aerodynamic heating rate model.

Multiple-hopping trajectories near a rotating asteroid

NASA Astrophysics Data System (ADS)

Shen, Hong-Xin; Zhang, Tian-Jiao; Li, Zhao; Li, Heng-Nian

2017-03-01

We present a study of the transfer orbits connecting landing points of irregular-shaped asteroids. The landing points do not touch the surface of the asteroids and are chosen several meters above the surface. The ant colony optimization technique is used to calculate the multiple-hopping trajectories near an arbitrary irregular asteroid. This new method has three steps which are as follows: (1) the search of the maximal clique of candidate target landing points; (2) leg optimization connecting all landing point pairs; and (3) the hopping sequence optimization. In particular this method is applied to asteroids 433 Eros and 216 Kleopatra. We impose a critical constraint on the target landing points to allow for extensive exploration of the asteroid: the relative distance between all the arrived target positions should be larger than a minimum allowed value. Ant colony optimization is applied to find the set and sequence of targets, and the differential evolution algorithm is used to solve for the hopping orbits. The minimum-velocity increment tours of hopping trajectories connecting all the landing positions are obtained by ant colony optimization. The results from different size asteroids indicate that the cost of the minimum velocity-increment tour depends on the size of the asteroids.

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

NASA Technical Reports Server (NTRS)

Patrick, Nicholas J. M.; Sheridan, Thomas B.

1996-01-01

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance x,ary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are (1) determining, what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major U.S. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimility with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider un-modelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Optimization of fixed-range trajectories for supersonic transport aircraft

NASA Astrophysics Data System (ADS)

Windhorst, Robert Dennis

1999-11-01

This thesis develops near-optimal guidance laws that generate minimum fuel, time, or direct operating cost fixed-range trajectories for supersonic transport aircraft. The approach uses singular perturbation techniques to time-scale de-couple the equations of motion into three sets of dynamics, two of which are analyzed in the main body of this thesis and one of which is analyzed in the Appendix. The two-point-boundary-value-problems obtained by application of the maximum principle to the dynamic systems are solved using the method of matched asymptotic expansions. Finally, the two solutions are combined using the matching principle and an additive composition rule to form a uniformly valid approximation of the full fixed-range trajectory. The approach is used on two different time-scale formulations. The first holds weight constant, and the second allows weight and range dynamics to propagate on the same time-scale. Solutions for the first formulation are only carried out to zero order in the small parameter, while solutions for the second formulation are carried out to first order. Calculations for a HSCT design were made to illustrate the method. Results show that the minimum fuel trajectory consists of three segments: a minimum fuel energy-climb, a cruise-climb, and a minimum drag glide. The minimum time trajectory also has three segments: a maximum dynamic pressure ascent, a constant altitude cruise, and a maximum dynamic pressure glide. The minimum direct operating cost trajectory is an optimal combination of the two. For realistic costs of fuel and flight time, the minimum direct operating cost trajectory is very similar to the minimum fuel trajectory. Moreover, the HSCT has three local optimum cruise speeds, with the globally optimum cruise point at the highest allowable speed, if range is sufficiently long. The final range of the trajectory determines which locally optimal speed is best. Ranges of 500 to 6,000 nautical miles, subsonic and supersonic mixed flight, and varying fuel efficiency cases are analyzed. Finally, the payload-range curve of the HSCT design is determined.

Improved Propulsion Modeling for Low-Thrust Trajectory Optimization

NASA Technical Reports Server (NTRS)

Knittel, Jeremy M.; Englander, Jacob A.; Ozimek, Martin T.; Atchison, Justin A.; Gould, Julian J.

2017-01-01

Low-thrust trajectory design is tightly coupled with spacecraft systems design. In particular, the propulsion and power characteristics of a low-thrust spacecraft are major drivers in the design of the optimal trajectory. Accurate modeling of the power and propulsion behavior is essential for meaningful low-thrust trajectory optimization. In this work, we discuss new techniques to improve the accuracy of propulsion modeling in low-thrust trajectory optimization while maintaining the smooth derivatives that are necessary for a gradient-based optimizer. The resulting model is significantly more realistic than the industry standard and performs well inside an optimizer. A variety of deep-space trajectory examples are presented.

Augmenting Parametric Optimal Ascent Trajectory Modeling with Graph Theory

NASA Technical Reports Server (NTRS)

Dees, Patrick D.; Zwack, Matthew R.; Edwards, Stephen; Steffens, Michael

2016-01-01

It has been well documented that decisions made in the early stages of Conceptual and Pre-Conceptual design commit up to 80% of total Life-Cycle Cost (LCC) while engineers know the least about the product they are designing [1]. Once within Preliminary and Detailed design however, making changes to the design becomes far more difficult to enact in both cost and schedule. Primarily this has been due to a lack of detailed data usually uncovered later during the Preliminary and Detailed design phases. In our current budget-constrained environment, making decisions within Conceptual and Pre-Conceptual design which minimize LCC while meeting requirements is paramount to a program's success. Within the arena of launch vehicle design, optimizing the ascent trajectory is critical for minimizing the costs present within such concerns as propellant, aerodynamic, aeroheating, and acceleration loads while meeting requirements such as payload delivered to a desired orbit. In order to optimize the vehicle design its constraints and requirements must be known, however as the design cycle proceeds it is all but inevitable that the conditions will change. Upon that change, the previously optimized trajectory may no longer be optimal, or meet design requirements. The current paradigm for adjusting to these updates is generating point solutions for every change in the design's requirements [2]. This can be a tedious, time-consuming task as changes in virtually any piece of a launch vehicle's design can have a disproportionately large effect on the ascent trajectory, as the solution space of the trajectory optimization problem is both non-linear and multimodal [3]. In addition, an industry standard tool, Program to Optimize Simulated Trajectories (POST), requires an expert analyst to produce simulated trajectories that are feasible and optimal [4]. In a previous publication the authors presented a method for combatting these challenges [5]. In order to bring more detailed information into Conceptual and Pre-Conceptual design, knowledge of the effects originating from changes to the vehicle must be calculated. In order to do this, a model capable of quantitatively describing any vehicle within the entire design space under consideration must be constructed. This model must be based upon analysis of acceptable fidelity, which in this work comes from POST. Design space interrogation can be achieved with surrogate modeling, a parametric, polynomial equation representing a tool. A surrogate model must be informed by data from the tool with enough points to represent the solution space for the chosen number of variables with an acceptable level of error. Therefore, Design Of Experiments (DOE) is used to select points within the design space to maximize information gained on the design space while minimizing number of data points required. To represent a design space with a non-trivial number of variable parameters the number of points required still represent an amount of work which would take an inordinate amount of time via the current paradigm of manual analysis, and so an automated method was developed. The best practices of expert trajectory analysts working within NASA Marshall's Advanced Concepts Office (ACO) were implemented within a tool called multiPOST. These practices include how to use the output data from a previous run of POST to inform the next, determining whether a trajectory solution is feasible from a real-world perspective, and how to handle program execution errors. The tool was then augmented with multiprocessing capability to enable analysis on multiple trajectories simultaneously, allowing throughput to scale with available computational resources. In this update to the previous work the authors discuss issues with the method and solutions.

Modelling mid-course corrections for optimality conditions along interplanetary transfers

NASA Astrophysics Data System (ADS)

Iorfida, Elisabetta; Palmer, Phil; Roberts, Mark

2014-12-01

Within the field of trajectory optimisation, Lawden developed the primer vector theory, which defines a set of necessary conditions to characterise whether a transfer trajectory, in the two-body problem context, is optimum with respect to propellant usage. If the conditions are not satisfied, a region of the transfer trajectory is identified in which one or more potential intermediate impulses are performed in order to lower the overall cost. The method is computationally complex owing to having to solve a boundary value problem. In this paper is presented a new propagator that reduces the mathematical complexity and the computational cost of the problem, in particular it exploits a separation between the in-plane and out-of-plane components of the primer vector along the transfer trajectory. Using this propagator, the optimality of the transfer arc has been investigated, varying the departure and arrival orbits. In particular, keeping fixed the transfer trajectory, the optimality has been extensively analysed varying both the initial and final positions on the orbit, together with the directions of the initial and final thrust impulses.

Low-thrust trajectory optimization in a full ephemeris model

NASA Astrophysics Data System (ADS)

Cai, Xing-Shan; Chen, Yang; Li, Jun-Feng

2014-10-01

The low-thrust trajectory optimization with complicated constraints must be considered in practical engineering. In most literature, this problem is simplified into a two-body model in which the spacecraft is subject to the gravitational force at the center of mass and the spacecraft's own electric propulsion only, and the gravity assist (GA) is modeled as an instantaneous velocity increment. This paper presents a method to solve the fuel-optimal problem of low-thrust trajectory with complicated constraints in a full ephemeris model, which is closer to practical engineering conditions. First, it introduces various perturbations, including a third body's gravity, the nonspherical perturbation and the solar radiation pressure in a dynamic equation. Second, it builds two types of equivalent inner constraints to describe the GA. At the same time, the present paper applies a series of techniques, such as a homotopic approach, to enhance the possibility of convergence of the global optimal solution.

Optimal Control of Micro Grid Operation Mode Seamless Switching Based on Radau Allocation Method

NASA Astrophysics Data System (ADS)

Chen, Xiaomin; Wang, Gang

2017-05-01

The seamless switching process of micro grid operation mode directly affects the safety and stability of its operation. According to the switching process from island mode to grid-connected mode of micro grid, we establish a dynamic optimization model based on two grid-connected inverters. We use Radau allocation method to discretize the model, and use Newton iteration method to obtain the optimal solution. Finally, we implement the optimization mode in MATLAB and get the optimal control trajectory of the inverters.

Comparison of Low-Thrust Control Laws for Application in Planetocentric Space

NASA Technical Reports Server (NTRS)

Falck, Robert D.; Sjauw, Waldy K.; Smith, David A.

2014-01-01

Recent interest at NASA for the application of solar electric propulsion for the transfer of significant payloads in cislunar space has led to the development of high-fidelity simulations of such missions. With such transfers involving transfer times on the order of months, simulation time can be significant. In the past, the examination of such missions typically began with the use of lower-fidelity trajectory optimization tools such as SEPSPOT to develop and tune guidance laws which delivered optimal or near- optimal trajectories, where optimal is generally defined as minimizing propellant expenditure or time of flight. The transfer of these solutions to a high-fidelity simulation is typically an iterative process whereby the initial solution may nearly, but not precisely, meet mission objectives. Further tuning of the guidance algorithm is typically necessary when accounting for high-fidelity perturbations such as those due to more detailed gravity models, secondary-body effects, solar radiation pressure, etc. While trajectory optimization is a useful method for determining optimal performance metrics, algorithms which deliver nearly optimal performance with minimal tuning are an attractive alternative.

Interplanetary Trajectory Design for the Asteroid Robotic Redirect Mission Alternate Approach Trade Study

NASA Technical Reports Server (NTRS)

Merrill, Raymond Gabriel; Qu, Min; Vavrina, Matthew A.; Englander, Jacob A.; Jones, Christopher A.

2014-01-01

This paper presents mission performance analysis methods and results for the Asteroid Robotic Redirect Mission (ARRM) option to capture a free standing boulder on the surface of a 100 m or larger NEA. It details the optimization and design of heliocentric low-thrust trajectories to asteroid targets for the ARRM solar electric propulsion spacecraft. Extensive searches were conducted to determine asteroid targets with large pick-up mass potential and potential observation opportunities. Interplanetary trajectory approximations were developed in method based tools for Itokawa, Bennu, 1999 JU3, and 2008 EV5 and were validated by end-to-end integrated trajectories.

Optimizing Aircraft Trajectories with Multiple Cruise Altitudes in the Presence of Winds

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Sridhar, Banavar; Grabbe, Shon

2014-01-01

This study develops a trajectory optimization algorithm for approximately minimizing aircraft travel time and fuel burn by combining a method for computing minimum-time routes in winds on multiple horizontal planes, and an aircraft fuel burn model for generating fuel-optimal vertical profiles. It is applied to assess the potential benefits of flying user-preferred routes for commercial cargo flights operating between Anchorage, Alaska and major airports in Asia and the contiguous United States. Flying wind optimal trajectories with a fuel-optimal vertical profile reduces average fuel burn of international flights cruising at a single altitude by 1-3 percent. The potential fuel savings of performing en-route step climbs are not significant for many shorter domestic cargo flights that have only one step climb. Wind-optimal trajectories reduce fuel burn and travel time relative to the flight plan route by up to 3 percent for the domestic cargo flights. However, for trans-oceanic traffic, the fuel burn savings could be as much as 10 percent. The actual savings in operations will vary from the simulation results due to differences in the aircraft models and user defined cost indices. In general, the savings are proportional to trip length, and depend on the en-route wind conditions and aircraft types.

Six-Degree-of-Freedom Trajectory Optimization Utilizing a Two-Timescale Collocation Architecture

NASA Technical Reports Server (NTRS)

Desai, Prasun N.; Conway, Bruce A.

2005-01-01

Six-degree-of-freedom (6DOF) trajectory optimization of a reentry vehicle is solved using a two-timescale collocation methodology. This class of 6DOF trajectory problems are characterized by two distinct timescales in their governing equations, where a subset of the states have high-frequency dynamics (the rotational equations of motion) while the remaining states (the translational equations of motion) vary comparatively slowly. With conventional collocation methods, the 6DOF problem size becomes extraordinarily large and difficult to solve. Utilizing the two-timescale collocation architecture, the problem size is reduced significantly. The converged solution shows a realistic landing profile and captures the appropriate high-frequency rotational dynamics. A large reduction in the overall problem size (by 55%) is attained with the two-timescale architecture as compared to the conventional single-timescale collocation method. Consequently, optimum 6DOF trajectory problems can now be solved efficiently using collocation, which was not previously possible for a system with two distinct timescales in the governing states.

Automatic trajectory measurement of large numbers of crowded objects

NASA Astrophysics Data System (ADS)

Li, Hui; Liu, Ye; Chen, Yan Qiu

2013-06-01

Complex motion patterns of natural systems, such as fish schools, bird flocks, and cell groups, have attracted great attention from scientists for years. Trajectory measurement of individuals is vital for quantitative and high-throughput study of their collective behaviors. However, such data are rare mainly due to the challenges of detection and tracking of large numbers of objects with similar visual features and frequent occlusions. We present an automatic and effective framework to measure trajectories of large numbers of crowded oval-shaped objects, such as fish and cells. We first use a novel dual ellipse locator to detect the coarse position of each individual and then propose a variance minimization active contour method to obtain the optimal segmentation results. For tracking, cost matrix of assignment between consecutive frames is trainable via a random forest classifier with many spatial, texture, and shape features. The optimal trajectories are found for the whole image sequence by solving two linear assignment problems. We evaluate the proposed method on many challenging data sets.

MIDAS - Mission design and analysis software for the optimization of ballistic interplanetary trajectories

NASA Technical Reports Server (NTRS)

Sauer, Carl G., Jr.

1989-01-01

A patched conic trajectory optimization program MIDAS is described that was developed to investigate a wide variety of complex ballistic heliocentric transfer trajectories. MIDAS includes the capability of optimizing trajectory event times such as departure date, arrival date, and intermediate planetary flyby dates and is able to both add and delete deep space maneuvers when dictated by the optimization process. Both powered and unpowered flyby or gravity assist trajectories of intermediate bodies can be handled and capability is included to optimize trajectories having a rendezvous with an intermediate body such as for a sample return mission. Capability is included in the optimization process to constrain launch energy and launch vehicle parking orbit parameters.

Automatic determination of optimal linear drilling trajectories for cochlear access accounting for drill-positioning error.

PubMed

Noble, Jack H; Majdani, Omid; Labadie, Robert F; Dawant, Benoit; Fitzpatrick, J Michael

2010-09-01

Cochlear implantation is a surgical procedure in which an electrode array is permanently implanted into the cochlea to stimulate the auditory nerve and allow deaf people to hear. Percutaneous cochlear access, a new minimally invasive implantation approach, requires drilling a single linear channel from the skull surface to the cochlea. The focus of this paper addresses a major challenge with this approach, which is the ability to determine, in a pre-operative CT, a safe and effective drilling trajectory. A measure of the safety and effectiveness of a given trajectory relative to sensitive structures is derived using a Monte Carlo approach. The drilling trajectory that maximizes this measure is found using an optimization algorithm. In tests on 13 ears, the technique was shown to find approximately twice as many acceptable trajectories as those found manually by an experienced surgeon. Using this method, safe trajectories can be automatically determined quickly and consistently. Copyright 2010 John Wiley & Sons, Ltd.

Common aero vehicle autonomous reentry trajectory optimization satisfying waypoint and no-fly zone constraints

NASA Astrophysics Data System (ADS)

Jorris, Timothy R.

2007-12-01

To support the Air Force's Global Reach concept, a Common Aero Vehicle is being designed to support the Global Strike mission. "Waypoints" are specified for reconnaissance or multiple payload deployments and "no-fly zones" are specified for geopolitical restrictions or threat avoidance. Due to time critical targets and multiple scenario analysis, an autonomous solution is preferred over a time-intensive, manually iterative one. Thus, a real-time or near real-time autonomous trajectory optimization technique is presented to minimize the flight time, satisfy terminal and intermediate constraints, and remain within the specified vehicle heating and control limitations. This research uses the Hypersonic Cruise Vehicle (HCV) as a simplified two-dimensional platform to compare multiple solution techniques. The solution techniques include a unique geometric approach developed herein, a derived analytical dynamic optimization technique, and a rapidly emerging collocation numerical approach. This up-and-coming numerical technique is a direct solution method involving discretization then dualization, with pseudospectral methods and nonlinear programming used to converge to the optimal solution. This numerical approach is applied to the Common Aero Vehicle (CAV) as the test platform for the full three-dimensional reentry trajectory optimization problem. The culmination of this research is the verification of the optimality of this proposed numerical technique, as shown for both the two-dimensional and three-dimensional models. Additionally, user implementation strategies are presented to improve accuracy and enhance solution convergence. Thus, the contributions of this research are the geometric approach, the user implementation strategies, and the determination and verification of a numerical solution technique for the optimal reentry trajectory problem that minimizes time to target while satisfying vehicle dynamics and control limitation, and heating, waypoint, and no-fly zone constraints.

Optimal guidance for the space shuttle transition

NASA Technical Reports Server (NTRS)

Stengel, R. F.

1972-01-01

A guidance method for the space shuttle's transition from hypersonic entry to subsonic cruising flight is presented. The method evolves from a numerical trajectory optimization technique in which kinetic energy and total energy (per unit weight) replace velocity and time in the dynamic equations. This allows the open end-time problem to be transformed to one of fixed terminal energy. In its ultimate form, E-Guidance obtains energy balance (including dynamic-pressure-rate damping) and path length control by angle-of-attack modulation and cross-range control by roll angle modulation. The guidance functions also form the basis for a pilot display of instantaneous maneuver limits and destination. Numerical results illustrate the E-Guidance concept and the optimal trajectories on which it is based.

Huygens Titan Probe Trajectory Reconstruction Using Traditional Methods and the Program to Optimize Simulated Trajectories II

NASA Technical Reports Server (NTRS)

Striepe, Scott A.; Blanchard, Robert C.; Kirsch, Michael F.; Fowler, Wallace T.

2007-01-01

On January 14, 2005, ESA's Huygens probe separated from NASA's Cassini spacecraft, entered the Titan atmosphere and landed on its surface. As part of NASA Engineering Safety Center Independent Technical Assessment of the Huygens entry, descent, and landing, and an agreement with ESA, NASA provided results of all EDL analyses and associated findings to the Huygens project team prior to probe entry. In return, NASA was provided the flight data from the probe so that trajectory reconstruction could be done and simulation models assessed. Trajectory reconstruction of the Huygens entry probe at Titan was accomplished using two independent approaches: a traditional method and a POST2-based method. Results from both approaches are discussed in this paper.

Design of the VISITOR Tool: A Versatile ImpulSive Interplanetary Trajectory OptimizeR

NASA Technical Reports Server (NTRS)

Corpaccioli, Luca; Linskens, Harry; Komar, David R.

2014-01-01

The design of trajectories for interplanetary missions represents one of the most complex and important problems to solve during conceptual space mission design. To facilitate conceptual mission sizing activities, it is essential to obtain sufficiently accurate trajectories in a fast and repeatable manner. To this end, the VISITOR tool was developed. This tool modularly augments a patched conic MGA-1DSM model with a mass model, launch window analysis, and the ability to simulate more realistic arrival and departure operations. This was implemented in MATLAB, exploiting the built-in optimization tools and vector analysis routines. The chosen optimization strategy uses a grid search and pattern search, an iterative variable grid method. A genetic algorithm can be selectively used to improve search space pruning, at the cost of losing the repeatability of the results and increased computation time. The tool was validated against seven flown missions: the average total mission (Delta)V offset from the nominal trajectory was 9.1%, which was reduced to 7.3% when using the genetic algorithm at the cost of an increase in computation time by a factor 5.7. It was found that VISITOR was well-suited for the conceptual design of interplanetary trajectories, while also facilitating future improvements due to its modular structure.

Monte Carlo tree search -based non-coplanar trajectory design for station parameter optimized radiation therapy (SPORT).

PubMed

Dong, Peng; Liu, Hongcheng; Xing, Lei

2018-06-04

An important yet challenging problem in LINAC-based rotational arc radiation therapy is the design of beam trajectory, which requires simultaneous consideration of delivery efficiency and final dose distribution. In this work, we propose a novel trajectory selection strategy by developing a Monte Carlo tree search (MCTS) algorithm during the beam trajectory selection process. Methods: To search through the vast number of possible trajectories, MCTS algorithm was implemented. In this approach, a candidate trajectory is explored by starting from a leaf node and sequentially examining the next level of linked nodes with consideration of geometric and physical constraints. The maximum Upper Confidence Bounds for Trees, which is a function of average objective function value and the number of times the node under testing has been visited, was employed to intelligently select the trajectory. For each candidate trajectory, we run an inverse fluence map optimization with an infinity norm regularization. The ranking of the plan as measured by the corresponding objective function value was then fed back to update the statistics of the nodes on the trajectory. The method was evaluated with a chest wall and a brain case, and the results were compared with the coplanar and noncoplanar 4pi beam configurations. Results: For both clinical cases, the MCTS method found effective and easy-to-deliver trajectories within an hour. As compared with the coplanar plans, it offers much better sparing of the OARs while maintaining the PTV coverage. The quality of the MCTS-generated plan is found to be comparable to the 4pi plans. Conclusion: AI based on MCTS is valuable to facilitate the design of beam trajectory and paves the way for future clinical use of non-coplanar treatment delivery. . © 2018 Institute of Physics and Engineering in Medicine.

Resonant power processors. II - Methods of control

NASA Technical Reports Server (NTRS)

Oruganti, R.; Lee, F. C.

1984-01-01

The nature of resonant converter control is discussed. Employing the state-portrait, different control methods for series resonant converter are identified and their performance evaluated based on their stability, response to control and load changes and range of operation. A new control method, optimal-trajectory control, is proposed which, by utilizing the state trajectories as control laws, continuously monitors the energy level of the resonant tank. The method is shown to have superior control properties especially under transient operation.

Continuous performance measurement in flight systems. [sequential control model

NASA Technical Reports Server (NTRS)

Connelly, E. M.; Sloan, N. A.; Zeskind, R. M.

1975-01-01

The desired response of many man machine control systems can be formulated as a solution to an optimal control synthesis problem where the cost index is given and the resulting optimal trajectories correspond to the desired trajectories of the man machine system. Optimal control synthesis provides the reference criteria and the significance of error information required for performance measurement. The synthesis procedure described provides a continuous performance measure (CPM) which is independent of the mechanism generating the control action. Therefore, the technique provides a meaningful method for online evaluation of man's control capability in terms of total man machine performance.

Radiofrequency pulse design using nonlinear gradient magnetic fields.

PubMed

Kopanoglu, Emre; Constable, R Todd

2015-09-01

An iterative k-space trajectory and radiofrequency (RF) pulse design method is proposed for excitation using nonlinear gradient magnetic fields. The spatial encoding functions (SEFs) generated by nonlinear gradient fields are linearly dependent in Cartesian coordinates. Left uncorrected, this may lead to flip angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a matching pursuit algorithm, and the RF pulse is designed using a conjugate gradient algorithm. Three variants of the proposed approach are given: the full algorithm, a computationally cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. The method is compared with other iterative (matching pursuit and conjugate gradient) and noniterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity. An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. © 2014 Wiley Periodicals, Inc.

Multi-Objective Trajectory Optimization of a Hypersonic Reconnaissance Vehicle with Temperature Constraints

NASA Astrophysics Data System (ADS)

Masternak, Tadeusz J.

This research determines temperature-constrained optimal trajectories for a scramjet-based hypersonic reconnaissance vehicle by developing an optimal control formulation and solving it using a variable order Gauss-Radau quadrature collocation method with a Non-Linear Programming (NLP) solver. The vehicle is assumed to be an air-breathing reconnaissance aircraft that has specified takeoff/landing locations, airborne refueling constraints, specified no-fly zones, and specified targets for sensor data collections. A three degree of freedom scramjet aircraft model is adapted from previous work and includes flight dynamics, aerodynamics, and thermal constraints. Vehicle control is accomplished by controlling angle of attack, roll angle, and propellant mass flow rate. This model is incorporated into an optimal control formulation that includes constraints on both the vehicle and mission parameters, such as avoidance of no-fly zones and coverage of high-value targets. To solve the optimal control formulation, a MATLAB-based package called General Pseudospectral Optimal Control Software (GPOPS-II) is used, which transcribes continuous time optimal control problems into an NLP problem. In addition, since a mission profile can have varying vehicle dynamics and en-route imposed constraints, the optimal control problem formulation can be broken up into several "phases" with differing dynamics and/or varying initial/final constraints. Optimal trajectories are developed using several different performance costs in the optimal control formulation: minimum time, minimum time with control penalties, and maximum range. The resulting analysis demonstrates that optimal trajectories that meet specified mission parameters and constraints can be quickly determined and used for larger-scale operational and campaign planning and execution.

A Method for Extracting Road Boundary Information from Crowdsourcing Vehicle GPS Trajectories.

PubMed

Yang, Wei; Ai, Tinghua; Lu, Wei

2018-04-19

Crowdsourcing trajectory data is an important approach for accessing and updating road information. In this paper, we present a novel approach for extracting road boundary information from crowdsourcing vehicle traces based on Delaunay triangulation (DT). First, an optimization and interpolation method is proposed to filter abnormal trace segments from raw global positioning system (GPS) traces and interpolate the optimization segments adaptively to ensure there are enough tracking points. Second, constructing the DT and the Voronoi diagram within interpolated tracking lines to calculate road boundary descriptors using the area of Voronoi cell and the length of triangle edge. Then, the road boundary detection model is established integrating the boundary descriptors and trajectory movement features (e.g., direction) by DT. Third, using the boundary detection model to detect road boundary from the DT constructed by trajectory lines, and a regional growing method based on seed polygons is proposed to extract the road boundary. Experiments were conducted using the GPS traces of taxis in Beijing, China, and the results show that the proposed method is suitable for extracting the road boundary from low-frequency GPS traces, multi-type road structures, and different time intervals. Compared with two existing methods, the automatically extracted boundary information was proved to be of higher quality.

A Method for Extracting Road Boundary Information from Crowdsourcing Vehicle GPS Trajectories

PubMed Central

Yang, Wei

2018-01-01

Crowdsourcing trajectory data is an important approach for accessing and updating road information. In this paper, we present a novel approach for extracting road boundary information from crowdsourcing vehicle traces based on Delaunay triangulation (DT). First, an optimization and interpolation method is proposed to filter abnormal trace segments from raw global positioning system (GPS) traces and interpolate the optimization segments adaptively to ensure there are enough tracking points. Second, constructing the DT and the Voronoi diagram within interpolated tracking lines to calculate road boundary descriptors using the area of Voronoi cell and the length of triangle edge. Then, the road boundary detection model is established integrating the boundary descriptors and trajectory movement features (e.g., direction) by DT. Third, using the boundary detection model to detect road boundary from the DT constructed by trajectory lines, and a regional growing method based on seed polygons is proposed to extract the road boundary. Experiments were conducted using the GPS traces of taxis in Beijing, China, and the results show that the proposed method is suitable for extracting the road boundary from low-frequency GPS traces, multi-type road structures, and different time intervals. Compared with two existing methods, the automatically extracted boundary information was proved to be of higher quality. PMID:29671792

Strategies for the sustained human exploration of Mars

NASA Astrophysics Data System (ADS)

Landau, Damon Frederick

A variety of mission scenarios are compared in this thesis to assess the strengths and weaknesses of options for Mars exploration. The mission design space is modeled along two dimensions: trajectory architectures and propulsion system technologies. Direct, semi-direct, stop-over, semi-cycler, and cycler architectures are examined, and electric propulsion, nuclear thermal rockets, methane and oxygen production on Mars, Mars water excavation, aerocapture, and reusable propulsion systems are included in the technology assessment. The mission sensitivity to crew size, vehicle masses, and crew travel time is also examined. The primary figure of merit for a mission scenario is the injected mass to low-Earth orbit (IMLEO), though technology readiness levels (TRL) are also included. Several elements in the architecture dimension are explored in more detail. The Earth-Mars semi-cycler architecture is introduced and five families of Earth-Mars semi-cycler trajectories are presented along with optimized itineraries. Optimized cycler trajectories are also presented. In addition to Earth-Mars semi-cycler and cycler trajectories, conjunction-class, free-return, Mars-Earth semi-cycler, and low-thrust trajectories are calculated. Design parameters for optimal DeltaV trajectories are provided over a range of flight times (from 120 to 270 days) and launch years (between 2009 and 2022). Unlike impulsive transfers, the mass-optimal low-thrust trajectory depends strongly on the thrust and specific impulse of the propulsion system. A low-thrust version of the rocket equation is provided where the initial mass or thrust may be minimized by varying the initial acceleration and specific impulse. Planet-centered operations are also examined. A method to rotate a parking orbit about the line of apsides to achieve the proper orientation at departure is discussed, thus coupling the effects of parking-orbit orientation with the interplanetary trajectories. Also, a guidance algorithm for rendezvous during flybys in semi-cycler and cycler missions is presented with a control law for final approach. A forty-year plan to establish a permanent base on Mars is detailed and methods to expand the base are discussed. Once a large base is established, one-, two-, or three-vehicle systems may sustain the colonization of Mars.

Advances in hypersonic vehicle synthesis with application to studies of advanced thermal protection system

NASA Technical Reports Server (NTRS)

Ardema, Mark D.

1995-01-01

This report summarizes the work entitled 'Advances in Hypersonic Vehicle Synthesis with Application to Studies of Advanced Thermal Protection Systems.' The effort was in two areas: (1) development of advanced methods of trajectory and propulsion system optimization; and (2) development of advanced methods of structural weight estimation. The majority of the effort was spent in the trajectory area.

Fast state transfer in a Λ-system: a shortcut-to-adiabaticity approach to robust and resource optimized control

NASA Astrophysics Data System (ADS)

Mortensen, Henrik Lund; Sørensen, Jens Jakob W. H.; Mølmer, Klaus; Sherson, Jacob Friis

2018-02-01

We propose an efficient strategy to find optimal control functions for state-to-state quantum control problems. Our procedure first chooses an input state trajectory, that can realize the desired transformation by adiabatic variation of the system Hamiltonian. The shortcut-to-adiabaticity formalism then provides a control Hamiltonian that realizes the reference trajectory exactly but on a finite time scale. As the final state is achieved with certainty, we define a cost functional that incorporates the resource requirements and a perturbative expression for robustness. We optimize this functional by systematically varying the reference trajectory. We demonstrate the method by application to population transfer in a laser driven three-level Λ-system, where we find solutions that are fast and robust against perturbations while maintaining a low peak laser power.

Approximate approach for optimization space flights with a low thrust on the basis of sufficient optimality conditions

NASA Astrophysics Data System (ADS)

Salmin, Vadim V.

2017-01-01

Flight mechanics with a low-thrust is a new chapter of mechanics of space flight, considered plurality of all problems trajectory optimization and movement control laws and the design parameters of spacecraft. Thus tasks associated with taking into account the additional factors in mathematical models of the motion of spacecraft becomes increasingly important, as well as additional restrictions on the possibilities of the thrust vector control. The complication of the mathematical models of controlled motion leads to difficulties in solving optimization problems. Author proposed methods of finding approximate optimal control and evaluating their optimality based on analytical solutions. These methods are based on the principle of extending the class of admissible states and controls and sufficient conditions for the absolute minimum. Developed procedures of the estimation enabling to determine how close to the optimal founded solution, and indicate ways to improve them. Authors describes procedures of estimate for approximately optimal control laws for space flight mechanics problems, in particular for optimization flight low-thrust between the circular non-coplanar orbits, optimization the control angle and trajectory movement of the spacecraft during interorbital flights, optimization flights with low-thrust between arbitrary elliptical orbits Earth satellites.

An engineering optimization method with application to STOL-aircraft approach and landing trajectories

NASA Technical Reports Server (NTRS)

Jacob, H. G.

1972-01-01

An optimization method has been developed that computes the optimal open loop inputs for a dynamical system by observing only its output. The method reduces to static optimization by expressing the inputs as series of functions with parameters to be optimized. Since the method is not concerned with the details of the dynamical system to be optimized, it works for both linear and nonlinear systems. The method and the application to optimizing longitudinal landing paths for a STOL aircraft with an augmented wing are discussed. Noise, fuel, time, and path deviation minimizations are considered with and without angle of attack, acceleration excursion, flight path, endpoint, and other constraints.

Developmental Trajectories of Subjective Social Status

PubMed Central

Maxwell, Sarah; Malspeis, Susan; Adler, Nancy

2015-01-01

BACKGROUND AND OBJECTIVE: Subjective social status (SSS), a person’s sense of their (or for youth, their family’s) position in the socioeconomic hierarchy, is strongly related to health in adults but not health in adolescence. Understanding this developmental discrepancy requires first understanding the developmental trajectory of SSS. The objective of this study was to identify the number and shape of SSS trajectories as adolescents transition to adulthood and explore if trajectory membership affects health. METHODS: Using data from 7436 assessments from the Princeton School District Study, a decade-long cohort study of non-Hispanic black and white youth, latent class growth models with 3 to 7 SSS trajectories were developed. Model fit, trajectory structure, and shape were used to guide optimal model selection. Using this optimal model, the associations of trajectory membership with BMI and depressive symptoms in young adulthood were explored. RESULTS: The 5-class model was optimal. In this model, trajectories were persistent high (7.8%), mid–high (32.2%), middle (43.4%), low–lower (7.4%), and high–low (9.1%). Non-Hispanic black race/ethnicity, lower household income, and low parent education were associated with membership in this high–low trajectory. High–low trajectory membership was associated with higher BMI and depressive symptoms in non-Hispanic white subjects but was not associated with depressive symptoms. It was associated with lower BMI only after adjustment for BMI in adolescence in non-Hispanic black subjects. CONCLUSIONS: SSS is relatively stable in adolescence and the transition to adulthood, and it generally reflects objective markers of social advantage. However, socially disadvantaged youth with high SSS in early adolescence may be at increased health risk. PMID:26324868

Interactive orbital proximity operations planning system instruction and training guide

NASA Technical Reports Server (NTRS)

Grunwald, Arthur J.; Ellis, Stephen R.

1994-01-01

This guide instructs users in the operation of a Proximity Operations Planning System. This system uses an interactive graphical method for planning fuel-efficient rendezvous trajectories in the multi-spacecraft environment of the space station and allows the operator to compose a multi-burn transfer trajectory between orbit initial chaser and target trajectories. The available task time (window) of the mission is predetermined and the maneuver is subject to various operational constraints, such as departure, arrival, spatial, plume impingement, and en route passage constraints. The maneuvers are described in terms of the relative motion experienced in a space station centered coordinate system. Both in-orbital plane as well as out-of-orbital plane maneuvering is considered. A number of visual optimization aids are used for assisting the operator in reaching fuel-efficient solutions. These optimization aids are based on the Primer Vector theory. The visual feedback of trajectory shapes, operational constraints, and optimization functions, provided by user-transparent and continuously active background computations, allows the operator to make fast, iterative design changes that rapidly converge to fuel-efficient solutions. The planning tool is an example of operator-assisted optimization of nonlinear cost functions.

Low thrust spacecraft transfers optimization method with the stepwise control structure in the Earth-Moon system in terms of the L1-L2 transfer

NASA Astrophysics Data System (ADS)

Fain, M. K.; Starinova, O. L.

2016-04-01

The paper outlines the method for determination of the locally optimal stepwise control structure in the problem of the low thrust spacecraft transfer optimization in the Earth-Moon system, including the L1-L2 transfer. The total flight time as an optimization criterion is considered. The optimal control programs were obtained by using the Pontryagin's maximum principle. As a result of optimization, optimal control programs, corresponding trajectories, and minimal total flight times were determined.

An automated method to find transition states using chemical dynamics simulations.

PubMed

Martínez-Núñez, Emilio

2015-02-05

A procedure to automatically find the transition states (TSs) of a molecular system (MS) is proposed. It has two components: high-energy chemical dynamics simulations (CDS), and an algorithm that analyzes the geometries along the trajectories to find reactive pathways. Two levels of electronic structure calculations are involved: a low level (LL) is used to integrate the trajectories and also to optimize the TSs, and a higher level (HL) is used to reoptimize the structures. The method has been tested in three MSs: formaldehyde, formic acid (FA), and vinyl cyanide (VC), using MOPAC2012 and Gaussian09 to run the LL and HL calculations, respectively. Both the efficacy and efficiency of the method are very good, with around 15 TS structures optimized every 10 trajectories, which gives a total of 7, 12, and 83 TSs for formaldehyde, FA, and VC, respectively. The use of CDS makes it a powerful tool to unveil possible nonstatistical behavior of the system under study. © 2014 Wiley Periodicals, Inc.

Trajectories for High Specific Impulse High Specific Power Deep Space Exploration

NASA Technical Reports Server (NTRS)

Polsgrove, Tara; Adams, Robert B.; Brady, Hugh J. (Technical Monitor)

2002-01-01

Flight times and deliverable masses for electric and fusion propulsion systems are difficult to approximate. Numerical integration is required for these continuous thrust systems. Many scientists are not equipped with the tools and expertise to conduct interplanetary and interstellar trajectory analysis for their concepts. Several charts plotting the results of well-known trajectory simulation codes were developed and are contained in this paper. These charts illustrate the dependence of time of flight and payload ratio on jet power, initial mass, specific impulse and specific power. These charts are intended to be a tool by which people in the propulsion community can explore the possibilities of their propulsion system concepts. Trajectories were simulated using the tools VARITOP and IPOST. VARITOP is a well known trajectory optimization code that involves numerical integration based on calculus of variations. IPOST has several methods of trajectory simulation; the one used in this paper is Cowell's method for full integration of the equations of motion. An analytical method derived in the companion paper was also evaluated. The accuracy of this method is discussed in the paper.

Simulation of Trajectories for High Specific Impulse Deep Space Exploration

NASA Technical Reports Server (NTRS)

Polsgrove, Tara; Adams, Robert B.; Brady, Hugh J. (Technical Monitor)

2002-01-01

Difficulties in approximating flight times and deliverable masses for continuous thrust propulsion systems have complicated comparison and evaluation of proposed propulsion concepts. These continuous thrust propulsion systems are of interest to many groups, not the least of which are the electric propulsion and fusion communities. Several charts plotting the results of well-known trajectory simulation codes were developed and are contained in this paper. These charts illustrate the dependence of time of flight and payload ratio on jet power, initial mass, specific impulse and specific power. These charts are intended to be a tool by which people in the propulsion community can explore the possibilities of their propulsion system concepts. Trajectories were simulated using the tools VARITOP and IPOST. VARITOP is a well known trajectory optimization code that involves numerical integration based on calculus of variations. IPOST has several methods of trajectory simulation; the one used in this paper is Cowell's method for full integration of the equations of motion. The analytical method derived in the companion paper was also used to simulate the trajectory. The accuracy of this method is discussed in the paper.

Effects of inclination and eccentricity on optimal trajectories between earth and Venus

NASA Technical Reports Server (NTRS)

Gravier, J.-P.; Marchal, C.; Culp, R. D.

1973-01-01

The true optimal transfers, including the effects of the inclination and eccentricity of the planets' orbits, between earth and Venus are presented as functions of the corresponding idealized Hohmann transfers. The method of determining the optimal transfers using the calculus of variations is presented. For every possible Hohmann window, specified as a continuous function of the longitude of perihelion of the Hohmann trajectory, the corresponding numerically exact optimal two-impulse transfers are given in graphical form. The cases for which the optimal two-impulse transfer is the absolute optimal, and those for which a three-impulse transfer provides the absolute optimal transfer are indicated. This information furnishes everything necessary for quick and accurate orbit calculations for preliminary Venus mission analysis. This makes it possible to use the actual optimal transfers for advanced planning in place of the standard Hohmann transfers.

RF Pulse Design using Nonlinear Gradient Magnetic Fields

PubMed Central

Kopanoglu, Emre; Constable, R. Todd

2014-01-01

Purpose An iterative k-space trajectory and radio-frequency (RF) pulse design method is proposed for Excitation using Nonlinear Gradient Magnetic fields (ENiGMa). Theory and Methods The spatial encoding functions (SEFs) generated by nonlinear gradient fields (NLGFs) are linearly dependent in Cartesian-coordinates. Left uncorrected, this may lead to flip-angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a Matching-Pursuit algorithm, and the RF pulse is designed using a Conjugate-Gradient algorithm. Three variants of the proposed approach are given: the full-algorithm, a computationally-cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. Results The method is compared to other iterative (Matching-Pursuit and Conjugate Gradient) and non-iterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity significantly. Conclusion An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. PMID:25203286

Dynamic trajectory-based couch motion for improvement of radiation therapy trajectories in cranial SRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

MacDonald, R. Lee; Thomas, Christopher G., E-mail: Chris.Thomas@cdha.nshealth.ca; Department of Medical Physics, Nova Scotia Cancer Centre, Queen Elizabeth II Health Sciences Centre, Halifax, Nova Scotia B3H 1V7

2015-05-15

Purpose: To investigate potential improvement in external beam stereotactic radiation therapy plan quality for cranial cases using an optimized dynamic gantry and patient support couch motion trajectory, which could minimize exposure to sensitive healthy tissue. Methods: Anonymized patient anatomy and treatment plans of cranial cancer patients were used to quantify the geometric overlap between planning target volumes and organs-at-risk (OARs) based on their two-dimensional projection from source to a plane at isocenter as a function of gantry and couch angle. Published dose constraints were then used as weighting factors for the OARs to generate a map of couch-gantry coordinate space,more » indicating degree of overlap at each point in space. A couch-gantry collision space was generated by direct measurement on a linear accelerator and couch using an anthropomorphic solid-water phantom. A dynamic, fully customizable algorithm was written to generate a navigable ideal trajectory for the patient specific couch-gantry space. The advanced algorithm can be used to balance the implementation of absolute minimum values of overlap with the clinical practicality of large-scale couch motion and delivery time. Optimized cranial cancer treatment trajectories were compared to conventional treatment trajectories. Results: Comparison of optimized treatment trajectories with conventional treatment trajectories indicated an average decrease in mean dose to the OARs of 19% and an average decrease in maximum dose to the OARs of 12%. Degradation was seen for homogeneity index (6.14% ± 0.67%–5.48% ± 0.76%) and conformation number (0.82 ± 0.02–0.79 ± 0.02), but neither was statistically significant. Removal of OAR constraints from volumetric modulated arc therapy optimization reveals that reduction in dose to OARs is almost exclusively due to the optimized trajectory and not the OAR constraints. Conclusions: The authors’ study indicated that simultaneous couch and gantry motion during radiation therapy to minimize the geometrical overlap in the beams-eye-view of target volumes and the organs-at-risk can have an appreciable dose reduction to organs-at-risk.« less

Trajectory optimization for lunar soft landing with complex constraints

NASA Astrophysics Data System (ADS)

Chu, Huiping; Ma, Lin; Wang, Kexin; Shao, Zhijiang; Song, Zhengyu

2017-11-01

A unified trajectory optimization framework with initialization strategies is proposed in this paper for lunar soft landing for various missions with specific requirements. Two main missions of interest are Apollo-like Landing from low lunar orbit and Vertical Takeoff Vertical Landing (a promising mobility method) on the lunar surface. The trajectory optimization is characterized by difficulties arising from discontinuous thrust, multi-phase connections, jump of attitude angle, and obstacles avoidance. Here R-function is applied to deal with the discontinuities of thrust, checkpoint constraints are introduced to connect multiple landing phases, attitude angular rate is designed to get rid of radical changes, and safeguards are imposed to avoid collision with obstacles. The resulting dynamic problems are generally with complex constraints. The unified framework based on Gauss Pseudospectral Method (GPM) and Nonlinear Programming (NLP) solver are designed to solve the problems efficiently. Advanced initialization strategies are developed to enhance both the convergence and computation efficiency. Numerical results demonstrate the adaptability of the framework for various landing missions, and the performance of successful solution of difficult dynamic problems.

Optimal lunar soft landing trajectories using taboo evolutionary programming

NASA Astrophysics Data System (ADS)

Mutyalarao, M.; Raj, M. Xavier James

A safe lunar landing is a key factor to undertake an effective lunar exploration. Lunar lander consists of four phases such as launch phase, the earth-moon transfer phase, circumlunar phase and landing phase. The landing phase can be either hard landing or soft landing. Hard landing means the vehicle lands under the influence of gravity without any deceleration measures. However, soft landing reduces the vertical velocity of the vehicle before landing. Therefore, for the safety of the astronauts as well as the vehicle lunar soft landing with an acceptable velocity is very much essential. So it is important to design the optimal lunar soft landing trajectory with minimum fuel consumption. Optimization of Lunar Soft landing is a complex optimal control problem. In this paper, an analysis related to lunar soft landing from a parking orbit around Moon has been carried out. A two-dimensional trajectory optimization problem is attempted. The problem is complex due to the presence of system constraints. To solve the time-history of control parameters, the problem is converted into two point boundary value problem by using the maximum principle of Pontrygen. Taboo Evolutionary Programming (TEP) technique is a stochastic method developed in recent years and successfully implemented in several fields of research. It combines the features of taboo search and single-point mutation evolutionary programming. Identifying the best unknown parameters of the problem under consideration is the central idea for many space trajectory optimization problems. The TEP technique is used in the present methodology for the best estimation of initial unknown parameters by minimizing objective function interms of fuel requirements. The optimal estimation subsequently results into an optimal trajectory design of a module for soft landing on the Moon from a lunar parking orbit. Numerical simulations demonstrate that the proposed approach is highly efficient and it reduces the minimum fuel consumption. The results are compared with the available results in literature shows that the solution of present algorithm is better than some of the existing algorithms. Keywords: soft landing, trajectory optimization, evolutionary programming, control parameters, Pontrygen principle.

Optimizing highly noncoplanar VMAT trajectories: the NoVo method.

PubMed

Langhans, Marco; Unkelbach, Jan; Bortfeld, Thomas; Craft, David

2018-01-16

We introduce a new method called NoVo (Noncoplanar VMAT Optimization) to produce volumetric modulated arc therapy (VMAT) treatment plans with noncoplanar trajectories. While the use of noncoplanar beam arrangements for intensity modulated radiation therapy (IMRT), and in particular high fraction stereotactic radiosurgery (SRS), is common, noncoplanar beam trajectories for VMAT are less common as the availability of treatment machines handling these is limited. For both IMRT and VMAT, the beam angle selection problem is highly nonconvex in nature, which is why automated beam angle selection procedures have not entered mainstream clinical usage. NoVo determines a noncoplanar VMAT solution (i.e. the simultaneous trajectories of the gantry and the couch) by first computing a [Formula: see text] solution (beams from every possible direction, suitably discretized) and then eliminating beams by examing fluence contributions. Also all beam angles are scored via geometrical considerations only to find out the usefulness of the whole beam space in a very short time. A custom path finding algorithm is applied to find an optimized, continuous trajectory through the most promising beam angles using the calculated score of the beam space. Finally, using this trajectory a VMAT plan is optimized. For three clinical cases, a lung, brain, and liver case, we compare NoVo to the ideal [Formula: see text] solution, nine beam noncoplanar IMRT, coplanar VMAT, and a recently published noncoplanar VMAT algorithm. NoVo comes closest to the [Formula: see text] solution considering the lung case (brain and liver case: second), as well as improving the solution time by using geometrical considerations, followed by a time effective iterative process reducing the [Formula: see text] solution. Compared to a recently published noncoplanar VMAT algorithm, using NoVo the computation time is reduced by a factor of 2-3 (depending on the case). Compared to coplanar VMAT, NoVo reduces the objective function value by 24%, 49% and 6% for the lung, brain and liver cases, respectively.

Optimizing highly noncoplanar VMAT trajectories: the NoVo method

NASA Astrophysics Data System (ADS)

Langhans, Marco; Unkelbach, Jan; Bortfeld, Thomas; Craft, David

2018-01-01

We introduce a new method called NoVo (Noncoplanar VMAT Optimization) to produce volumetric modulated arc therapy (VMAT) treatment plans with noncoplanar trajectories. While the use of noncoplanar beam arrangements for intensity modulated radiation therapy (IMRT), and in particular high fraction stereotactic radiosurgery (SRS), is common, noncoplanar beam trajectories for VMAT are less common as the availability of treatment machines handling these is limited. For both IMRT and VMAT, the beam angle selection problem is highly nonconvex in nature, which is why automated beam angle selection procedures have not entered mainstream clinical usage. NoVo determines a noncoplanar VMAT solution (i.e. the simultaneous trajectories of the gantry and the couch) by first computing a 4π solution (beams from every possible direction, suitably discretized) and then eliminating beams by examing fluence contributions. Also all beam angles are scored via geometrical considerations only to find out the usefulness of the whole beam space in a very short time. A custom path finding algorithm is applied to find an optimized, continuous trajectory through the most promising beam angles using the calculated score of the beam space. Finally, using this trajectory a VMAT plan is optimized. For three clinical cases, a lung, brain, and liver case, we compare NoVo to the ideal 4π solution, nine beam noncoplanar IMRT, coplanar VMAT, and a recently published noncoplanar VMAT algorithm. NoVo comes closest to the 4π solution considering the lung case (brain and liver case: second), as well as improving the solution time by using geometrical considerations, followed by a time effective iterative process reducing the 4π solution. Compared to a recently published noncoplanar VMAT algorithm, using NoVo the computation time is reduced by a factor of 2-3 (depending on the case). Compared to coplanar VMAT, NoVo reduces the objective function value by 24%, 49% and 6% for the lung, brain and liver cases, respectively.

Optimal trajectories for the aeroassisted flight experiment, 1988-89

NASA Technical Reports Server (NTRS)

Miele, A.

1989-01-01

Research is summarized on optimal trajectories for the aeroassisted flight experiment, performed by the Aero-Astronautics Group of Rice University during the period 1988 through 1989. This research includes the following topics: (1) equations of motion in an Earth-fixed system; (2) equations of motion in an inertial system; (3) formultion of the optimal trajectory problem; (4) results on the optimal trajectory problem; and (5) guidance implications.

Trajectory Design Strategies for the NGST L2 Libration Point Mission

NASA Technical Reports Server (NTRS)

Folta, David; Cooley, Steven; Howell, Kathleen; Bauer, Frank H.

2001-01-01

The Origins' Next Generation Space Telescope (NGST) trajectory design is addressed in light of improved methods for attaining constrained orbit parameters and their control at the exterior collinear libration point, L2. The use of a dynamical systems approach, state-space equations for initial libration orbit control, and optimization to achieve constrained orbit parameters are emphasized. The NGST trajectory design encompasses a direct transfer and orbit maintenance under a constant acceleration. A dynamical systems approach can be used to provide a biased orbit and stationkeeping maintenance method that incorporates the constraint of a single axis correction scheme.

Optimal Control of Induction Machines to Minimize Transient Energy Losses

NASA Astrophysics Data System (ADS)

Plathottam, Siby Jose

Induction machines are electromechanical energy conversion devices comprised of a stator and a rotor. Torque is generated due to the interaction between the rotating magnetic field from the stator, and the current induced in the rotor conductors. Their speed and torque output can be precisely controlled by manipulating the magnitude, frequency, and phase of the three input sinusoidal voltage waveforms. Their ruggedness, low cost, and high efficiency have made them ubiquitous component of nearly every industrial application. Thus, even a small improvement in their energy efficient tend to give a large amount of electrical energy savings over the lifetime of the machine. Hence, increasing energy efficiency (reducing energy losses) in induction machines is a constrained optimization problem that has attracted attention from researchers. The energy conversion efficiency of induction machines depends on both the speed-torque operating point, as well as the input voltage waveform. It also depends on whether the machine is in the transient or steady state. Maximizing energy efficiency during steady state is a Static Optimization problem, that has been extensively studied, with commercial solutions available. On the other hand, improving energy efficiency during transients is a Dynamic Optimization problem that is sparsely studied. This dissertation exclusively focuses on improving energy efficiency during transients. This dissertation treats the transient energy loss minimization problem as an optimal control problem which consists of a dynamic model of the machine, and a cost functional. The rotor field oriented current fed model of the induction machine is selected as the dynamic model. The rotor speed and rotor d-axis flux are the state variables in the dynamic model. The stator currents referred to as d-and q-axis currents are the control inputs. A cost functional is proposed that assigns a cost to both the energy losses in the induction machine, as well as the deviations from desired speed-torque-magnetic flux setpoints. Using Pontryagin's minimum principle, a set of necessary conditions that must be satisfied by the optimal control trajectories are derived. The conditions are in the form a two-point boundary value problem, that can be solved numerically. The conjugate gradient method that was modified using the Hestenes-Stiefel formula was used to obtain the numerical solution of both the control and state trajectories. Using the distinctive shape of the numerical trajectories as inspiration, analytical expressions were derived for the state, and control trajectories. It was shown that the trajectory could be fully described by finding the solution of a one-dimensional optimization problem. The sensitivity of both the optimal trajectory and the optimal energy efficiency to different induction machine parameters were analyzed. A non-iterative solution that can use feedback for generating optimal control trajectories in real time was explored. It was found that an artificial neural network could be trained using the numerical solutions and made to emulate the optimal control trajectories with a high degree of accuracy. Hence a neural network along with a supervisory logic was implemented and used in a real-time simulation to control the Finite Element Method model of the induction machine. The results were compared with three other control regimes and the optimal control system was found to have the highest energy efficiency for the same drive cycle.

An unconditionally stable method for numerically solving solar sail spacecraft equations of motion

NASA Astrophysics Data System (ADS)

Karwas, Alex

Solar sails use the endless supply of the Sun's radiation to propel spacecraft through space. The sails use the momentum transfer from the impinging solar radiation to provide thrust to the spacecraft while expending zero fuel. Recently, the first solar sail spacecraft, or sailcraft, named IKAROS completed a successful mission to Venus and proved the concept of solar sail propulsion. Sailcraft experimental data is difficult to gather due to the large expenses of space travel, therefore, a reliable and accurate computational method is needed to make the process more efficient. Presented in this document is a new approach to simulating solar sail spacecraft trajectories. The new method provides unconditionally stable numerical solutions for trajectory propagation and includes an improved physical description over other methods. The unconditional stability of the new method means that a unique numerical solution is always determined. The improved physical description of the trajectory provides a numerical solution and time derivatives that are continuous throughout the entire trajectory. The error of the continuous numerical solution is also known for the entire trajectory. Optimal control for maximizing thrust is also provided within the framework of the new method. Verification of the new approach is presented through a mathematical description and through numerical simulations. The mathematical description provides details of the sailcraft equations of motion, the numerical method used to solve the equations, and the formulation for implementing the equations of motion into the numerical solver. Previous work in the field is summarized to show that the new approach can act as a replacement to previous trajectory propagation methods. A code was developed to perform the simulations and it is also described in this document. Results of the simulations are compared to the flight data from the IKAROS mission. Comparison of the two sets of data show that the new approach is capable of accurately simulating sailcraft motion. Sailcraft and spacecraft simulations are compared to flight data and to other numerical solution techniques. The new formulation shows an increase in accuracy over a widely used trajectory propagation technique. Simulations for two-dimensional, three-dimensional, and variable attitude trajectories are presented to show the multiple capabilities of the new technique. An element of optimal control is also part of the new technique. An additional equation is added to the sailcraft equations of motion that maximizes thrust in a specific direction. A technical description and results of an example optimization problem are presented. The spacecraft attitude dynamics equations take the simulation a step further by providing control torques using the angular rate and acceleration outputs of the numerical formulation.

[Optimal scan parameters for a method of k-space trajectory (radial scan method) in evaluation of carotid plaque characteristics].

PubMed

Nakamura, Manami; Makabe, Takeshi; Tezuka, Hideomi; Miura, Takahiro; Umemura, Takuma; Sugimori, Hiroyuki; Sakata, Motomichi

2013-04-01

The purpose of this study was to optimize scan parameters for evaluation of carotid plaque characteristics by k-space trajectory (radial scan method), using a custom-made carotid plaque phantom. The phantom was composed of simulated sternocleidomastoid muscle and four types of carotid plaque. The effect of chemical shift artifact was compared using T1 weighted images (T1WI) of the phantom obtained with and without fat suppression, and using two types of k-space trajectory (the radial scan method and the Cartesian method). The ratio of signal intensity of simulated sternocleidomastoid muscle to the signal intensity of hematoma, blood (including heparin), lard, and mayonnaise was compared among various repetition times (TR) using T1WI and T2 weighted imaging (T2WI). In terms of chemical shift artifacts, image quality was improved using fat suppression for both the radial scan and Cartesian methods. In terms of signal ratio, the highest values were obtained for the radial scan method with TR of 500 ms for T1WI, and TR of 3000 ms for T2WI. For evaluation of carotid plaque characteristics using the radial scan method, chemical shift artifacts were reduced with fat suppression. Signal ratio was improved by optimizing the TR settings for T1WI and T2WI. These results suggest the potential for using magnetic resonance imaging for detailed evaluation of carotid plaque.

Solar Electric Propulsion Triple-Satellite-Aided Capture With Mars Flyby

NASA Astrophysics Data System (ADS)

Patrick, Sean

Triple-Satellite-aided-capture sequences use gravity-assists at three of Jupiter's four massive Galilean moons to reduce the DeltaV required to enter into Jupiter orbit. A triple-satellite-aided capture at Callisto, Ganymede, and Io is proposed to capture a SEP spacecraft into Jupiter orbit from an interplanetary Earth-Jupiter trajectory that employs low-thrust maneuvers. The principal advantage of this method is that it combines the ISP efficiency of ion propulsion with nearly impulsive but propellant-free gravity assists. For this thesis, two main chapters are devoted to the exploration of low-thrust triple-flyby capture trajectories. Specifically, the design and optimization of these trajectories are explored heavily. The first chapter explores the design of two solar electric propulsion (SEP), low-thrust trajectories developed using the JPL's MALTO software. The two trajectories combined represent a full Earth to Jupiter capture split into a heliocentric Earth to Jupiter Sphere of Influence (SOI) trajectory and a Joviocentric capture trajectory. The Joviocentric trajectory makes use of gravity assist flybys of Callisto, Ganymede, and Io to capture into Jupiter orbit with a period of 106.3 days. Following this, in chapter two, three more SEP low-thrust trajectories were developed based upon those in chapter one. These trajectories, devised using the high-fidelity Mystic software, also developed by JPL, improve upon the original trajectories developed in chapter one. Here, the developed trajectories are each three separate, full Earth to Jupiter capture orbits. As in chapter one, a Mars gravity assist is used to augment the heliocentric trajectories. Gravity-assist flybys of Callisto, Ganymede, and Io or Europa are used to capture into Jupiter Orbit. With between 89.8 and 137.2-day periods, the orbits developed in chapters one and two are shorter than most Jupiter capture orbits achieved using low-thrust propulsion techniques. Finally, chapter 3 presents an original trajectory design for a Very-Long-Baseline Interferometry (VLBI) satellite constellation. The design was created for the 8th Global Trajectory Optimization Competition (GTOC8) in which participants are tasked with creating and optimizing low-thrust trajectories to place a series of three space craft into formation to map given radio sources.

Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

NASA Astrophysics Data System (ADS)

Bulgakov, V. K.; Strigunov, V. V.

2009-05-01

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.

Trajectory Planning by Preserving Flexibility: Metrics and Analysis

NASA Technical Reports Server (NTRS)

Idris, Husni R.; El-Wakil, Tarek; Wing, David J.

2008-01-01

In order to support traffic management functions, such as mitigating traffic complexity, ground and airborne systems may benefit from preserving or optimizing trajectory flexibility. To help support this hypothesis trajectory flexibility metrics have been defined in previous work to represent the trajectory robustness and adaptability to the risk of violating safety and traffic management constraints. In this paper these metrics are instantiated in the case of planning a trajectory with the heading degree of freedom. A metric estimation method is presented based on simplifying assumptions, namely discrete time and heading maneuvers. A case is analyzed to demonstrate the estimation method and its use in trajectory planning in a situation involving meeting a time constraint and avoiding loss of separation with nearby traffic. The case involves comparing path-stretch trajectories, in terms of adaptability and robustness along each, deduced from a map of estimated flexibility metrics over the solution space. The case demonstrated anecdotally that preserving flexibility may result in enhancing certain factors that contribute to traffic complexity, namely reducing proximity and confrontation.

A trajectory planning scheme for spacecraft in the space station environment. M.S. Thesis - University of California

NASA Technical Reports Server (NTRS)

Soller, Jeffrey Alan; Grunwald, Arthur J.; Ellis, Stephen R.

1991-01-01

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

NASA Technical Reports Server (NTRS)

Englander, Jacob; Vavrina, Matthew; Ghosh, Alexander

2015-01-01

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.

Trajectory optimization for lunar rover performing vertical takeoff vertical landing maneuvers in the presence of terrain

NASA Astrophysics Data System (ADS)

Ma, Lin; Wang, Kexin; Xu, Zuhua; Shao, Zhijiang; Song, Zhengyu; Biegler, Lorenz T.

2018-05-01

This study presents a trajectory optimization framework for lunar rover performing vertical takeoff vertical landing (VTVL) maneuvers in the presence of terrain using variable-thrust propulsion. First, a VTVL trajectory optimization problem with three-dimensional kinematics and dynamics model, boundary conditions, and path constraints is formulated. Then, a finite-element approach transcribes the formulated trajectory optimization problem into a nonlinear programming (NLP) problem solved by a highly efficient NLP solver. A homotopy-based backtracking strategy is applied to enhance the convergence in solving the formulated VTVL trajectory optimization problem. The optimal thrust solution typically has a "bang-bang" profile considering that bounds are imposed on the magnitude of engine thrust. An adaptive mesh refinement strategy based on a constant Hamiltonian profile is designed to address the difficulty in locating the breakpoints in the thrust profile. Four scenarios are simulated. Simulation results indicate that the proposed trajectory optimization framework has sufficient adaptability to handle VTVL missions efficiently.

Optimal transfers between libration-point orbits in the elliptic restricted three-body problem

NASA Astrophysics Data System (ADS)

Hiday, Lisa Ann

1992-09-01

A strategy is formulated to design optimal impulsive transfers between three-dimensional libration-point orbits in the vicinity of the interior L(1) libration point of the Sun-Earth/Moon barycenter system. Two methods of constructing nominal transfers, for which the fuel cost is to be minimized, are developed; both inferior and superior transfers between two halo orbits are considered. The necessary conditions for an optimal transfer trajectory are stated in terms of the primer vector. The adjoint equation relating reference and perturbed trajectories in this formulation of the elliptic restricted three-body problem is shown to be distinctly different from that obtained in the analysis of trajectories in the two-body problem. Criteria are established whereby the cost on a nominal transfer can be improved by the addition of an interior impulse or by the implementation of coastal arcs in the initial and final orbits. The necessary conditions for the local optimality of a time-fixed transfer trajectory possessing additional impulses are satisfied by requiring continuity of the Hamiltonian and the derivative of the primer vector at all interior impulses. The optimality of a time-free transfer containing coastal arcs is surmised by examination of the slopes at the endpoints of a plot of the magnitude of the primer vector over the duration of the transfer path. If the initial and final slopes of the primer magnitude are zero, the transfer trajectory is optimal; otherwise, the execution of coasts is warranted. The position and timing of each interior impulse applied to a time-fixed transfer as well as the direction and length of coastal periods implemented on a time-free transfer are specified by the unconstrained minimization of the appropriate variation in cost utilizing a multivariable search technique. Although optimal solutions in some instances are elusive, the time-fixed and time-free optimization algorithms prove to be very successful in diminishing costs on nominal transfer trajectories. The inclusion of coastal arcs on time-free superior and inferior transfers results in significant modification of the transfer time of flight caused by shifts in departure and arrival locations on the halo orbits.

Coupled Low-thrust Trajectory and System Optimization via Multi-Objective Hybrid Optimal Control

NASA Technical Reports Server (NTRS)

Vavrina, Matthew A.; Englander, Jacob Aldo; Ghosh, Alexander R.

2015-01-01

The optimization of low-thrust trajectories is tightly coupled with the spacecraft hardware. Trading trajectory characteristics with system parameters ton identify viable solutions and determine mission sensitivities across discrete hardware configurations is labor intensive. Local independent optimization runs can sample the design space, but a global exploration that resolves the relationships between the system variables across multiple objectives enables a full mapping of the optimal solution space. A multi-objective, hybrid optimal control algorithm is formulated using a multi-objective genetic algorithm as an outer loop systems optimizer around a global trajectory optimizer. The coupled problem is solved simultaneously to generate Pareto-optimal solutions in a single execution. The automated approach is demonstrated on two boulder return missions.

Rapid Design of Gravity Assist Trajectories

NASA Technical Reports Server (NTRS)

Carrico, J.; Hooper, H. L.; Roszman, L.; Gramling, C.

1991-01-01

Several International Solar Terrestrial Physics (ISTP) missions require the design of complex gravity assisted trajectories in order to investigate the interaction of the solar wind with the Earth's magnetic field. These trajectories present a formidable trajectory design and optimization problem. The philosophy and methodology that enable an analyst to design and analyse such trajectories are discussed. The so called 'floating end point' targeting, which allows the inherently nonlinear multiple body problem to be solved with simple linear techniques, is described. The combination of floating end point targeting with analytic approximations with a Newton method targeter to achieve trajectory design goals quickly, even for the very sensitive double lunar swingby trajectories used by the ISTP missions, is demonstrated. A multiconic orbit integration scheme allows fast and accurate orbit propagation. A prototype software tool, Swingby, built for trajectory design and launch window analysis, is described.

New numerical methods for open-loop and feedback solutions to dynamic optimization problems

NASA Astrophysics Data System (ADS)

Ghosh, Pradipto

The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development is that the resulting control law has an algebraic closed-form structure. The proposed method uses an optimal spatial statistical predictor called universal kriging to construct the surrogate model of a feedback controller, which is capable of quickly predicting an optimal control estimate based on current state (and time) information. With universal kriging, an approximation to the optimal feedback map is computed by conceptualizing a set of state-control samples from pre-computed extremals to be a particular realization of a jointly Gaussian spatial process. Feedback policies are computed for a variety of example dynamic optimization problems in order to evaluate the effectiveness of this methodology. This feedback synthesis approach is found to combine good numerical accuracy with low computational overhead, making it a suitable candidate for real-time applications. Particle swarm and universal kriging are combined for a capstone example, a near optimal, near-admissible, full-state feedback control law is computed and tested for the heat-load-limited atmospheric-turn guidance of an aeroassisted transfer vehicle. The performance of this explicit guidance scheme is found to be very promising; initial errors in atmospheric entry due to simulated thruster misfirings are found to be accurately corrected while closely respecting the algebraic state-inequality constraint.

Enabling Parametric Optimal Ascent Trajectory Modeling During Early Phases of Design

NASA Technical Reports Server (NTRS)

Holt, James B.; Dees, Patrick D.; Diaz, Manuel J.

2015-01-01

During the early phases of engineering design, the costs committed are high, costs incurred are low, and the design freedom is high. It is well documented that decisions made in these early design phases drive the entire design's life cycle. In a traditional paradigm, key design decisions are made when little is known about the design. As the design matures, design changes become more difficult -- in both cost and schedule -- to enact. Indeed, the current capability-based paradigm that has emerged because of the constrained economic environment calls for the infusion of knowledge acquired during later design phases into earlier design phases, i.e. bring knowledge acquired during preliminary and detailed design into pre-conceptual and conceptual design. An area of critical importance to launch vehicle design is the optimization of its ascent trajectory, as the optimal trajectory will be able to take full advantage of the launch vehicle's capability to deliver a maximum amount of payload into orbit. Hence, the optimal ascent trajectory plays an important role in the vehicle's affordability posture as the need for more economically viable access to space solutions are needed in today's constrained economic environment. The problem of ascent trajectory optimization is not a new one. There are several programs that are widely used in industry that allows trajectory analysts to, based on detailed vehicle and insertion orbit parameters, determine the optimal ascent trajectory. Yet, little information is known about the launch vehicle early in the design phase - information that is required of many different disciplines in order to successfully optimize the ascent trajectory. Thus, the current paradigm of optimizing ascent trajectories involves generating point solutions for every change in a vehicle's design parameters. This is often a very tedious, manual, and time-consuming task for the analysts. Moreover, the trajectory design space is highly non-linear and multi-modal due to the interaction of various constraints. Additionally, when these obstacles are coupled with The Program to Optimize Simulated Trajectories [1] (POST), an industry standard program to optimize ascent trajectories that is difficult to use, it requires expert trajectory analysts to effectively optimize a vehicle's ascent trajectory. As it has been pointed out, the paradigm of trajectory optimization is still a very manual one because using modern computational resources on POST is still a challenging problem. The nuances and difficulties involved in correctly utilizing, and therefore automating, the program presents a large problem. In order to address these issues, the authors will discuss a methodology that has been developed. The methodology is two-fold: first, a set of heuristics will be introduced and discussed that were captured while working with expert analysts to replicate the current state-of-the-art; secondly, leveraging the power of modern computing to evaluate multiple trajectories simultaneously, and therefore, enable the exploration of the trajectory's design space early during the pre-conceptual and conceptual phases of design. When this methodology is coupled with design of experiments in order to train surrogate models, the authors were able to visualize the trajectory design space, enabling parametric optimal ascent trajectory information to be introduced with other pre-conceptual and conceptual design tools. The potential impact of this methodology's success would be a fully automated POST evaluation suite for the purpose of conceptual and preliminary design trade studies. This will enable engineers to characterize the ascent trajectory's sensitivity to design changes in an arbitrary number of dimensions and for finding settings for trajectory specific variables, which result in optimal performance for a "dialed-in" launch vehicle design. The effort described in this paper was developed for the Advanced Concepts Office [2] at NASA Marshall Space Flight Center

SRM-Assisted Trajectory for the GTX Reference Vehicle

NASA Technical Reports Server (NTRS)

Riehl, John; Trefny, Charles; Kosareo, Daniel

2002-01-01

A goal of the GTX effort has been to demonstrate the feasibility of a single stage- to- orbit (SSTO) vehicle that delivers a small payload to low earth orbit. The small payload class was chosen in order to minimize the risk and cost of development of this revolutionary system. A preliminary design study by the GTX team has resulted in the current configuration that offers considerable promise for meeting the stated goal. The size and gross lift-off weight resulting from scaling the current design to closure however may be considered impractical for the small payload. In lieu of evolving the project's reference vehicle to a large-payload class, this paper offers the alternative of using solid-rocket motors in order to close the vehicle at a practical scale. This approach offers a near-term, quasi-reusable system that easily evolves to reusable SSTO following subsequent development and optimization. This paper presents an overview of the impact of the addition of SRM's to the GTX reference vehicle's performance and trajectory. The overall methods of vehicle modeling and trajectory optimization will also be presented. A key element in the trajectory optimization is the use of the program OTIS 3.10 that provides rapid convergence and a great deal of flexibility to the user. This paper will also present the methods used to implement GTX requirements into OTIS modeling.

SRM-Assisted Trajectory for the GTX Reference Vehicle

NASA Technical Reports Server (NTRS)

Riehl, John; Trefny, Charles; Kosareo, Daniel (Technical Monitor)

2002-01-01

A goal of the GTX effort has been to demonstrate the feasibility of a single stage-to-orbit (SSTO) vehicle that delivers a small payload to low earth orbit. The small payload class was chosen in order to minimize the risk and cost of development of this revolutionary system. A preliminary design study by the GTX team has resulted in the current configuration that offers considerable promise for meeting the stated goal. The size and gross lift-off weight resulting from scaling the current design to closure however may be considered impractical for the small payload. In lieu of evolving the project' reference vehicle to a large-payload class, this paper offers the alternative of using solid-rocket motors in order to close the vehicle at a practical scale. This approach offers a near-term, quasi-reusable system that easily evolves to reusable SSTO following subsequent development and optimization. This paper presents an overview of the impact of the addition of SRM's to the GTX reference vehicle#s performance and trajectory. The overall methods of vehicle modeling and trajectory optimization will also be presented. A key element in the trajectory optimization is the use of the program OTIS 3.10 that provides rapid convergence and a great deal of flexibility to the user. This paper will also present the methods used to implement GTX requirements into OTIS modeling.

Optimal design of near-Earth asteroid sample-return trajectories in the Sun-Earth-Moon system

NASA Astrophysics Data System (ADS)

He, Shengmao; Zhu, Zhengfan; Peng, Chao; Ma, Jian; Zhu, Xiaolong; Gao, Yang

2016-08-01

In the 6th edition of the Chinese Space Trajectory Design Competition held in 2014, a near-Earth asteroid sample-return trajectory design problem was released, in which the motion of the spacecraft is modeled in multi-body dynamics, considering the gravitational forces of the Sun, Earth, and Moon. It is proposed that an electric-propulsion spacecraft initially parking in a circular 200-km-altitude low Earth orbit is expected to rendezvous with an asteroid and carry as much sample as possible back to the Earth in a 10-year time frame. The team from the Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences has reported a solution with an asteroid sample mass of 328 tons, which is ranked first in the competition. In this article, we will present our design and optimization methods, primarily including overall analysis, target selection, escape from and capture by the Earth-Moon system, and optimization of impulsive and low-thrust trajectories that are modeled in multi-body dynamics. The orbital resonance concept and lunar gravity assists are considered key techniques employed for trajectory design. The reported solution, preliminarily revealing the feasibility of returning a hundreds-of-tons asteroid or asteroid sample, envisions future space missions relating to near-Earth asteroid exploration.

Point-Mass Aircraft Trajectory Prediction Using a Hierarchical, Highly-Adaptable Software Design

NASA Technical Reports Server (NTRS)

Karr, David A.; Vivona, Robert A.; Woods, Sharon E.; Wing, David J.

2017-01-01

A highly adaptable and extensible method for predicting four-dimensional trajectories of civil aircraft has been developed. This method, Behavior-Based Trajectory Prediction, is based on taxonomic concepts developed for the description and comparison of trajectory prediction software. A hierarchical approach to the "behavioral" layer of a point-mass model of aircraft flight, a clear separation between the "behavioral" and "mathematical" layers of the model, and an abstraction of the methods of integrating differential equations in the "mathematical" layer have been demonstrated to support aircraft models of different types (in particular, turbojet vs. turboprop aircraft) using performance models at different levels of detail and in different formats, and promise to be easily extensible to other aircraft types and sources of data. The resulting trajectories predict location, altitude, lateral and vertical speeds, and fuel consumption along the flight path of the subject aircraft accurately and quickly, accounting for local conditions of wind and outside air temperature. The Behavior-Based Trajectory Prediction concept was implemented in NASA's Traffic Aware Planner (TAP) flight-optimizing cockpit software application.

Program to Optimize Simulated Trajectories (POST). Volume 2: Utilization manual

NASA Technical Reports Server (NTRS)

Bauer, G. L.; Cornick, D. E.; Habeger, A. R.; Petersen, F. M.; Stevenson, R.

1975-01-01

Information pertinent to users of the program to optimize simulated trajectories (POST) is presented. The input required and output available is described for each of the trajectory and targeting/optimization options. A sample input listing and resulting output are given.

An inverse dynamics approach to trajectory optimization for an aerospace plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1992-01-01

An inverse dynamics approach for trajectory optimization is proposed. This technique can be useful in many difficult trajectory optimization and control problems. The application of the approach is exemplified by ascent trajectory optimization for an aerospace plane. Both minimum-fuel and minimax types of performance indices are considered. When rocket augmentation is available for ascent, it is shown that accurate orbital insertion can be achieved through the inverse control of the rocket in the presence of disturbances.

Optimal weight based on energy imbalance and utility maximization

NASA Astrophysics Data System (ADS)

Sun, Ruoyan

2016-01-01

This paper investigates the optimal weight for both male and female using energy imbalance and utility maximization. Based on the difference of energy intake and expenditure, we develop a state equation that reveals the weight gain from this energy gap. We ​construct an objective function considering food consumption, eating habits and survival rate to measure utility. Through applying mathematical tools from optimal control methods and qualitative theory of differential equations, we obtain some results. For both male and female, the optimal weight is larger than the physiologically optimal weight calculated by the Body Mass Index (BMI). We also study the corresponding trajectories to steady state weight respectively. Depending on the value of a few parameters, the steady state can either be a saddle point with a monotonic trajectory or a focus with dampened oscillations.

Noncoplanar VMAT for nasopharyngeal tumors: Plan quality versus treatment time

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wild, Esther, E-mail: e.wild@dkfz.de; Bangert, Mark; Nill, Simeon

Purpose: The authors investigated the potential of optimized noncoplanar irradiation trajectories for volumetric modulated arc therapy (VMAT) treatments of nasopharyngeal patients and studied the trade-off between treatment plan quality and delivery time in radiation therapy. Methods: For three nasopharyngeal patients, the authors generated treatment plans for nine different delivery scenarios using dedicated optimization methods. They compared these scenarios according to dose characteristics, number of beam directions, and estimated delivery times. In particular, the authors generated the following treatment plans: (1) a 4π plan, which is a not sequenced, fluence optimized plan that uses beam directions from approximately 1400 noncoplanar directionsmore » and marks a theoretical upper limit of the treatment plan quality, (2) a coplanar 2π plan with 72 coplanar beam directions as pendant to the noncoplanar 4π plan, (3) a coplanar VMAT plan, (4) a coplanar step and shoot (SnS) plan, (5) a beam angle optimized (BAO) coplanar SnS IMRT plan, (6) a noncoplanar BAO SnS plan, (7) a VMAT plan with rotated treatment couch, (8) a noncoplanar VMAT plan with an optimized great circle around the patient, and (9) a noncoplanar BAO VMAT plan with an arbitrary trajectory around the patient. Results: VMAT using optimized noncoplanar irradiation trajectories reduced the mean and maximum doses in organs at risk compared to coplanar VMAT plans by 19% on average while the target coverage remains constant. A coplanar BAO SnS plan was superior to coplanar SnS or VMAT; however, noncoplanar plans like a noncoplanar BAO SnS plan or noncoplanar VMAT yielded a better plan quality than the best coplanar 2π plan. The treatment plan quality of VMAT plans depended on the length of the trajectory. The delivery times of noncoplanar VMAT plans were estimated to be 6.5 min in average; 1.6 min longer than a coplanar plan but on average 2.8 min faster than a noncoplanar SnS plan with comparable treatment plan quality. Conclusions: The authors’ study reconfirms the dosimetric benefits of noncoplanar irradiation of nasopharyngeal tumors. Both SnS using optimized noncoplanar beam ensembles and VMAT using an optimized, arbitrary, noncoplanar trajectory enabled dose reductions in organs at risk compared to coplanar SnS and VMAT. Using great circles or simple couch rotations to implement noncoplanar VMAT, however, was not sufficient to yield meaningful improvements in treatment plan quality. The authors estimate that noncoplanar VMAT using arbitrary optimized irradiation trajectories comes at an increased delivery time compared to coplanar VMAT yet at a decreased delivery time compared to noncoplanar SnS IMRT.« less

Pitch Guidance Optimization for the Orion Abort Flight Tests

NASA Technical Reports Server (NTRS)

Stillwater, Ryan Allanque

2010-01-01

The National Aeronautics and Space Administration created the Constellation program to develop the next generation of manned space vehicles and launch vehicles. The Orion abort system is initiated in the event of an unsafe condition during launch. The system has a controller gains schedule that can be tuned to reduce the attitude errors between the simulated Orion abort trajectories and the guidance trajectory. A program was created that uses the method of steepest descent to tune the pitch gains schedule by an automated procedure. The gains schedule optimization was applied to three potential abort scenarios; each scenario tested using the optimized gains schedule resulted in reduced attitude errors when compared to the Orion production gains schedule.

Deconflicting Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace

NASA Technical Reports Server (NTRS)

Rodionova, Olga; Delahaye, Daniel; Sridhar, Banavar; Ng, Hok K.

2016-01-01

North Atlantic oceanic airspace accommodates more than 1000 flights daily, and is subjected to very strong winds. Flying wind-optimal trajectories yields time and fuel savings for each individual flight. However, when taken together, these trajectories induce a large amount of potential en-route conflicts. This paper analyses the detected conflicts, figuring out conflict distribution in time and space. It further describes an optimization algorithm aimed at reducing the number of conflicts for a daily set of flights on strategic level. Several trajectory modification strategies are discussed, followed with simulation results. Finally, an algorithm improvement is presented aiming at better preserving the trajectory optimality.

New trends in astrodynamics and applications: optimal trajectories for space guidance.

PubMed

Azimov, Dilmurat; Bishop, Robert

2005-12-01

This paper represents recent results on the development of optimal analytic solutions to the variation problem of trajectory optimization and their application in the construction of on-board guidance laws. The importance of employing the analytically integrated trajectories in a mission design is discussed. It is assumed that the spacecraft is equipped with a power-limited propulsion and moving in a central Newtonian field. Satisfaction of the necessary and sufficient conditions for optimality of trajectories is analyzed. All possible thrust arcs and corresponding classes of the analytical solutions are classified based on the propulsion system parameters and performance index of the problem. The solutions are presented in a form convenient for applications in escape, capture, and interorbital transfer problems. Optimal guidance and neighboring optimal guidance problems are considered. It is shown that the analytic solutions can be used as reference trajectories in constructing the guidance algorithms for the maneuver problems mentioned above. An illustrative example of a spiral trajectory that terminates on a given elliptical parking orbit is discussed.

Optimal cooperative time-fixed impulsive rendezvous

NASA Technical Reports Server (NTRS)

Mirfakhraie, Koorosh; Conway, Bruce A.; Prussing, John E.

1988-01-01

A method has been developed for determining optimal, i.e., minimum fuel, trajectories for the fixed-time cooperative rendezvous of two spacecraft. The method presently assumes that the vehicles perform a total of three impulsive maneuvers with each vehicle being active, that is, making at least one maneuver. The cost of a feasible 'reference' trajectory is improved by an optimizer which uses an analytical gradient developed using primer vector theory and a new solution for the optimal terminal (rendezvous) maneuver. Results are presented for a large number of cases in which the initial orbits of both vehicles are circular but in which the initial positions of the vehicles and the allotted time for rendezvous are varied. In general, the cost of the cooperative rendezvous is less than that of rendezvous with one vehicle passive. Further improvement in cost may be obtained in the future when additional, i.e., midcourse, impulses are allowed and inserted as indicated for some cases by the primer vector histories which are generated by the program.

Program to Optimize Simulated Trajectories (POST). Volume 1: Formulation manual

NASA Technical Reports Server (NTRS)

Brauer, G. L.; Cornick, D. E.; Habeger, A. R.; Petersen, F. M.; Stevenson, R.

1975-01-01

A general purpose FORTRAN program for simulating and optimizing point mass trajectories (POST) of aerospace vehicles is described. The equations and the numerical techniques used in the program are documented. Topics discussed include: coordinate systems, planet model, trajectory simulation, auxiliary calculations, and targeting and optimization.

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

NASA Technical Reports Server (NTRS)

Pinson, Robin M.; Lu, Ping

2016-01-01

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on- board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles. There are two previous studies that form the background to the current investigation. The first set looked in-depth at applying convex optimization to a powered descent trajectory on Mars with promising results.1, 2 This showed that the powered descent equations of motion can be relaxed and formed into a convex optimization problem and that the optimal solution of the relaxed problem is indeed a feasible solution to the original problem. This analysis used a constant gravity field. The second area applied a successive solution process to formulate a second order cone program that designs rendezvous and proximity operations trajectories.3, 4 These trajectories included a Newtonian gravity model. The equivalence of the solutions between the relaxed and the original problem is theoretically established. The proposed solution for designing the asteroid powered descent trajectory is to use convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process to design the fuel optimal trajectory. The solution to the convex optimization problem is the thrust profile, magnitude and direction, that will yield the minimum fuel trajectory for a soft landing at the target site, subject to various mission and operational constraints. The equations of motion are formulated in a rotating coordinate system and includes a high fidelity gravity model. The vehicle's thrust magnitude can vary between maximum and minimum bounds during the burn. Also, constraints are included to ensure that the vehicle does not run out of propellant, or go below the asteroid's surface, and any vehicle pointing requirements. The equations of motion are discretized and propagated with the trapezoidal rule in order to produce equality constraints for the optimization problem. These equality constraints allow the optimization algorithm to solve the entire problem, without including a propagator inside the optimization algorithm.

Optimized x-ray source scanning trajectories for iterative reconstruction in high cone-angle tomography

NASA Astrophysics Data System (ADS)

Kingston, Andrew M.; Myers, Glenn R.; Latham, Shane J.; Li, Heyang; Veldkamp, Jan P.; Sheppard, Adrian P.

2016-10-01

With the GPU computing becoming main-stream, iterative tomographic reconstruction (IR) is becoming a com- putationally viable alternative to traditional single-shot analytical methods such as filtered back-projection. IR liberates one from the continuous X-ray source trajectories required for analytical reconstruction. We present a family of novel X-ray source trajectories for large-angle CBCT. These discrete (sparsely sampled) trajectories optimally fill the space of possible source locations by maximising the degree of mutually independent information. They satisfy a discrete equivalent of Tuy's sufficiency condition and allow high cone-angle (high-flux) tomog- raphy. The highly isotropic nature of the trajectory has several advantages: (1) The average source distance is approximately constant throughout the reconstruction volume, thus avoiding the differential-magnification artefacts that plague high cone-angle helical computed tomography; (2) Reduced streaking artifacts due to e.g. X-ray beam-hardening; (3) Misalignment and component motion manifests as blur in the tomogram rather than double-edges, which is easier to automatically correct; (4) An approximately shift-invariant point-spread-function which enables filtering as a pre-conditioner to speed IR convergence. We describe these space-filling trajectories and demonstrate their above-mentioned properties compared with a traditional helical trajectories.

Optimal lifting ascent trajectories for the space shuttle

NASA Technical Reports Server (NTRS)

Rau, T. R.; Elliott, J. R.

1972-01-01

The performance gains which are possible through the use of optimal trajectories for a particular space shuttle configuration are discussed. The spacecraft configurations and aerodynamic characteristics are described. Shuttle mission payload capability is examined with respect to the optimal orbit inclination for unconstrained, constrained, and nonlifting conditions. The effects of velocity loss and heating rate on the optimal ascent trajectory are investigated.

Particle swarm optimization of ascent trajectories of multistage launch vehicles

NASA Astrophysics Data System (ADS)

Pontani, Mauro

2014-02-01

Multistage launch vehicles are commonly employed to place spacecraft and satellites in their operational orbits. If the rocket characteristics are specified, the optimization of its ascending trajectory consists of determining the optimal control law that leads to maximizing the final mass at orbit injection. The numerical solution of a similar problem is not trivial and has been pursued with different methods, for decades. This paper is concerned with an original approach based on the joint use of swarming theory and the necessary conditions for optimality. The particle swarm optimization technique represents a heuristic population-based optimization method inspired by the natural motion of bird flocks. Each individual (or particle) that composes the swarm corresponds to a solution of the problem and is associated with a position and a velocity vector. The formula for velocity updating is the core of the method and is composed of three terms with stochastic weights. As a result, the population migrates toward different regions of the search space taking advantage of the mechanism of information sharing that affects the overall swarm dynamics. At the end of the process the best particle is selected and corresponds to the optimal solution to the problem of interest. In this work the three-dimensional trajectory of the multistage rocket is assumed to be composed of four arcs: (i) first stage propulsion, (ii) second stage propulsion, (iii) coast arc (after release of the second stage), and (iv) third stage propulsion. The Euler-Lagrange equations and the Pontryagin minimum principle, in conjunction with the Weierstrass-Erdmann corner conditions, are employed to express the thrust angles as functions of the adjoint variables conjugate to the dynamics equations. The use of these analytical conditions coming from the calculus of variations leads to obtaining the overall rocket dynamics as a function of seven parameters only, namely the unknown values of the initial state and costate components, the coast duration, and the upper stage thrust duration. In addition, a simple approach is introduced and successfully applied with the purpose of satisfying exactly the path constraint related to the maximum dynamical pressure in the atmospheric phase. The basic version of the swarming technique, which is used in this research, is extremely simple and easy to program. Nevertheless, the algorithm proves to be capable of yielding the optimal rocket trajectory with a very satisfactory numerical accuracy.

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

NASA Technical Reports Server (NTRS)

Englander, Jacob

2015-01-01

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.

Multi-Objective Hybrid Optimal Control for Interplanetary Mission Planning

NASA Technical Reports Server (NTRS)

Englander, Jacob A.

2014-01-01

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.

Terminal altitude maximization for Mars entry considering uncertainties

NASA Astrophysics Data System (ADS)

Cui, Pingyuan; Zhao, Zeduan; Yu, Zhengshi; Dai, Juan

2018-04-01

Uncertainties present in the Mars atmospheric entry process may cause state deviations from the nominal designed values, which will lead to unexpected performance degradation if the trajectory is designed merely based on the deterministic dynamic model. In this paper, a linear covariance based entry trajectory optimization method is proposed considering the uncertainties presenting in the initial states and parameters. By extending the elements of the state covariance matrix as augmented states, the statistical behavior of the trajectory is captured to reformulate the performance metrics and path constraints. The optimization problem is solved by the GPOPS-II toolbox in MATLAB environment. Monte Carlo simulations are also conducted to demonstrate the capability of the proposed method. Primary trading performances between the nominal deployment altitude and its dispersion can be observed by modulating the weights on the dispersion penalty, and a compromised result referring to maximizing the 3σ lower bound of the terminal altitude is achieved. The resulting path constraints also show better satisfaction in a disturbed environment compared with the nominal situation.

Statistically optimal analysis of state-discretized trajectory data from multiple thermodynamic states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Hao; Mey, Antonia S. J. S.; Noé, Frank

2014-12-07

We propose a discrete transition-based reweighting analysis method (dTRAM) for analyzing configuration-space-discretized simulation trajectories produced at different thermodynamic states (temperatures, Hamiltonians, etc.) dTRAM provides maximum-likelihood estimates of stationary quantities (probabilities, free energies, expectation values) at any thermodynamic state. In contrast to the weighted histogram analysis method (WHAM), dTRAM does not require data to be sampled from global equilibrium, and can thus produce superior estimates for enhanced sampling data such as parallel/simulated tempering, replica exchange, umbrella sampling, or metadynamics. In addition, dTRAM provides optimal estimates of Markov state models (MSMs) from the discretized state-space trajectories at all thermodynamic states. Under suitablemore » conditions, these MSMs can be used to calculate kinetic quantities (e.g., rates, timescales). In the limit of a single thermodynamic state, dTRAM estimates a maximum likelihood reversible MSM, while in the limit of uncorrelated sampling data, dTRAM is identical to WHAM. dTRAM is thus a generalization to both estimators.« less

Application of Metaheuristic and Deterministic Algorithms for Aircraft Reference Trajectory Optimization =

NASA Astrophysics Data System (ADS)

Murrieta Mendoza, Alejandro

Aircraft reference trajectory is an alternative method to reduce fuel consumption, thus the pollution released to the atmosphere. Fuel consumption reduction is of special importance for two reasons: first, because the aeronautical industry is responsible of 2% of the CO2 released to the atmosphere, and second, because it will reduce the flight cost. The aircraft fuel model was obtained from a numerical performance database which was created and validated by our industrial partner from flight experimental test data. A new methodology using the numerical database was proposed in this thesis to compute the fuel burn for a given trajectory. Weather parameters such as wind and temperature were taken into account as they have an important effect in fuel burn. The open source model used to obtain the weather forecast was provided by Weather Canada. A combination of linear and bi-linear interpolations allowed finding the required weather data. The search space was modelled using different graphs: one graph was used for mapping the different flight phases such as climb, cruise and descent, and another graph was used for mapping the physical space in which the aircraft would perform its flight. The trajectory was optimized in its vertical reference trajectory using the Beam Search algorithm, and a combination of the Beam Search algorithm with a search space reduction technique. The trajectory was optimized simultaneously for the vertical and lateral reference navigation plans while fulfilling a Required Time of Arrival constraint using three different metaheuristic algorithms: the artificial bee's colony, and the ant colony optimization. Results were validated using the software FlightSIMRTM, a commercial Flight Management System, an exhaustive search algorithm, and as flown flights obtained from flightawareRTM. All algorithms were able to reduce the fuel burn, and the flight costs. None None None None None None None

Trajectory Control and Optimization for Responsive Spacecraft

DTIC Science & Technology

2012-03-22

Orbital Elements and Local-Vertical-Local-Horizontal Frame 10 2.3 Equinoctial Frame with respect to ECI Frame [17] . . . . . . . . . 14 3.1...position and velocity, classical orbital elements , and equinoctial elements . These methods are detailed in the following sections. 2.1.1 Inertial Position...trajectory. However, if the singularities are unavoidable equinoctial orbital elements could be used. 2.1.3 Equinoctial Elements . Equinoctial

A Calibration of the MeteoSwiss RAman Lidar for Meteorological Observations (RALMO)Water Vapour Mixing Ratio Measurements using a Radiosonde Trajectory Method

NASA Astrophysics Data System (ADS)

Hicks-Jalali, Shannon; Sica, R. J.; Haefele, Alexander; Martucci, Giovanni

2018-04-01

With only 50% downtime from 2007-2016, the RALMO lidar in Payerne, Switzerland, has one of the largest continuous lidar data sets available. These measurements will be used to produce an extensive lidar water vapour climatology using the Optimal Estimation Method introduced by Sica and Haefele (2016). We will compare our improved technique for external calibration using radiosonde trajectories with the standard external methods, and present the evolution of the lidar constant from 2007 to 2016.

Automation of On-Board Flightpath Management

NASA Technical Reports Server (NTRS)

Erzberger, H.

1981-01-01

The status of concepts and techniques for the design of onboard flight path management systems is reviewed. Such systems are designed to increase flight efficiency and safety by automating the optimization of flight procedures onboard aircraft. After a brief review of the origins and functions of such systems, two complementary methods are described for attacking the key design problem, namely, the synthesis of efficient trajectories. One method optimizes en route, the other optimizes terminal area flight; both methods are rooted in optimal control theory. Simulation and flight test results are reviewed to illustrate the potential of these systems for fuel and cost savings.

Optimization and guidance of flight trajectories for the national aerospace plane

NASA Technical Reports Server (NTRS)

Miele, Angelo

1990-01-01

The research on optimal trajectories for the National Aerospace Plane (NASP) performed by the Aero-Astronautics Group of Rice University from June 22, 1989 to December 31, 1990 is summarized. The aerospace plane is assumed to be controlled via the angle of attack and the power setting. The time history of the controls is optimized simultaneously with the switch times from one powerplant to another and the final time. The intent is to arrive at NASP guidance trajectories exhibiting many of the desirable characteristics of NASP optimal trajectories.

Design Tool Using a New Optimization Method Based on a Stochastic Process

NASA Astrophysics Data System (ADS)

Yoshida, Hiroaki; Yamaguchi, Katsuhito; Ishikawa, Yoshio

Conventional optimization methods are based on a deterministic approach since their purpose is to find out an exact solution. However, such methods have initial condition dependence and the risk of falling into local solution. In this paper, we propose a new optimization method based on the concept of path integrals used in quantum mechanics. The method obtains a solution as an expected value (stochastic average) using a stochastic process. The advantages of this method are that it is not affected by initial conditions and does not require techniques based on experiences. We applied the new optimization method to a hang glider design. In this problem, both the hang glider design and its flight trajectory were optimized. The numerical calculation results prove that performance of the method is sufficient for practical use.

On the characteristics of optimal transfers

NASA Astrophysics Data System (ADS)

Iorfida, Elisabetta

In the past 50 years the scientists have been developing and analysing methods and new algorithms that optimise an interplanetary trajectory according to one or more objectives. Within this field, in 1963 Lawden derived, from Pontryagin's minimum principle, the so-called `primer vector theory'. The main goal of this thesis is to develop a theoretical understanding of Lawden's theory, getting an insight into the optimality of a trajectory when mid-course corrections need to be applied. The novelty of the research is represented by a different approach to the primer vector theory, which simplifies the structure of the problem.

Trajectory optimization for dynamic couch rotation during volumetric modulated arc radiotherapy

NASA Astrophysics Data System (ADS)

Smyth, Gregory; Bamber, Jeffrey C.; Evans, Philip M.; Bedford, James L.

2013-11-01

Non-coplanar radiation beams are often used in three-dimensional conformal and intensity modulated radiotherapy to reduce dose to organs at risk (OAR) by geometric avoidance. In volumetric modulated arc radiotherapy (VMAT) non-coplanar geometries are generally achieved by applying patient couch rotations to single or multiple full or partial arcs. This paper presents a trajectory optimization method for a non-coplanar technique, dynamic couch rotation during VMAT (DCR-VMAT), which combines ray tracing with a graph search algorithm. Four clinical test cases (partial breast, brain, prostate only, and prostate and pelvic nodes) were used to evaluate the potential OAR sparing for trajectory-optimized DCR-VMAT plans, compared with standard coplanar VMAT. In each case, ray tracing was performed and a cost map reflecting the number of OAR voxels intersected for each potential source position was generated. The least-cost path through the cost map, corresponding to an optimal DCR-VMAT trajectory, was determined using Dijkstra’s algorithm. Results show that trajectory optimization can reduce dose to specified OARs for plans otherwise comparable to conventional coplanar VMAT techniques. For the partial breast case, the mean heart dose was reduced by 53%. In the brain case, the maximum lens doses were reduced by 61% (left) and 77% (right) and the globes by 37% (left) and 40% (right). Bowel mean dose was reduced by 15% in the prostate only case. For the prostate and pelvic nodes case, the bowel V50 Gy and V60 Gy were reduced by 9% and 45% respectively. Future work will involve further development of the algorithm and assessment of its performance over a larger number of cases in site-specific cohorts.

Conflict Resolution for Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace with Wind Uncertainties

NASA Technical Reports Server (NTRS)

Rodionova, Olga; Sridhar, Banavar; Ng, Hok K.

2016-01-01

Air traffic in the North Atlantic oceanic airspace (NAT) experiences very strong winds caused by jet streams. Flying wind-optimal trajectories increases individual flight efficiency, which is advantageous when operating in the NAT. However, as the NAT is highly congested during peak hours, a large number of potential conflicts between flights are detected for the sets of wind-optimal trajectories. Conflict resolution performed at the strategic level of flight planning can significantly reduce the airspace congestion. However, being completed far in advance, strategic planning can only use predicted environmental conditions that may significantly differ from the real conditions experienced further by aircraft. The forecast uncertainties result in uncertainties in conflict prediction, and thus, conflict resolution becomes less efficient. This work considers wind uncertainties in order to improve the robustness of conflict resolution in the NAT. First, the influence of wind uncertainties on conflict prediction is investigated. Then, conflict resolution methods accounting for wind uncertainties are proposed.

A new method to calibrate Lagrangian model with ASAR images for oil slick trajectory.

PubMed

Tian, Siyu; Huang, Xiaoxia; Li, Hongga

2017-03-15

Since Lagrangian model coefficients vary with different conditions, it is necessary to calibrate the model to obtain optimal coefficient combination for special oil spill accident. This paper focuses on proposing a new method to calibrate Lagrangian model with time series of Envisat ASAR images. Oil slicks extracted from time series images form a detected trajectory of special oil slick. Lagrangian model is calibrated by minimizing the difference between simulated trajectory and detected trajectory. mean center position distance difference (MCPD) and rotation difference (RD) of Oil slicks' or particles' standard deviational ellipses (SDEs) are calculated as two evaluations. The two parameters are taken to evaluate the performance of Lagrangian transport model with different coefficient combinations. This method is applied to Penglai 19-3 oil spill accident. The simulation result with calibrated model agrees well with related satellite observations. It is suggested the new method is effective to calibrate Lagrangian model. Copyright © 2016 Elsevier Ltd. All rights reserved.

Hybrid Differential Dynamic Programming with Stochastic Search

NASA Technical Reports Server (NTRS)

Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob

2016-01-01

Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASAs Dawn mission. The Dawn trajectory was designed with the DDP-based Static Dynamic Optimal Control algorithm used in the Mystic software. Another recently developed method, Hybrid Differential Dynamic Programming (HDDP) is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.

Preliminary Analysis of Low-Thrust Gravity Assist Trajectories by An Inverse Method and a Global Optimization Technique.

NASA Astrophysics Data System (ADS)

de Pascale, P.; Vasile, M.; Casotto, S.

The design of interplanetary trajectories requires the solution of an optimization problem, which has been traditionally solved by resorting to various local optimization techniques. All such approaches, apart from the specific method employed (direct or indirect), require an initial guess, which deeply influences the convergence to the optimal solution. The recent developments in low-thrust propulsion have widened the perspectives of exploration of the Solar System, while they have at the same time increased the difficulty related to the trajectory design process. Continuous thrust transfers, typically characterized by multiple spiraling arcs, have a broad number of design parameters and thanks to the flexibility offered by such engines, they typically turn out to be characterized by a multi-modal domain, with a consequent larger number of optimal solutions. Thus the definition of the first guesses is even more challenging, particularly for a broad search over the design parameters, and it requires an extensive investigation of the domain in order to locate the largest number of optimal candidate solutions and possibly the global optimal one. In this paper a tool for the preliminary definition of interplanetary transfers with coast-thrust arcs and multiple swing-bys is presented. Such goal is achieved combining a novel methodology for the description of low-thrust arcs, with a global optimization algorithm based on a hybridization of an evolutionary step and a deterministic step. Low thrust arcs are described in a 3D model in order to account the beneficial effects of low-thrust propulsion for a change of inclination, resorting to a new methodology based on an inverse method. The two-point boundary values problem (TPBVP) associated with a thrust arc is solved by imposing a proper parameterized evolution of the orbital parameters, by which, the acceleration required to follow the given trajectory with respect to the constraints set is obtained simply through algebraic computation. By this method a low-thrust transfer satisfying the boundary conditions on position and velocity can be quickly assessed, with low computational effort since no numerical propagation is required. The hybrid global optimization algorithm is made of a double step. Through the evolutionary search a large number of optima, and eventually the global one, are located, while the deterministic step consists of a branching process that exhaustively partitions the domain in order to have an extensive characterization of such a complex space of solutions. Furthermore, the approach implements a novel direct constraint-handling technique allowing the treatment of mixed-integer nonlinear programming problems (MINLP) typical of multiple swingby trajectories. A low-thrust transfer to Mars is studied as a test bed for the low-thrust model, thus presenting the main characteristics of the different shapes proposed and the features of the possible sub-arcs segmentations between two planets with respect to different objective functions: minimum time and minimum fuel consumption transfers. Other various test cases are also shown and further optimized, proving the effective capability of the proposed tool.

Ascent trajectory optimization for stratospheric airship with thermal effects

NASA Astrophysics Data System (ADS)

Guo, Xiao; Zhu, Ming

2013-09-01

Ascent trajectory optimization with thermal effects is addressed for a stratospheric airship. Basic thermal characteristics of the stratospheric airship are introduced. Besides, the airship’s equations of motion are constructed by including the factors about aerodynamic force, added mass and wind profiles which are developed based on horizontal-wind model. For both minimum-time and minimum-energy flights during ascent, the trajectory optimization problem is described with the path and terminal constraints in different scenarios and then, is converted into a parameter optimization problem by a direct collocation method. Sparse Nonlinear OPTimizer(SNOPT) is employed as a nonlinear programming solver and two scenarios are adopted. The solutions obtained illustrate that the trajectories are greatly affected by the thermal behaviors which prolong the daytime minimum-time flights of about 20.8% compared with that of nighttime in scenario 1 and of about 10.5% in scenario 2. And there is the same trend for minimum-energy flights. For the energy consumption of minimum-time flights, 6% decrease is abstained in scenario 1 and 5% decrease in scenario 2. However, a few energy consumption reduction is achieved for minimum-energy flights. Solar radiation is the principal component and the natural wind also affects the thermal behaviors of stratospheric airship during ascent. The relationship between take-off time and performance of airship during ascent is discussed. it is found that the take-off time at dusk is best choice for stratospheric airship. And in addition, for saving energy, airship prefers to fly downwind.

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

NASA Technical Reports Server (NTRS)

Englander, Jacob A.; Vavrina, Matthew A.; Ghosh, Alexander R.

2015-01-01

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.

Space Shuttle Day-of-Launch Trajectory Design and Verification

NASA Technical Reports Server (NTRS)

Harrington, Brian E.

2010-01-01

A top priority of any launch vehicle is to insert as much mass into the desired orbit as possible. This requirement must be traded against vehicle capability in terms of dynamic control, thermal constraints, and structural margins. The vehicle is certified to a specific structural envelope which will yield certain performance characteristics of mass to orbit. Some envelopes cannot be certified generically and must be checked with each mission design. The most sensitive envelopes require an assessment on the day-of-launch. To further minimize vehicle loads while maximizing vehicle performance, a day-of-launch trajectory can be designed. This design is optimized according to that day s wind and atmospheric conditions, which will increase the probability of launch. The day-of-launch trajectory verification is critical to the vehicle's safety. The Day-Of-Launch I-Load Uplink (DOLILU) is the process by which the Space Shuttle Program redesigns the vehicle steering commands to fit that day's environmental conditions and then rigorously verifies the integrated vehicle trajectory's loads, controls, and performance. The Shuttle methodology is very similar to other United States unmanned launch vehicles. By extension, this method would be similar to the methods employed for any future NASA launch vehicles. This presentation will provide an overview of the Shuttle's day-of-launch trajectory optimization and verification as an example of a more generic application of dayof- launch design and validation.

Properties of the optimal trajectories for coplanar, aeroassisted orbital transfer

NASA Technical Reports Server (NTRS)

Miele, A.; Wang, T.; Deaton, A. W.

1990-01-01

The optimization of trajectories for coplaner, aeroassisted orbital transfer (AOT) from a high Earth orbit (HEO) to a low Earth orbit (LEO) is examined. In particular, HEO can be a geosynchronous Earth orbit (GEO). It is assumed that the initial and final orbits are circular, that the gravitational field is central and is governed by the inverse square law, and that two impulses are employed, one at HEO exit and one at LEO entry. During the atmospheric pass, the trajectory is controlled via the lift coefficient in such a way that the total characteristic velocity is minimized. First, an ideal optimal trajectory is determined analytically for lift coefficient unbounded. This trajectory is called grazing trajectory, because the atmospheric pass is made by flying at constant altitude along the edge of the atmosphere until the excess velocity is depleted. For the grazing trajectory, the lift coefficient varies in such a way that the lift, the centrifugal force due to the Earth's curvature, the weight, and the Coriolis force due to the Earth's rotation are in static balance. Also, the grazing trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, dynamic pressure, and heating rate. Next, starting from the grazing trajectory results, a real optimal trajectory is determined numerically for the lift coefficient bounded from both below and above. This trajectory is characterized by atmospheric penetration with the smallest possible entry angle, followed by flight at the lift coefficient lower bound. Consistently with the grazing trajectory behavior, the real optimal trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, the dynamic pressure, and the heating rate.

Fast, exact k-space sample density compensation for trajectories composed of rotationally symmetric segments, and the SNR-optimized image reconstruction from non-Cartesian samples.

PubMed

Mitsouras, Dimitris; Mulkern, Robert V; Rybicki, Frank J

2008-08-01

A recently developed method for exact density compensation of non uniformly arranged samples relies on the analytically known cross-correlations of Fourier basis functions corresponding to the traced k-space trajectory. This method produces a linear system whose solution represents compensated samples that normalize the contribution of each independent element of information that can be expressed by the underlying trajectory. Unfortunately, linear system-based density compensation approaches quickly become computationally demanding with increasing number of samples (i.e., image resolution). Here, it is shown that when a trajectory is composed of rotationally symmetric interleaves, such as spiral and PROPELLER trajectories, this cross-correlations method leads to a highly simplified system of equations. Specifically, it is shown that the system matrix is circulant block-Toeplitz so that the linear system is easily block-diagonalized. The method is described and demonstrated for 32-way interleaved spiral trajectories designed for 256 image matrices; samples are compensated non iteratively in a few seconds by solving the small independent block-diagonalized linear systems in parallel. Because the method is exact and considers all the interactions between all acquired samples, up to a 10% reduction in reconstruction error concurrently with an up to 30% increase in signal to noise ratio are achieved compared to standard density compensation methods. (c) 2008 Wiley-Liss, Inc.

Smooth Sensor Motion Planning for Robotic Cyber Physical Social Sensing (CPSS)

PubMed Central

Tang, Hong; Li, Liangzhi; Xiao, Nanfeng

2017-01-01

Although many researchers have begun to study the area of Cyber Physical Social Sensing (CPSS), few are focused on robotic sensors. We successfully utilize robots in CPSS, and propose a sensor trajectory planning method in this paper. Trajectory planning is a fundamental problem in mobile robotics. However, traditional methods are not suited for robotic sensors, because of their low efficiency, instability, and non-smooth-generated paths. This paper adopts an optimizing function to generate several intermediate points and regress these discrete points to a quintic polynomial which can output a smooth trajectory for the robotic sensor. Simulations demonstrate that our approach is robust and efficient, and can be well applied in the CPSS field. PMID:28218649

Spectral CT of the extremities with a silicon strip photon counting detector

NASA Astrophysics Data System (ADS)

Sisniega, A.; Zbijewski, W.; Stayman, J. W.; Xu, J.; Taguchi, K.; Siewerdsen, J. H.

2015-03-01

Purpose: Photon counting x-ray detectors (PCXDs) are an important emerging technology for spectral imaging and material differentiation with numerous potential applications in diagnostic imaging. We report development of a Si-strip PCXD system originally developed for mammography with potential application to spectral CT of musculoskeletal extremities, including challenges associated with sparse sampling, spectral calibration, and optimization for higher energy x-ray beams. Methods: A bench-top CT system was developed incorporating a Si-strip PCXD, fixed anode x-ray source, and rotational and translational motions to execute complex acquisition trajectories. Trajectories involving rotation and translation combined with iterative reconstruction were investigated, including single and multiple axial scans and longitudinal helical scans. The system was calibrated to provide accurate spectral separation in dual-energy three-material decomposition of soft-tissue, bone, and iodine. Image quality and decomposition accuracy were assessed in experiments using a phantom with pairs of bone and iodine inserts (3, 5, 15 and 20 mm) and an anthropomorphic wrist. Results: The designed trajectories improved the sampling distribution from 56% minimum sampling of voxels to 75%. Use of iterative reconstruction (viz., penalized likelihood with edge preserving regularization) in combination with such trajectories resulted in a very low level of artifacts in images of the wrist. For large bone or iodine inserts (>5 mm diameter), the error in the estimated material concentration was <16% for (50 mg/mL) bone and <8% for (5 mg/mL) iodine with strong regularization. For smaller inserts, errors of 20-40% were observed and motivate improved methods for spectral calibration and optimization of the edge-preserving regularizer. Conclusion: Use of PCXDs for three-material decomposition in joint imaging proved feasible through a combination of rotation-translation acquisition trajectories and iterative reconstruction with optimized regularization.

Solution of the multiextreme optimization problem for low-thrust spacecraft flight to the asteroid apophis

NASA Astrophysics Data System (ADS)

Ivashkin, V. V.; Krylov, I. V.

2015-09-01

A method to optimize the flight trajectories to the asteroid Apophis that allows reliably to form a set of Pontryagin extremals for various boundary conditions of the flight, as well as effectively to search for a global problem optimum amongst its elements, is developed.

Optimizing Mars Sphere of Influence Maneuvers for NASA's Evolvable Mars Campaign

NASA Technical Reports Server (NTRS)

Merrill, Raymond G.; Komar, D. R.; Chai, Patrick; Qu, Min

2016-01-01

NASA's Human Spaceflight Architecture Team is refining human exploration architectures that will extend human presence to the Martian surface. For both Mars orbital and surface missions, NASA's Evolvable Mars Campaign assumes that cargo and crew can be delivered repeatedly to the same destination. Up to this point, interplanetary trajectories have been optimized to minimize the total propulsive requirements of the in-space transportation systems, while the pre-deployed assets and surface systems are optimized to minimize their respective propulsive requirements separate from the in-space transportation system. There is a need to investigate the coupled problem of optimizing the interplanetary trajectory and optimizing the maneuvers within Mars's sphere of influence. This paper provides a description of the ongoing method development, analysis and initial results of the effort to resolve the discontinuity between the interplanetary trajectory and the Mars sphere of influence trajectories. Assessment of Phobos and Deimos orbital missions shows the in-space transportation and crew taxi allocations are adequate for missions in the 2030s. Because the surface site has yet to be selected, the transportation elements must be sized to provide enough capability to provide surface access to all landing sites under consideration. Analysis shows access to sites from elliptical parking orbits with a lander that is designed for sub-periapsis landing location is either infeasible or requires expensive orbital maneuvers for many latitude ranges. In this case the locus of potential arrival perigee vectors identifies the potential maximum north or south latitudes accessible. Higher arrival velocities can decrease reorientation costs and increase landing site availability. Utilizing hyperbolic arrival and departure vectors in the optimization scheme will increase transportation site accessibility and provide more optimal solutions.

Online optimal obstacle avoidance for rotary-wing autonomous unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Kang, Keeryun

This thesis presents an integrated framework for online obstacle avoidance of rotary-wing unmanned aerial vehicles (UAVs), which can provide UAVs an obstacle field navigation capability in a partially or completely unknown obstacle-rich environment. The framework is composed of a LIDAR interface, a local obstacle grid generation, a receding horizon (RH) trajectory optimizer, a global shortest path search algorithm, and a climb rate limit detection logic. The key feature of the framework is the use of an optimization-based trajectory generation in which the obstacle avoidance problem is formulated as a nonlinear trajectory optimization problem with state and input constraints over the finite range of the sensor. This local trajectory optimization is combined with a global path search algorithm which provides a useful initial guess to the nonlinear optimization solver. Optimization is the natural process of finding the best trajectory that is dynamically feasible, safe within the vehicle's flight envelope, and collision-free at the same time. The optimal trajectory is continuously updated in real time by the numerical optimization solver, Nonlinear Trajectory Generation (NTG), which is a direct solver based on the spline approximation of trajectory for dynamically flat systems. In fact, the overall approach of this thesis to finding the optimal trajectory is similar to the model predictive control (MPC) or the receding horizon control (RHC), except that this thesis followed a two-layer design; thus, the optimal solution works as a guidance command to be followed by the controller of the vehicle. The framework is implemented in a real-time simulation environment, the Georgia Tech UAV Simulation Tool (GUST), and integrated in the onboard software of the rotary-wing UAV test-bed at Georgia Tech. Initially, the 2D vertical avoidance capability of real obstacles was tested in flight. The flight test evaluations were extended to the benchmark tests for 3D avoidance capability over the virtual obstacles, and finally it was demonstrated on real obstacles located at the McKenna MOUT site in Fort Benning, Georgia. Simulations and flight test evaluations demonstrate the feasibility of the developed framework for UAV applications involving low-altitude flight in an urban area.

The Tool for Designing Engineering Systems Using a New Optimization Method Based on a Stochastic Process

NASA Astrophysics Data System (ADS)

Yoshida, Hiroaki; Yamaguchi, Katsuhito; Ishikawa, Yoshio

The conventional optimization methods were based on a deterministic approach, since their purpose is to find out an exact solution. However, these methods have initial condition dependence and risk of falling into local solution. In this paper, we propose a new optimization method based on a concept of path integral method used in quantum mechanics. The method obtains a solutions as an expected value (stochastic average) using a stochastic process. The advantages of this method are not to be affected by initial conditions and not to need techniques based on experiences. We applied the new optimization method to a design of the hang glider. In this problem, not only the hang glider design but also its flight trajectory were optimized. The numerical calculation results showed that the method has a sufficient performance.

Quadrotor Intercept Trajectory Planning and Simulation

DTIC Science & Technology

2017-06-01

Figure 41. Results are grouped by geometry type and colored based on trajectory planner. Figure 41. Summary of Experimental Data Intercept Time...DISTRIBUTION CODE 13. ABSTRACT (maximum 200 words) Quadrotor drones pose a safety hazard when operated in or near controlled airspace. A hazardous...quadrotor could be intercepted and removed by another quadrotor. In this thesis, we seek to determine if optimal control methods outperform missile

WE-AB-209-06: Dynamic Collimator Trajectory Algorithm for Use in VMAT Treatment Deliveries

DOE Office of Scientific and Technical Information (OSTI.GOV)

MacDonald, L; Thomas, C; Syme, A

2016-06-15

Purpose: To develop advanced dynamic collimator positioning algorithms for optimal beam’s-eye-view (BEV) fitting of targets in VMAT procedures, including multiple metastases stereotactic radiosurgery procedures. Methods: A trajectory algorithm was developed, which can dynamically modify the angle of the collimator as a function of VMAT control point to provide optimized collimation of target volume(s). Central to this algorithm is a concept denoted “whitespace”, defined as area within the jaw-defined BEV field, outside of the PTV, and not shielded by the MLC when fit to the PTV. Calculating whitespace at all collimator angles and every control point, a two-dimensional topographical map depictingmore » the tightness-of-fit of the MLC was generated. A variety of novel searching algorithms identified a number of candidate trajectories of continuous collimator motion. Ranking these candidate trajectories according to their accrued whitespace value produced an optimal solution for navigation of this map. Results: All trajectories were normalized to minimum possible (i.e. calculated without consideration of collimator motion constraints) accrued whitespace. On an acoustic neuroma case, a random walk algorithm generated a trajectory with 151% whitespace; random walk including a mandatory anchor point improved this to 148%; gradient search produced a trajectory with 137%; and bi-directional gradient search generated a trajectory with 130% whitespace. For comparison, a fixed collimator angle of 30° and 330° accumulated 272% and 228% of whitespace, respectively. The algorithm was tested on a clinical case with two metastases (single isocentre) and identified collimator angles that allow for simultaneous irradiation of the PTVs while minimizing normal tissue irradiation. Conclusion: Dynamic collimator trajectories have the potential to improve VMAT deliveries through increased efficiency and reduced normal tissue dose, especially in treatment of multiple cranial metastases, without significant safety concerns that hinder immediate clinical implementation.« less

Simulation Propulsion System and Trajectory Optimization

NASA Technical Reports Server (NTRS)

Hendricks, Eric S.; Falck, Robert D.; Gray, Justin S.

2017-01-01

A number of new aircraft concepts have recently been proposed which tightly couple the propulsion system design and operation with the overall vehicle design and performance characteristics. These concepts include propulsion technology such as boundary layer ingestion, hybrid electric propulsion systems, distributed propulsion systems and variable cycle engines. Initial studies examining these concepts have typically used a traditional decoupled approach to aircraft design where the aerodynamics and propulsion designs are done a-priori and tabular data is used to provide inexpensive look ups to the trajectory ana-ysis. However the cost of generating the tabular data begins to grow exponentially when newer aircraft concepts require consideration of additional operational parameters such as multiple throttle settings, angle-of-attack effects on the propulsion system, or propulsion throttle setting effects on aerodynamics. This paper proposes a new modeling approach that eliminated the need to generate tabular data, instead allowing an expensive propulsion or aerodynamic analysis to be directly integrated into the trajectory analysis model and the entire design problem optimized in a fully coupled manner. The new method is demonstrated by implementing a canonical optimal control problem, the F-4 minimum time-to-climb trajectory optimization using three relatively new analysis tools: Open M-DAO, PyCycle and Pointer. Pycycle and Pointer both provide analytic derivatives and Open MDAO enables the two tools to be combined into a coupled model that can be run in an efficient parallel manner that helps to cost the increased cost of the more expensive propulsion analysis. Results generated with this model serve as a validation of the tightly coupled design method and guide future studies to examine aircraft concepts with more complex operational dependencies for the aerodynamic and propulsion models.

Trajectory optimization of spacecraft high-thrust orbit transfer using a modified evolutionary algorithm

NASA Astrophysics Data System (ADS)

Shirazi, Abolfazl

2016-10-01

This article introduces a new method to optimize finite-burn orbital manoeuvres based on a modified evolutionary algorithm. Optimization is carried out based on conversion of the orbital manoeuvre into a parameter optimization problem by assigning inverse tangential functions to the changes in direction angles of the thrust vector. The problem is analysed using boundary delimitation in a common optimization algorithm. A method is introduced to achieve acceptable values for optimization variables using nonlinear simulation, which results in an enlarged convergence domain. The presented algorithm benefits from high optimality and fast convergence time. A numerical example of a three-dimensional optimal orbital transfer is presented and the accuracy of the proposed algorithm is shown.

Advanced launch system trajectory optimization using suboptimal control

NASA Technical Reports Server (NTRS)

Shaver, Douglas A.; Hull, David G.

1993-01-01

The maximum-final mass trajectory of a proposed configuration of the Advanced Launch System is presented. A model for the two-stage rocket is given; the optimal control problem is formulated as a parameter optimization problem; and the optimal trajectory is computed using a nonlinear programming code called VF02AD. Numerical results are presented for the controls (angle of attack and velocity roll angle) and the states. After the initial rotation, the angle of attack goes to a positive value to keep the trajectory as high as possible, returns to near zero to pass through the transonic regime and satisfy the dynamic pressure constraint, returns to a positive value to keep the trajectory high and to take advantage of minimum drag at positive angle of attack due to aerodynamic shading of the booster, and then rolls off to negative values to satisfy the constraints. Because the engines cannot be throttled, the maximum dynamic pressure occurs at a single point; there is no maximum dynamic pressure subarc. To test approximations for obtaining analytical solutions for guidance, two additional optimal trajectories are computed: one using untrimmed aerodynamics and one using no atmospheric effects except for the dynamic pressure constraint. It is concluded that untrimmed aerodynamics has a negligible effect on the optimal trajectory and that approximate optimal controls should be able to be obtained by treating atmospheric effects as perturbations.

Overview and Software Architecture of the Copernicus Trajectory Design and Optimization System

NASA Technical Reports Server (NTRS)

Williams, Jacob; Senent, Juan S.; Ocampo, Cesar; Mathur, Ravi; Davis, Elizabeth C.

2010-01-01

The Copernicus Trajectory Design and Optimization System represents an innovative and comprehensive approach to on-orbit mission design, trajectory analysis and optimization. Copernicus integrates state of the art algorithms in optimization, interactive visualization, spacecraft state propagation, and data input-output interfaces, allowing the analyst to design spacecraft missions to all possible Solar System destinations. All of these features are incorporated within a single architecture that can be used interactively via a comprehensive GUI interface, or passively via external interfaces that execute batch processes. This paper describes the Copernicus software architecture together with the challenges associated with its implementation. Additionally, future development and planned new capabilities are discussed. Key words: Copernicus, Spacecraft Trajectory Optimization Software.

Feedback Implementation of Zermelo's Optimal Control by Sugeno Approximation

NASA Technical Reports Server (NTRS)

Clifton, C.; Homaifax, A.; Bikdash, M.

1997-01-01

This paper proposes an approach to implement optimal control laws of nonlinear systems in real time. Our methodology does not require solving two-point boundary value problems online and may not require it off-line either. The optimal control law is learned using the original Sugeno controller (OSC) from a family of optimal trajectories. We compare the trajectories generated by the OSC and the trajectories yielded by the optimal feedback control law when applied to Zermelo's ship steering problem.

Optimal Trajectories Generation in Robotic Fiber Placement Systems

NASA Astrophysics Data System (ADS)

Gao, Jiuchun; Pashkevich, Anatol; Caro, Stéphane

2017-06-01

The paper proposes a methodology for optimal trajectories generation in robotic fiber placement systems. A strategy to tune the parameters of the optimization algorithm at hand is also introduced. The presented technique transforms the original continuous problem into a discrete one where the time-optimal motions are generated by using dynamic programming. The developed strategy for the optimization algorithm tuning allows essentially reducing the computing time and obtaining trajectories satisfying industrial constraints. Feasibilities and advantages of the proposed methodology are confirmed by an application example.

Simultaneous Detection and Tracking of Pedestrian from Panoramic Laser Scanning Data

NASA Astrophysics Data System (ADS)

Xiao, Wen; Vallet, Bruno; Schindler, Konrad; Paparoditis, Nicolas

2016-06-01

Pedestrian traffic flow estimation is essential for public place design and construction planning. Traditional data collection by human investigation is tedious, inefficient and expensive. Panoramic laser scanners, e.g. Velodyne HDL-64E, which scan surroundings repetitively at a high frequency, have been increasingly used for 3D object tracking. In this paper, a simultaneous detection and tracking (SDAT) method is proposed for precise and automatic pedestrian trajectory recovery. First, the dynamic environment is detected using two different methods, Nearest-point and Max-distance. Then, all the points on moving objects are transferred into a space-time (x, y, t) coordinate system. The pedestrian detection and tracking amounts to assign the points belonging to pedestrians into continuous trajectories in space-time. We formulate the point assignment task as an energy function which incorporates the point evidence, trajectory number, pedestrian shape and motion. A low energy trajectory will well explain the point observations, and have plausible trajectory trend and length. The method inherently filters out points from other moving objects and false detections. The energy function is solved by a two-step optimization process: tracklet detection in a short temporal window; and global tracklet association through the whole time span. Results demonstrate that the proposed method can automatically recover the pedestrians trajectories with accurate positions and low false detections and mismatches.

Application of the nudged elastic band method to the point-to-point radio wave ray tracing in IRI modeled ionosphere

NASA Astrophysics Data System (ADS)

Nosikov, I. A.; Klimenko, M. V.; Bessarab, P. F.; Zhbankov, G. A.

2017-07-01

Point-to-point ray tracing is an important problem in many fields of science. While direct variational methods where some trajectory is transformed to an optimal one are routinely used in calculations of pathways of seismic waves, chemical reactions, diffusion processes, etc., this approach is not widely known in ionospheric point-to-point ray tracing. We apply the Nudged Elastic Band (NEB) method to a radio wave propagation problem. In the NEB method, a chain of points which gives a discrete representation of the radio wave ray is adjusted iteratively to an optimal configuration satisfying the Fermat's principle, while the endpoints of the trajectory are kept fixed according to the boundary conditions. Transverse displacements define the radio ray trajectory, while springs between the points control their distribution along the ray. The method is applied to a study of point-to-point ionospheric ray tracing, where the propagation medium is obtained with the International Reference Ionosphere model taking into account traveling ionospheric disturbances. A 2-dimensional representation of the optical path functional is developed and used to gain insight into the fundamental difference between high and low rays. We conclude that high and low rays are minima and saddle points of the optical path functional, respectively.

Linear quadratic optimization for positive LTI system

NASA Astrophysics Data System (ADS)

Muhafzan, Yenti, Syafrida Wirma; Zulakmal

2017-05-01

Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

Stationkeeping of Lissajous Trajectories in the Earth-Moon System with Applications to ARTEMIS

NASA Technical Reports Server (NTRS)

Folta, D. C.; Pavlak, T. A.; Howell, K. C.; Woodard, M. A.; Woodfork, D. W.

2010-01-01

In the last few decades, several missions have successfully exploited trajectories near the.Sun-Earth L1 and L2 libration points. Recently, the collinear libration points in the Earth-Moon system have emerged as locations with immediate application. Most libration point orbits, in any system, are inherently unstable. and must be controlled. To this end, several stationkeeping strategies are considered for application to ARTEMIS. Two approaches are examined to investigate the stationkeeping problem in this regime and the specific options. available for ARTEMIS given the mission and vehicle constraints. (I) A baseline orbit-targeting approach controls the vehicle to remain near a nominal trajectory; a related global optimum search method searches all possible maneuver angles to determine an optimal angle and magnitude; and (2) an orbit continuation method, with various formulations determines maneuver locations and minimizes costs. Initial results indicate that consistent stationkeeping costs can be achieved with both approaches and the costs are reasonable. These methods are then applied to Lissajous trajectories representing a baseline ARTEMIS libration orbit trajectory.

Incorporating Uncertainty into Spacecraft Mission and Trajectory Design

NASA Astrophysics Data System (ADS)

Juliana D., Feldhacker

The complex nature of many astrodynamic systems often leads to high computational costs or degraded accuracy in the analysis and design of spacecraft missions, and the incorporation of uncertainty into the trajectory optimization process often becomes intractable. This research applies mathematical modeling techniques to reduce computational cost and improve tractability for design, optimization, uncertainty quantication (UQ) and sensitivity analysis (SA) in astrodynamic systems and develops a method for trajectory optimization under uncertainty (OUU). This thesis demonstrates the use of surrogate regression models and polynomial chaos expansions for the purpose of design and UQ in the complex three-body system. Results are presented for the application of the models to the design of mid-eld rendezvous maneuvers for spacecraft in three-body orbits. The models are shown to provide high accuracy with no a priori knowledge on the sample size required for convergence. Additionally, a method is developed for the direct incorporation of system uncertainties into the design process for the purpose of OUU and robust design; these methods are also applied to the rendezvous problem. It is shown that the models can be used for constrained optimization with orders of magnitude fewer samples than is required for a Monte Carlo approach to the same problem. Finally, this research considers an application for which regression models are not well-suited, namely UQ for the kinetic de ection of potentially hazardous asteroids under the assumptions of real asteroid shape models and uncertainties in the impact trajectory and the surface material properties of the asteroid, which produce a non-smooth system response. An alternate set of models is presented that enables analytic computation of the uncertainties in the imparted momentum from impact. Use of these models for a survey of asteroids allows conclusions to be drawn on the eects of an asteroid's shape on the ability to successfully divert the asteroid via kinetic impactor.

Optimal control theory determination of feasible return-to-launch-site aborts for the HL-20 Personnel Launch System vehicle

NASA Technical Reports Server (NTRS)

Dutton, Kevin E.

1994-01-01

The personnel launch system (PLS) being studied by NASA is a system to complement the space shuttle and provide alternative access to space. The PLS consists of a manned spacecraft launched by an expendable launch vehicle (ELV). A candidate for the manned spacecraft is the HL-20 lifting body. In the event of an ELV malfunction during the initial portion of the ascent trajectory, the HL-20 will separate from the rocket and perform an unpowered return to launch site (RTLS) abort. This work details an investigation, using optimal control theory, of the RTLS abort scenario. The objective of the optimization was to maximize final altitude. With final altitude as the cost function, the feasibility of an RTLS abort at different times during the ascent was determined. The method of differential inclusions was used to determine the optimal state trajectories, and the optimal controls were then calculated from the optimal states and state rates.

Potential applications of skip SMV with thrust engine

NASA Astrophysics Data System (ADS)

Wang, Weilin; Savvaris, Al

2016-11-01

This paper investigates the potential applications of Space Maneuver Vehicles (SMV) with skip trajectory. Due to soaring space operations over the past decades, the risk of space debris has considerably increased such as collision risks with space asset, human property on ground and even aviation. Many active debris removal methods have been investigated and in this paper, a debris remediation method is first proposed based on skip SMV. The key point is to perform controlled re-entry. These vehicles are expected to achieve a trans-atmospheric maneuver with thrust engine. If debris is released at altitude below 80 km, debris could be captured by the atmosphere drag force and re-entry interface prediction accuracy is improved. Moreover if the debris is released in a cargo at a much lower altitude, this technique protects high value space asset from break up by the atmosphere and improves landing accuracy. To demonstrate the feasibility of this concept, the present paper presents the simulation results for two specific mission profiles: (1) descent to predetermined altitude; (2) descent to predetermined point (altitude, longitude and latitude). The evolutionary collocation method is adopted for skip trajectory optimization due to its global optimality and high-accuracy. This method is actually a two-step optimization approach based on the heuristic algorithm and the collocation method. The optimal-control problem is transformed into a nonlinear programming problem (NLP) which can be efficiently and accurately solved by the sequential quadratic programming (SQP) procedure. However, such a method is sensitive to initial values. To reduce the sensitivity problem, genetic algorithm (GA) is adopted to refine the grids and provide near optimum initial values. By comparing the simulation data from different scenarios, it is found that skip SMV is feasible in active debris removal and the evolutionary collocation method gives a truthful re-entry trajectory that satisfies the path and boundary constraints.

The effect of parking orbit constraints on the optimization of ballistic planetary trajectories

NASA Technical Reports Server (NTRS)

Sauer, C. G., Jr.

1984-01-01

The optimization of ballistic planetary trajectories is developed which includes constraints on departure parking orbit inclination and node. This problem is formulated to result in a minimum total Delta V where the entire constrained injection Delta V is included in the optimization. An additional Delta V is also defined to allow for possible optimization of parking orbit inclination when the launch vehicle orbit capability varies as a function of parking orbit inclination. The optimization problem is formulated using primer vector theory to derive partial derivatives of total Delta V with respect to possible free parameters. Minimization of total Delta V is accomplished using a quasi-Newton gradient search routine. The analysis is applied to an Eros rendezvous mission whose transfer trajectories are characterized by high values of launch asymptote declination during particular launch opportunities. Comparisons in performance are made between trajectories where parking orbit constraints are included in the optimization and trajectories where the constraints are not included.

Primer Vector Optimization: Survey of Theory, new Analysis and Applications

NASA Astrophysics Data System (ADS)

Guzman

This paper presents a preliminary study in developing a set of optimization tools for orbit rendezvous, transfer and station keeping. This work is part of a large scale effort undergoing at NASA Goddard Space Flight Center and a.i. solutions, Inc. to build generic methods, which will enable missions with tight fuel budgets. Since no single optimization technique can solve efficiently all existing problems, a library of tools where the user could pick the method most suited for the particular mission is envisioned. The first trajectory optimization technique explored is Lawden's primer vector theory [Ref. 1]. Primer vector theory can be considered as a byproduct of applying Calculus of Variations (COV) techniques to the problem of minimizing the fuel usage of impulsive trajectories. For an n-impulse trajectory, it involves the solution of n-1 two-point boundary value problems. In this paper, we look at some of the different formulations of the primer vector (dependent on the frame employed and on the force model). Also, the applicability of primer vector theory is examined in effort to understand when and why the theory can fail. Specifically, since COV is based on "small variations", singularities in the linearized (variational) equations of motion along the arcs must be taken into account. These singularities are a recurring problem in analyzes that employ "small variations" [Refs. 2, 3]. For example, singularities in the (2-body problem) variational equations along elliptic arcs occur when [Ref. 4], 1) the difference between the initial and final times is a multiple of the reference orbit period, 2) the difference between the initial and final true anomalies are given by k, for k= 0, 1, 2, 3,..., note that this cover the 3) the time of flight is a minimum for the given difference in true anomaly. For the N-body problem, the situation is more complex and is still under investigation. Several examples, such as the initialization of an orbit (ascent trajectory) and rotation of the line of apsides, are utilized as test cases. Recommendations, future work, and the possible addition of other optimization techniques are also discussed. References: [1] Lawden D.F., Optimal Trajectories for Space Navigation, Butterworths, London, 1963. [2] Wilson, R.S., Howell, K.C., and, Lo, M, "Optimization of Insertion Cost for Transfer Trajectories to Libration Point Orbits", AIAA/AAS Astrodynamics Specialist Conference, AAS 99-041, Girdwood, Alaska, August 16-19, 1999. [3] Goodson, T, "Monte-Carlo Maneuver Analysis for the Microwave Anisotropy Probe", AAS/AIAA Astrodynamics Specialist Conference, AAS 01-331, Quebec City, Canada, July 30 - August 2, 2001. [4] Stern, R.G., "Singularities in the Analytic Solution of the Linearized Variational Equations of Elliptical Motion", Report RE-8, May 1964, Experimental Astronomy Lab., Massachusetts Institute of Technology, Cambridge, Massachusetts.

A Segment-Based Trajectory Similarity Measure in the Urban Transportation Systems.

PubMed

Mao, Yingchi; Zhong, Haishi; Xiao, Xianjian; Li, Xiaofang

2017-03-06

With the rapid spread of built-in GPS handheld smart devices, the trajectory data from GPS sensors has grown explosively. Trajectory data has spatio-temporal characteristics and rich information. Using trajectory data processing techniques can mine the patterns of human activities and the moving patterns of vehicles in the intelligent transportation systems. A trajectory similarity measure is one of the most important issues in trajectory data mining (clustering, classification, frequent pattern mining, etc.). Unfortunately, the main similarity measure algorithms with the trajectory data have been found to be inaccurate, highly sensitive of sampling methods, and have low robustness for the noise data. To solve the above problems, three distances and their corresponding computation methods are proposed in this paper. The point-segment distance can decrease the sensitivity of the point sampling methods. The prediction distance optimizes the temporal distance with the features of trajectory data. The segment-segment distance introduces the trajectory shape factor into the similarity measurement to improve the accuracy. The three kinds of distance are integrated with the traditional dynamic time warping algorithm (DTW) algorithm to propose a new segment-based dynamic time warping algorithm (SDTW). The experimental results show that the SDTW algorithm can exhibit about 57%, 86%, and 31% better accuracy than the longest common subsequence algorithm (LCSS), and edit distance on real sequence algorithm (EDR) , and DTW, respectively, and that the sensitivity to the noise data is lower than that those algorithms.

Fast approximate delivery of fluence maps for IMRT and VMAT

NASA Astrophysics Data System (ADS)

Balvert, Marleen; Craft, David

2017-02-01

In this article we provide a method to generate the trade-off between delivery time and fluence map matching quality for dynamically delivered fluence maps. At the heart of our method lies a mathematical programming model that, for a given duration of delivery, optimizes leaf trajectories and dose rates such that the desired fluence map is reproduced as well as possible. We begin with the single fluence map case and then generalize the model and the solution technique to the delivery of sequential fluence maps. The resulting large-scale, non-convex optimization problem was solved using a heuristic approach. We test our method using a prostate case and a head and neck case, and present the resulting trade-off curves. Analysis of the leaf trajectories reveals that short time plans have larger leaf openings in general than longer delivery time plans. Our method allows one to explore the continuum of possibilities between coarse, large segment plans characteristic of direct aperture approaches and narrow field plans produced by sliding window approaches. Exposing this trade-off will allow for an informed choice between plan quality and solution time. Further research is required to speed up the optimization process to make this method clinically implementable.

Applications of numerical optimization methods to helicopter design problems: A survey

NASA Technical Reports Server (NTRS)

Miura, H.

1984-01-01

A survey of applications of mathematical programming methods is used to improve the design of helicopters and their components. Applications of multivariable search techniques in the finite dimensional space are considered. Five categories of helicopter design problems are considered: (1) conceptual and preliminary design, (2) rotor-system design, (3) airframe structures design, (4) control system design, and (5) flight trajectory planning. Key technical progress in numerical optimization methods relevant to rotorcraft applications are summarized.

Applications of numerical optimization methods to helicopter design problems - A survey

NASA Technical Reports Server (NTRS)

Miura, H.

1985-01-01

A survey of applications of mathematical programming methods is used to improve the design of helicopters and their components. Applications of multivariable search techniques in the finite dimensional space are considered. Five categories of helicopter design problems are considered: (1) conceptual and preliminary design, (2) rotor-system design, (3) airframe structures design, (4) control system design, and (5) flight trajectory planning. Key technical progress in numerical optimization methods relevant to rotorcraft applications are summarized.

Applications of numerical optimization methods to helicopter design problems - A survey

NASA Technical Reports Server (NTRS)

Miura, H.

1984-01-01

A survey of applications of mathematical programming methods is used to improve the design of helicopters and their components. Applications of multivariable search techniques in the finite dimensional space are considered. Five categories of helicopter design problems are considered: (1) conceptual and preliminary design, (2) rotor-system design, (3) airframe structures design, (4) control system design, and (5) flight trajectory planning. Key technical progress in numerical optimization methods relevant to rotorcraft applications are summarized.

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

NASA Technical Reports Server (NTRS)

Hughes, Steven P.; Mailhe, Laurie M.; Guzman, Jose J.

2003-01-01

In this paper we present, a comparison of trajectory optimization approaches for the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP). Quasi- Newton and Nelder-Meade Simplex. Several cost function parameterizations are considered for the direct approach. We choose one direct approach that appears to be the most flexible. Both the direct and indirect methods are applied to a variety of test cases which are chosen to demonstrate the performance of each method in different flight regimes. The first test case is a simple circular-to-circular coplanar rendezvous. The second test case is an elliptic-to-elliptic line of apsides rotation. The final test case is an orbit phasing maneuver sequence in a highly elliptic orbit. For each test case we present a comparison of the performance of all methods we consider in this paper.

Global Optimization of Interplanetary Trajectories in the Presence of Realistic Mission Contraints

NASA Technical Reports Server (NTRS)

Hinckley, David, Jr.; Englander, Jacob; Hitt, Darren

2015-01-01

Interplanetary missions are often subject to difficult constraints, like solar phase angle upon arrival at the destination, velocity at arrival, and altitudes for flybys. Preliminary design of such missions is often conducted by solving the unconstrained problem and then filtering away solutions which do not naturally satisfy the constraints. However this can bias the search into non-advantageous regions of the solution space, so it can be better to conduct preliminary design with the full set of constraints imposed. In this work two stochastic global search methods are developed which are well suited to the constrained global interplanetary trajectory optimization problem.

Hybrid Differential Dynamic Programming with Stochastic Search

NASA Technical Reports Server (NTRS)

Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob A.

2016-01-01

Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASA's Dawn mission. The Dawn trajectory was designed with the DDP-based Static/Dynamic Optimal Control algorithm used in the Mystic software.1 Another recently developed method, Hybrid Differential Dynamic Programming (HDDP),2, 3 is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.

Thermally-Constrained Fuel-Optimal ISS Maneuvers

NASA Technical Reports Server (NTRS)

Bhatt, Sagar; Svecz, Andrew; Alaniz, Abran; Jang, Jiann-Woei; Nguyen, Louis; Spanos, Pol

2015-01-01

Optimal Propellant Maneuvers (OPMs) are now being used to rotate the International Space Station (ISS) and have saved hundreds of kilograms of propellant over the last two years. The savings are achieved by commanding the ISS to follow a pre-planned attitude trajectory optimized to take advantage of environmental torques. The trajectory is obtained by solving an optimal control problem. Prior to use on orbit, OPM trajectories are screened to ensure a static sun vector (SSV) does not occur during the maneuver. The SSV is an indicator that the ISS hardware temperatures may exceed thermal limits, causing damage to the components. In this paper, thermally-constrained fuel-optimal trajectories are presented that avoid an SSV and can be used throughout the year while still reducing propellant consumption significantly.

Trajectory optimization for the National Aerospace Plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1992-01-01

The primary objective of this research is to develop an efficient and robust trajectory optimization tool for the optimal ascent problem of the National Aerospace Plane (NASP). This report is organized in the following order to summarize the complete work: Section two states the formulation and models of the trajectory optimization problem. An inverse dynamics approach to the problem is introduced in Section three. Optimal trajectories corresponding to various conditions and performance parameters are presented in Section four. A midcourse nonlinear feedback controller is developed in Section five. Section six demonstrates the performance of the inverse dynamics approach and midcourse controller during disturbances. Section seven discusses rocket assisted ascent which may be beneficial when orbital altitude is high. Finally, Section eight recommends areas of future research.

Noncoplanar VMAT for nasopharyngeal tumors: Plan quality versus treatment time.

PubMed

Wild, Esther; Bangert, Mark; Nill, Simeon; Oelfke, Uwe

2015-05-01

The authors investigated the potential of optimized noncoplanar irradiation trajectories for volumetric modulated arc therapy (VMAT) treatments of nasopharyngeal patients and studied the trade-off between treatment plan quality and delivery time in radiation therapy. For three nasopharyngeal patients, the authors generated treatment plans for nine different delivery scenarios using dedicated optimization methods. They compared these scenarios according to dose characteristics, number of beam directions, and estimated delivery times. In particular, the authors generated the following treatment plans: (1) a 4π plan, which is a not sequenced, fluence optimized plan that uses beam directions from approximately 1400 noncoplanar directions and marks a theoretical upper limit of the treatment plan quality, (2) a coplanar 2π plan with 72 coplanar beam directions as pendant to the noncoplanar 4π plan, (3) a coplanar VMAT plan, (4) a coplanar step and shoot (SnS) plan, (5) a beam angle optimized (BAO) coplanar SnS IMRT plan, (6) a noncoplanar BAO SnS plan, (7) a VMAT plan with rotated treatment couch, (8) a noncoplanar VMAT plan with an optimized great circle around the patient, and (9) a noncoplanar BAO VMAT plan with an arbitrary trajectory around the patient. VMAT using optimized noncoplanar irradiation trajectories reduced the mean and maximum doses in organs at risk compared to coplanar VMAT plans by 19% on average while the target coverage remains constant. A coplanar BAO SnS plan was superior to coplanar SnS or VMAT; however, noncoplanar plans like a noncoplanar BAO SnS plan or noncoplanar VMAT yielded a better plan quality than the best coplanar 2π plan. The treatment plan quality of VMAT plans depended on the length of the trajectory. The delivery times of noncoplanar VMAT plans were estimated to be 6.5 min in average; 1.6 min longer than a coplanar plan but on average 2.8 min faster than a noncoplanar SnS plan with comparable treatment plan quality. The authors' study reconfirms the dosimetric benefits of noncoplanar irradiation of nasopharyngeal tumors. Both SnS using optimized noncoplanar beam ensembles and VMAT using an optimized, arbitrary, noncoplanar trajectory enabled dose reductions in organs at risk compared to coplanar SnS and VMAT. Using great circles or simple couch rotations to implement noncoplanar VMAT, however, was not sufficient to yield meaningful improvements in treatment plan quality. The authors estimate that noncoplanar VMAT using arbitrary optimized irradiation trajectories comes at an increased delivery time compared to coplanar VMAT yet at a decreased delivery time compared to noncoplanar SnS IMRT.

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

NASA Technical Reports Server (NTRS)

McCarty, Steven L.; McGuire, Melissa L.

2018-01-01

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.,

Enhancements on the Convex Programming Based Powered Descent Guidance Algorithm for Mars Landing

NASA Technical Reports Server (NTRS)

Acikmese, Behcet; Blackmore, Lars; Scharf, Daniel P.; Wolf, Aron

2008-01-01

In this paper, we present enhancements on the powered descent guidance algorithm developed for Mars pinpoint landing. The guidance algorithm solves the powered descent minimum fuel trajectory optimization problem via a direct numerical method. Our main contribution is to formulate the trajectory optimization problem, which has nonconvex control constraints, as a finite dimensional convex optimization problem, specifically as a finite dimensional second order cone programming (SOCP) problem. SOCP is a subclass of convex programming, and there are efficient SOCP solvers with deterministic convergence properties. Hence, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications. Particularly, this paper discusses the algorithmic improvements obtained by: (i) Using an efficient approach to choose the optimal time-of-flight; (ii) Using a computationally inexpensive way to detect the feasibility/ infeasibility of the problem due to the thrust-to-weight constraint; (iii) Incorporating the rotation rate of the planet into the problem formulation; (iv) Developing additional constraints on the position and velocity to guarantee no-subsurface flight between the time samples of the temporal discretization; (v) Developing a fuel-limited targeting algorithm; (vi) Initial result on developing an onboard table lookup method to obtain almost fuel optimal solutions in real-time.

Optimal critic learning for robot control in time-varying environments.

PubMed

Wang, Chen; Li, Yanan; Ge, Shuzhi Sam; Lee, Tong Heng

2015-10-01

In this paper, optimal critic learning is developed for robot control in a time-varying environment. The unknown environment is described as a linear system with time-varying parameters, and impedance control is employed for the interaction control. Desired impedance parameters are obtained in the sense of an optimal realization of the composite of trajectory tracking and force regulation. Q -function-based critic learning is developed to determine the optimal impedance parameters without the knowledge of the system dynamics. The simulation results are presented and compared with existing methods, and the efficacy of the proposed method is verified.

Design and Optimization of Low-thrust Orbit Transfers Using Q-law and Evolutionary Algorithms

NASA Technical Reports Server (NTRS)

Lee, Seungwon; vonAllmen, Paul; Fink, Wolfgang; Petropoulos, Anastassios; Terrile, Richard

2005-01-01

Future space missions will depend more on low-thrust propulsion (such as ion engines) thanks to its high specific impulse. Yet, the design of low-thrust trajectories is complex and challenging. Third-body perturbations often dominate the thrust, and a significant change to the orbit requires a long duration of thrust. In order to guide the early design phases, we have developed an efficient and efficacious method to obtain approximate propellant and flight-time requirements (i.e., the Pareto front) for orbit transfers. A search for the Pareto-optimal trajectories is done in two levels: optimal thrust angles and locations are determined by Q-law, while the Q-law is optimized with two evolutionary algorithms: a genetic algorithm and a simulated-annealing-related algorithm. The examples considered are several types of orbit transfers around the Earth and the asteroid Vesta.

Autorotation flight control system

NASA Technical Reports Server (NTRS)

Bachelder, Edward N. (Inventor); Aponso, Bimal L. (Inventor); Lee, Dong-Chan (Inventor)

2011-01-01

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Some applications of Lie groups in astrodynamics

NASA Technical Reports Server (NTRS)

Jackson, A. A.

1983-01-01

Differential equations that arise in astrodynamics are examined from the standpoint of Lie group theory. A summary of the Lie method is given for first degree differential equations. The Kepler problem in Hamiltonian form is treated by this method. Extension of the Lie method to optimal trajectories is outlined.

WE-AB-209-10: Optimizing the Delivery of Sequential Fluence Maps for Efficient VMAT Delivery

DOE Office of Scientific and Technical Information (OSTI.GOV)

Craft, D; Balvert, M

2016-06-15

Purpose: To develop an optimization model and solution approach for computing MLC leaf trajectories and dose rates for high quality matching of a set of optimized fluence maps to be delivered sequentially around a patient in a VMAT treatment. Methods: We formulate the fluence map matching problem as a nonlinear optimization problem where time is discretized but dose rates and leaf positions are continuous variables. For a given allotted time, which is allocated across the fluence maps based on the complexity of each fluence map, the optimization problem searches for the best leaf trajectories and dose rates such that themore » original fluence maps are closely recreated. Constraints include maximum leaf speed, maximum dose rate, and leaf collision avoidance, as well as the constraint that the ending leaf positions for one map are the starting leaf positions for the next map. The resulting model is non-convex but smooth, and therefore we solve it by local searches from a variety of starting positions. We improve solution time by a custom decomposition approach which allows us to decouple the rows of the fluence maps and solve each leaf pair individually. This decomposition also makes the problem easily parallelized. Results: We demonstrate method on a prostate case and a head-and-neck case and show that one can recreate fluence maps to high degree of fidelity in modest total delivery time (minutes). Conclusion: We present a VMAT sequencing method that reproduces optimal fluence maps by searching over a vast number of possible leaf trajectories. By varying the total allotted time given, this approach is the first of its kind to allow users to produce VMAT solutions that span the range of wide-field coarse VMAT deliveries to narrow-field high-MU sliding window-like approaches.« less

Mission Design, Guidance, and Navigation of a Callisto-Io-Ganymede Triple Flyby Jovian Capture

NASA Astrophysics Data System (ADS)

Didion, Alan M.

Use of a triple-satellite-aided capture maneuver to enter Jovian orbit reduces insertion DeltaV and provides close flyby science opportunities at three of Jupiter's four large Galilean moons. This capture can be performed while maintaining appropriate Jupiter standoff distance and setting up a suitable apojove for plotting an extended tour. This paper has three main chapters, the first of which discusses the design and optimization of a triple-flyby capture trajectory. A novel triple-satellite-aided capture uses sequential flybys of Callisto, Io, and Ganymede to reduce the DeltaV required to capture into orbit about Jupiter. An optimal broken-plane maneuver is added between Earth and Jupiter to form a complete chemical/impulsive interplanetary trajectory from Earth to Jupiter. Such a trajectory can yield significant fuel savings over single and double-flyby capture schemes while maintaining a brief and simple interplanetary transfer phase. The second chapter focuses on the guidance and navigation of such trajectories in the presence of spacecraft navigation errors, ephemeris errors, and maneuver execution errors. A powered-flyby trajectory correction maneuver (TCM) is added to the nominal trajectory at Callisto and the nominal Jupiter orbit insertion (JOI) maneuver is modified to both complete the capture and target the Ganymede flyby. A third TCM is employed after all the flybys to act as a JOI cleanup maneuver. A Monte Carlo simulation shows that the statistical DeltaV required to correct the trajectory is quite manageable and the flyby characteristics are very consistent. The developed methods maintain flexibility for adaptation to similar launch, cruise, and capture conditions. The third chapter details the methodology and results behind a completely separate project to design and optimize an Earth-orbiting three satellite constellation to perform very long baseline interferometry (VLBI) as part of the 8th annual Global Trajectory Optimisation Competition (GTOC8). A script is designed to simulate the prescribed constellation and record its observations; the observations made are scored according to a provided performance index.

Stability Assessment as a Criterion of Stabilization of the Movement Trajectory of Mobile Crane Working Elements

NASA Astrophysics Data System (ADS)

Kacalak, W.; Budniak, Z.; Majewski, M.

2018-02-01

The article presents a stability assessment method of the mobile crane handling system based on the safety indicator values that were accepted as the trajectory optimization criterion. With the use of the mathematical model built and the model built in the integrated CAD/CAE environment, analyses were conducted of the displacements of the mass centre of the crane system, reactions of the outrigger system, stabilizing and overturning torques that act on the crane as well as the safety indicator values for the given movement trajectories of the crane working elements.

Optimizing Mars Airplane Trajectory with the Application Navigation System

NASA Technical Reports Server (NTRS)

Frumkin, Michael; Riley, Derek

2004-01-01

Planning complex missions requires a number of programs to be executed in concert. The Application Navigation System (ANS), developed in the NAS Division, can execute many interdependent programs in a distributed environment. We show that the ANS simplifies user effort and reduces time in optimization of the trajectory of a martian airplane. We use a software package, Cart3D, to evaluate trajectories and a shortest path algorithm to determine the optimal trajectory. ANS employs the GridScape to represent the dynamic state of the available computer resources. Then, ANS uses a scheduler to dynamically assign ready task to machine resources and the GridScape for tracking available resources and forecasting completion time of running tasks. We demonstrate system capability to schedule and run the trajectory optimization application with efficiency exceeding 60% on 64 processors.

Reactive Collision Avoidance Algorithm

NASA Technical Reports Server (NTRS)

Scharf, Daniel; Acikmese, Behcet; Ploen, Scott; Hadaegh, Fred

2010-01-01

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

A genetic technique for planning a control sequence to navigate the state space with a quasi-minimum-cost output trajectory for a non-linear multi-dimnensional system

NASA Technical Reports Server (NTRS)

Hein, C.; Meystel, A.

1994-01-01

There are many multi-stage optimization problems that are not easily solved through any known direct method when the stages are coupled. For instance, we have investigated the problem of planning a vehicle's control sequence to negotiate obstacles and reach a goal in minimum time. The vehicle has a known mass, and the controlling forces have finite limits. We have developed a technique that finds admissible control trajectories which tend to minimize the vehicle's transit time through the obstacle field. The immediate applications is that of a space robot which must rapidly traverse around 2-or-3 dimensional structures via application of a rotating thruster or non-rotating on-off for such vehicles is located at the Marshall Space Flight Center in Huntsville Alabama. However, it appears that the development method is applicable to a general set of optimization problems in which the cost function and the multi-dimensional multi-state system can be any nonlinear functions, which are continuous in the operating regions. Other applications included the planning of optimal navigation pathways through a transversability graph; the planning of control input for under-water maneuvering vehicles which have complex control state-space relationships; the planning of control sequences for milling and manufacturing robots; the planning of control and trajectories for automated delivery vehicles; and the optimization and athletic training in slalom sports.

Program manual for ASTOP, an Arbitrary space trajectory optimization program

NASA Technical Reports Server (NTRS)

Horsewood, J. L.

1974-01-01

The ASTOP program (an Arbitrary Space Trajectory Optimization Program) designed to generate optimum low-thrust trajectories in an N-body field while satisfying selected hardware and operational constraints is presented. The trajectory is divided into a number of segments or arcs over which the control is held constant. This constant control over each arc is optimized using a parameter optimization scheme based on gradient techniques. A modified Encke formulation of the equations of motion is employed. The program provides a wide range of constraint, end conditions, and performance index options. The basic approach is conducive to future expansion of features such as the incorporation of new constraints and the addition of new end conditions.

Assessment and Verification of SLS Block 1-B Exploration Upper Stage State and Stage Disposal Performance

NASA Technical Reports Server (NTRS)

Patrick, Sean; Oliver, Emerson

2018-01-01

One of the SLS Navigation System's key performance requirements is a constraint on the payload system's delta-v allocation to correct for insertion errors due to vehicle state uncertainty at payload separation. The SLS navigation team has developed a Delta-Delta-V analysis approach to assess the effect on trajectory correction maneuver (TCM) design needed to correct for navigation errors. This approach differs from traditional covariance analysis based methods and makes no assumptions with regard to the propagation of the state dynamics. This allows for consideration of non-linearity in the propagation of state uncertainties. The Delta-Delta-V analysis approach re-optimizes perturbed SLS mission trajectories by varying key mission states in accordance with an assumed state error. The state error is developed from detailed vehicle 6-DOF Monte Carlo analysis or generated using covariance analysis. These perturbed trajectories are compared to a nominal trajectory to determine necessary TCM design. To implement this analysis approach, a tool set was developed which combines the functionality of a 3-DOF trajectory optimization tool, Copernicus, and a detailed 6-DOF vehicle simulation tool, Marshall Aerospace Vehicle Representation in C (MAVERIC). In addition to delta-v allocation constraints on SLS navigation performance, SLS mission requirement dictate successful upper stage disposal. Due to engine and propellant constraints, the SLS Exploration Upper Stage (EUS) must dispose into heliocentric space by means of a lunar fly-by maneuver. As with payload delta-v allocation, upper stage disposal maneuvers must place the EUS on a trajectory that maximizes the probability of achieving a heliocentric orbit post Lunar fly-by considering all sources of vehicle state uncertainty prior to the maneuver. To ensure disposal, the SLS navigation team has developed an analysis approach to derive optimal disposal guidance targets. This approach maximizes the state error covariance prior to the maneuver to develop and re-optimize a nominal disposal maneuver (DM) target that, if achieved, would maximize the potential for successful upper stage disposal. For EUS disposal analysis, a set of two tools was developed. The first considers only the nominal pre-disposal maneuver state, vehicle constraints, and an a priori estimate of the state error covariance. In the analysis, the optimal nominal disposal target is determined. This is performed by re-formulating the trajectory optimization to consider constraints on the eigenvectors of the error ellipse applied to the nominal trajectory. A bisection search methodology is implemented in the tool to refine these dispersions resulting in the maximum dispersion feasible for successful disposal via lunar fly-by. Success is defined based on the probability that the vehicle will not impact the lunar surface and will achieve a characteristic energy (C3) relative to the Earth such that it is no longer in the Earth-Moon system. The second tool propagates post-disposal maneuver states to determine the success of disposal for provided trajectory achieved states. This is performed using the optimized nominal target within the 6-DOF vehicle simulation. This paper will discuss the application of the Delta-Delta-V analysis approach for performance evaluation as well as trajectory re-optimization so as to demonstrate the system's capability in meeting performance constraints. Additionally, further discussion of the implementation of assessing disposal analysis will be provided.

Performance evaluation of the inverse dynamics method for optimal spacecraft reorientation

NASA Astrophysics Data System (ADS)

Ventura, Jacopo; Romano, Marcello; Walter, Ulrich

2015-05-01

This paper investigates the application of the inverse dynamics in the virtual domain method to Euler angles, quaternions, and modified Rodrigues parameters for rapid optimal attitude trajectory generation for spacecraft reorientation maneuvers. The impact of the virtual domain and attitude representation is numerically investigated for both minimum time and minimum energy problems. Owing to the nature of the inverse dynamics method, it yields sub-optimal solutions for minimum time problems. Furthermore, the virtual domain improves the optimality of the solution, but at the cost of more computational time. The attitude representation also affects solution quality and computational speed. For minimum energy problems, the optimal solution can be obtained without the virtual domain with any considered attitude representation.

Trajectory Optimization of Electric Aircraft Subject to Subsystem Thermal Constraints

NASA Technical Reports Server (NTRS)

Falck, Robert D.; Chin, Jeffrey C.; Schnulo, Sydney L.; Burt, Jonathan M.; Gray, Justin S.

2017-01-01

Electric aircraft pose a unique design challenge in that they lack a simple way to reject waste heat from the power train. While conventional aircraft reject most of their excess heat in the exhaust stream, for electric aircraft this is not an option. To examine the implications of this challenge on electric aircraft design and performance, we developed a model of the electric subsystems for the NASA X-57 electric testbed aircraft. We then coupled this model with a model of simple 2D aircraft dynamics and used a Legendre-Gauss-Lobatto collocation optimal control approach to find optimal trajectories for the aircraft with and without thermal constraints. The results show that the X-57 heat rejection systems are well designed for maximum-range and maximum-efficiency flight, without the need to deviate from an optimal trajectory. Stressing the thermal constraints by reducing the cooling capacity or requiring faster flight has a minimal impact on performance, as the trajectory optimization technique is able to find flight paths which honor the thermal constraints with relatively minor deviations from the nominal optimal trajectory.

Swing-leg trajectory of running guinea fowl suggests task-level priority of force regulation rather than disturbance rejection.

PubMed

Blum, Yvonne; Vejdani, Hamid R; Birn-Jeffery, Aleksandra V; Hubicki, Christian M; Hurst, Jonathan W; Daley, Monica A

2014-01-01

To achieve robust and stable legged locomotion in uneven terrain, animals must effectively coordinate limb swing and stance phases, which involve distinct yet coupled dynamics. Recent theoretical studies have highlighted the critical influence of swing-leg trajectory on stability, disturbance rejection, leg loading and economy of walking and running. Yet, simulations suggest that not all these factors can be simultaneously optimized. A potential trade-off arises between the optimal swing-leg trajectory for disturbance rejection (to maintain steady gait) versus regulation of leg loading (for injury avoidance and economy). Here we investigate how running guinea fowl manage this potential trade-off by comparing experimental data to predictions of hypothesis-based simulations of running over a terrain drop perturbation. We use a simple model to predict swing-leg trajectory and running dynamics. In simulations, we generate optimized swing-leg trajectories based upon specific hypotheses for task-level control priorities. We optimized swing trajectories to achieve i) constant peak force, ii) constant axial impulse, or iii) perfect disturbance rejection (steady gait) in the stance following a terrain drop. We compare simulation predictions to experimental data on guinea fowl running over a visible step down. Swing and stance dynamics of running guinea fowl closely match simulations optimized to regulate leg loading (priorities i and ii), and do not match the simulations optimized for disturbance rejection (priority iii). The simulations reinforce previous findings that swing-leg trajectory targeting disturbance rejection demands large increases in stance leg force following a terrain drop. Guinea fowl negotiate a downward step using unsteady dynamics with forward acceleration, and recover to steady gait in subsequent steps. Our results suggest that guinea fowl use swing-leg trajectory consistent with priority for load regulation, and not for steadiness of gait. Swing-leg trajectory optimized for load regulation may facilitate economy and injury avoidance in uneven terrain.

Swing-Leg Trajectory of Running Guinea Fowl Suggests Task-Level Priority of Force Regulation Rather than Disturbance Rejection

PubMed Central

Blum, Yvonne; Vejdani, Hamid R.; Birn-Jeffery, Aleksandra V.; Hubicki, Christian M.; Hurst, Jonathan W.; Daley, Monica A.

2014-01-01

To achieve robust and stable legged locomotion in uneven terrain, animals must effectively coordinate limb swing and stance phases, which involve distinct yet coupled dynamics. Recent theoretical studies have highlighted the critical influence of swing-leg trajectory on stability, disturbance rejection, leg loading and economy of walking and running. Yet, simulations suggest that not all these factors can be simultaneously optimized. A potential trade-off arises between the optimal swing-leg trajectory for disturbance rejection (to maintain steady gait) versus regulation of leg loading (for injury avoidance and economy). Here we investigate how running guinea fowl manage this potential trade-off by comparing experimental data to predictions of hypothesis-based simulations of running over a terrain drop perturbation. We use a simple model to predict swing-leg trajectory and running dynamics. In simulations, we generate optimized swing-leg trajectories based upon specific hypotheses for task-level control priorities. We optimized swing trajectories to achieve i) constant peak force, ii) constant axial impulse, or iii) perfect disturbance rejection (steady gait) in the stance following a terrain drop. We compare simulation predictions to experimental data on guinea fowl running over a visible step down. Swing and stance dynamics of running guinea fowl closely match simulations optimized to regulate leg loading (priorities i and ii), and do not match the simulations optimized for disturbance rejection (priority iii). The simulations reinforce previous findings that swing-leg trajectory targeting disturbance rejection demands large increases in stance leg force following a terrain drop. Guinea fowl negotiate a downward step using unsteady dynamics with forward acceleration, and recover to steady gait in subsequent steps. Our results suggest that guinea fowl use swing-leg trajectory consistent with priority for load regulation, and not for steadiness of gait. Swing-leg trajectory optimized for load regulation may facilitate economy and injury avoidance in uneven terrain. PMID:24979750

Variational Trajectory Optimization Tool Set: Technical description and user's manual

NASA Technical Reports Server (NTRS)

Bless, Robert R.; Queen, Eric M.; Cavanaugh, Michael D.; Wetzel, Todd A.; Moerder, Daniel D.

1993-01-01

The algorithms that comprise the Variational Trajectory Optimization Tool Set (VTOTS) package are briefly described. The VTOTS is a software package for solving nonlinear constrained optimal control problems from a wide range of engineering and scientific disciplines. The VTOTS package was specifically designed to minimize the amount of user programming; in fact, for problems that may be expressed in terms of analytical functions, the user needs only to define the problem in terms of symbolic variables. This version of the VTOTS does not support tabular data; thus, problems must be expressed in terms of analytical functions. The VTOTS package consists of two methods for solving nonlinear optimal control problems: a time-domain finite-element algorithm and a multiple shooting algorithm. These two algorithms, under the VTOTS package, may be run independently or jointly. The finite-element algorithm generates approximate solutions, whereas the shooting algorithm provides a more accurate solution to the optimization problem. A user's manual, some examples with results, and a brief description of the individual subroutines are included.

Lane changing trajectory planning and tracking control for intelligent vehicle on curved road.

PubMed

Wang, Lukun; Zhao, Xiaoying; Su, Hao; Tang, Gongyou

2016-01-01

This paper explores lane changing trajectory planning and tracking control for intelligent vehicle on curved road. A novel arcs trajectory is planned for the desired lane changing trajectory. A kinematic controller and a dynamics controller are designed to implement the trajectory tracking control. Firstly, the kinematic model and dynamics model of intelligent vehicle with non-holonomic constraint are established. Secondly, two constraints of lane changing on curved road in practice (LCCP) are proposed. Thirdly, two arcs with same curvature are constructed for the desired lane changing trajectory. According to the geometrical characteristics of arcs trajectory, equations of desired state can be calculated. Finally, the backstepping method is employed to design a kinematic trajectory tracking controller. Then the sliding-mode dynamics controller is designed to ensure that the motion of the intelligent vehicle can follow the desired velocity generated by kinematic controller. The stability of control system is proved by Lyapunov theory. Computer simulation demonstrates that the desired arcs trajectory and state curves with B-spline optimization can meet the requirements of LCCP constraints and the proposed control schemes can make tracking errors to converge uniformly.

Optimal control of 2-wheeled mobile robot at energy performance index

NASA Astrophysics Data System (ADS)

Kaliński, Krzysztof J.; Mazur, Michał

2016-03-01

The paper presents the application of the optimal control method at the energy performance index towards motion control of the 2-wheeled mobile robot. With the use of the proposed method of control the 2-wheeled mobile robot can realise effectively the desired trajectory. The problem of motion control of mobile robots is usually neglected and thus performance of the realisation of the high level control tasks is limited.

Aircraft Trajectories Computation-Prediction-Control. Volume 1 (La Trajectoire de l’Avion Calcul-Prediction-Controle)

DTIC Science & Technology

1990-03-01

knowledge covering problems of this type is called calculus of variations or optimal control theory (Refs. 1-8). As stated before, appli - cations occur...to the optimality conditions and the feasibility equations of Problem (GP), respectively. Clearly, after the transformation (26) is applied , the...trajectories, the primal sequential gradient-restoration algorithm (PSGRA) is applied to compute optimal trajectories for aeroassisted orbital transfer

Fast three-dimensional inner volume excitations using parallel transmission and optimized k-space trajectories.

PubMed

Davids, Mathias; Schad, Lothar R; Wald, Lawrence L; Guérin, Bastien

2016-10-01

To design short parallel transmission (pTx) pulses for excitation of arbitrary three-dimensional (3D) magnetization patterns. We propose a joint optimization of the pTx radiofrequency (RF) and gradient waveforms for excitation of arbitrary 3D magnetization patterns. Our optimization of the gradient waveforms is based on the parameterization of k-space trajectories (3D shells, stack-of-spirals, and cross) using a small number of shape parameters that are well-suited for optimization. The resulting trajectories are smooth and sample k-space efficiently with few turns while using the gradient system at maximum performance. Within each iteration of the k-space trajectory optimization, we solve a small tip angle least-squares RF pulse design problem. Our RF pulse optimization framework was evaluated both in Bloch simulations and experiments on a 7T scanner with eight transmit channels. Using an optimized 3D cross (shells) trajectory, we were able to excite a cube shape (brain shape) with 3.4% (6.2%) normalized root-mean-square error in less than 5 ms using eight pTx channels and a clinical gradient system (Gmax  = 40 mT/m, Smax  = 150 T/m/s). This compared with 4.7% (41.2%) error for the unoptimized 3D cross (shells) trajectory. Incorporation of B0 robustness in the pulse design significantly altered the k-space trajectory solutions. Our joint gradient and RF optimization approach yields excellent excitation of 3D cube and brain shapes in less than 5 ms, which can be used for reduced field of view imaging and fat suppression in spectroscopy by excitation of the brain only. Magn Reson Med 76:1170-1182, 2016. © 2015 Wiley Periodicals, Inc. © 2015 Wiley Periodicals, Inc.

Low-Thrust Many-Revolution Trajectory Optimization via Differential Dynamic Programming and a Sundman Transformation

NASA Technical Reports Server (NTRS)

Aziz, Jonathan D.; Parker, Jeffrey S.; Scheeres, Daniel J.; Englander, Jacob A.

2017-01-01

Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to the eccentric anomaly and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are shown in excess of 1000 revolutions while subject to Earths J2 perturbation and lunar gravity.

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

NASA Technical Reports Server (NTRS)

Ng, Hok Kwan; Sridhar, Banavar

2016-01-01

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

OPTIMAL AIRCRAFT TRAJECTORIES FOR SPECIFIED RANGE

NASA Technical Reports Server (NTRS)

Lee, H.

1994-01-01

For an aircraft operating over a fixed range, the operating costs are basically a sum of fuel cost and time cost. While minimum fuel and minimum time trajectories are relatively easy to calculate, the determination of a minimum cost trajectory can be a complex undertaking. This computer program was developed to optimize trajectories with respect to a cost function based on a weighted sum of fuel cost and time cost. As a research tool, the program could be used to study various characteristics of optimum trajectories and their comparison to standard trajectories. It might also be used to generate a model for the development of an airborne trajectory optimization system. The program could be incorporated into an airline flight planning system, with optimum flight plans determined at takeoff time for the prevailing flight conditions. The use of trajectory optimization could significantly reduce the cost for a given aircraft mission. The algorithm incorporated in the program assumes that a trajectory consists of climb, cruise, and descent segments. The optimization of each segment is not done independently, as in classical procedures, but is performed in a manner which accounts for interaction between the segments. This is accomplished by the application of optimal control theory. The climb and descent profiles are generated by integrating a set of kinematic and dynamic equations, where the total energy of the aircraft is the independent variable. At each energy level of the climb and descent profiles, the air speed and power setting necessary for an optimal trajectory are determined. The variational Hamiltonian of the problem consists of the rate of change of cost with respect to total energy and a term dependent on the adjoint variable, which is identical to the optimum cruise cost at a specified altitude. This variable uniquely specifies the optimal cruise energy, cruise altitude, cruise Mach number, and, indirectly, the climb and descent profiles. If the optimum cruise cost is specified, an optimum trajectory can easily be generated; however, the range obtained for a particular optimum cruise cost is not known a priori. For short range flights, the program iteratively varies the optimum cruise cost until the computed range converges to the specified range. For long-range flights, iteration is unnecessary since the specified range can be divided into a cruise segment distance and full climb and descent distances. The user must supply the program with engine fuel flow rate coefficients and an aircraft aerodynamic model. The program currently includes coefficients for the Pratt-Whitney JT8D-7 engine and an aerodynamic model for the Boeing 727. Input to the program consists of the flight range to be covered and the prevailing flight conditions including pressure, temperature, and wind profiles. Information output by the program includes: optimum cruise tables at selected weights, optimal cruise quantities as a function of cruise weight and cruise distance, climb and descent profiles, and a summary of the complete synthesized optimal trajectory. This program is written in FORTRAN IV for batch execution and has been implemented on a CDC 6000 series computer with a central memory requirement of approximately 100K (octal) of 60 bit words. This aircraft trajectory optimization program was developed in 1979.

On the Optimization of Aerospace Plane Ascent Trajectory

NASA Astrophysics Data System (ADS)

Al-Garni, Ahmed; Kassem, Ayman Hamdy

A hybrid heuristic optimization technique based on genetic algorithms and particle swarm optimization has been developed and tested for trajectory optimization problems with multi-constraints and a multi-objective cost function. The technique is used to calculate control settings for two types for ascending trajectories (constant dynamic pressure and minimum-fuel-minimum-heat) for a two-dimensional model of an aerospace plane. A thorough statistical analysis is done on the hybrid technique to make comparisons with both basic genetic algorithms and particle swarm optimization techniques with respect to convergence and execution time. Genetic algorithm optimization showed better execution time performance while particle swarm optimization showed better convergence performance. The hybrid optimization technique, benefiting from both techniques, showed superior robust performance compromising convergence trends and execution time.

The Development of NASA's Low Thrust Trajectory Tool Set

NASA Technical Reports Server (NTRS)

Sims, Jon; Artis, Gwen; Kos, Larry

2006-01-01

Highly efficient electric propulsion systems can enable interesting classes of missions; unfortunately, they provide only a limited amount of thrust. Low-thrust (LT) trajectories are much more difficult to design than impulsive-type (chemical propulsion) trajectories. Previous low-thrust (LT) trajectory optimization software was often difficult to use, often had difficulties converging, and was somewhat limited in the types of missions it could support. A new state-of-the-art suite (toolbox) of low-thrust (LT) tools along with improved algorithms and methods was developed by NASA's MSFC, JPL, JSC, and GRC to address the needs of our customers to help foster technology development in the areas of advanced LT propulsion systems, and to facilitate generation of similar results by different analysts.

Minimum fuel trajectory for the aerospace-plane

NASA Technical Reports Server (NTRS)

Breakwell, John V.; Golan, Oded; Sauvageot, Anne

1990-01-01

An overall trajectory for a single-stage-to-orbit vehicle with an initial weight of 234 tons is calculated, and four different propulsion models including turbojet, ramjet, scramjet, and rocket are considered. First, the atmospheric flight in the thicker atmosphere is discussed with emphasis on trajectory optimization, optimization problem, aerodynamic problem, propulsion model, and initial conditions. The performance of turbojet and ramjet-scramjet engines is analyzed; and then the flight to orbit is assessed from the optimization point of view. It is shown that roll modulation saves little during the trajectory, and the combined application of airbreathing propulsion and aerodynamic lift is suggested.

Optimal trajectories for the aeroassisted flight experiment. Part 4: Data, tables, and graphs

NASA Technical Reports Server (NTRS)

Miele, A.; Wang, T.; Lee, W. Y.; Wang, H.; Wu, G. D.

1989-01-01

The determination of optimal trajectories for the aeroassisted flight experiment (AFE) is discussed. Data, tables, and graphs relative to the following transfers are presented: (IA) indirect ascent to a 178 NM perigee via a 197 NM apogee; and (DA) direct ascent to a 178 NM apogee. For both transfers, two cases are investigated: (1) the bank angle is continuously variable; and (2) the trajectory is divided into segments along which the bank angle is constant. For case (2), the following subcases are studied: two segments, three segments, four segments, and five segments; because the time duration of each segment is optimized, the above subcases involve four, six, eight, and ten parameters, respectively. Presented here are systematic data on a total of ten optimal trajectories (OT), five for Transfer IA and five for Transfer DA. For comparison purposes and only for Transfer IA, a five-segment reference trajectory RT is also considered.

A comparison of time-optimal interception trajectories for the F-8 and F-15

NASA Technical Reports Server (NTRS)

Calise, Anthony J.; Pettengill, James B.

1990-01-01

The simulation results of a real time control algorithm for onboard computation of time-optimal intercept trajectories for the F-8 and F-15 aircraft are given. Due to the inherent aerodynamic and propulsion differences in the aircraft, there are major differences in their optimal trajectories. The significant difference in the two aircrafts are their flight envelopes. The F-8's optimal cruise velocity is thrust limited, while the F-15's optimal cruise velocity is at the intersection of the Mach and dynamic pressure constraint boundaries. This inherent difference necessitated the development of a proportional thrust controller for use as the F-15 approaches it's optimal cruise energy. Documented here is the application of singular perturbation theory to the trajectory optimization problem, along with a summary of the control algorithms. Numerical results for the two aircraft are compared to illustrate the performance of the minimum time algorithm, and to compute the resulting flight paths.

Design of Quiet Rotorcraft Approach Trajectories: Verification Phase

NASA Technical Reports Server (NTRS)

Padula, Sharon L.

2010-01-01

Flight testing that is planned for October 2010 will provide an opportunity to evaluate rotorcraft trajectory optimization techniques. The flight test will involve a fully instrumented MD-902 helicopter, which will be flown over an array of microphones. In this work, the helicopter approach trajectory is optimized via a multiobjective genetic algorithm to improve community noise, passenger comfort, and pilot acceptance. Previously developed optimization strategies are modified to accommodate new helicopter data and to increase pilot acceptance. This paper describes the MD-902 trajectory optimization plus general optimization strategies and modifications that are needed to reduce the uncertainty in noise predictions. The constraints that are imposed by the flight test conditions and characteristics of the MD-902 helicopter limit the testing possibilities. However, the insights that will be gained through this research will prove highly valuable.

Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems

NASA Astrophysics Data System (ADS)

Tobasco, Ian; Goluskin, David; Doering, Charles R.

2018-02-01

For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper bounds on time averages can be proved a priori using auxiliary functions, the optimal choice of which is a convex optimization problem. We prove that the problems of finding maximal trajectories and minimal auxiliary functions are strongly dual. Thus, auxiliary functions provide arbitrarily sharp upper bounds on time averages. Moreover, any nearly minimal auxiliary function provides phase space volumes in which all nearly maximal trajectories are guaranteed to lie. For polynomial equations, auxiliary functions can be constructed by semidefinite programming, which we illustrate using the Lorenz system.

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

NASA Technical Reports Server (NTRS)

Blackmore, Lars

2008-01-01

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

TH-EF-BRB-10: Dosimetric Validation of a Trajectory Based Cranial SRS Treatment Technique On a Varian TrueBeam Linac

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilson, B; Vancouver Cancer Centre, Vancouver, BC; Gete, E

2016-06-15

Purpose: This work investigates the dosimetric accuracy of a trajectory based delivery technique in which an optimized radiation beam is delivered along a Couch-Gantry trajectory that is formed by simultaneous rotation of the linac gantry and the treatment couch. Methods: Nine trajectory based cranial SRS treatment plans were created using in-house optimization software. The plans were calculated for delivery on the TrueBeam STx linac with 6MV photon beam. Dose optimization was performed along a user-defined trajectory using MLC modulation, dose rate modulation and jaw tracking. The pre-defined trajectory chosen for this study is formed by a couch rotation through itsmore » full range of 180 degrees while the gantry makes four partial arc sweeps which are 170 degrees each. For final dose calculation, the trajectory based plans were exported to the Varian Eclipse Treatment Planning System. The plans were calculated on a homogeneous cube phantom measuring 18.2×18.2×18.2 cm3 with the analytical anisotropic algorithm (AAA) using a 1mm3 calculation voxel. The plans were delivered on the TrueBeam linac via the developer’s mode. Point dose measurements were performed on 9 patients with the IBA CC01 mini-chamber with a sensitive volume of 0.01 cc. Gafchromic film measurements along the sagittal and coronal planes were performed on three of the 9 treatment plans. Point dose values were compared with ion chamber measurements. Gamma analysis comparing film measurement and AAA calculations was performed using FilmQA Pro. Results: The AAA calculations and measurements were in good agreement. The point dose difference between AAA and ion chamber measurements were within 2.2%. Gamma analysis test pass rates (2%, 2mm passing criteria) for the Gafchromic film measurements were >95%. Conclusion: We have successfully tested TrueBeam’s ability to deliver accurate trajectory based treatments involving simultaneous gantry and couch rotation with MLC and dose rate modulation along the trajectory.« less

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

NASA Technical Reports Server (NTRS)

Parrish, Nathan L.; Scheeres, Daniel J.

2017-01-01

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.

L^1 -optimality conditions for the circular restricted three-body problem

NASA Astrophysics Data System (ADS)

Chen, Zheng

2016-11-01

In this paper, the L^1 -minimization for the translational motion of a spacecraft in the circular restricted three-body problem (CRTBP) is considered. Necessary conditions are derived by using the Pontryagin Maximum Principle (PMP), revealing the existence of bang-bang and singular controls. Singular extremals are analyzed, recalling the existence of the Fuller phenomenon according to the theories developed in (Marchal in J Optim Theory Appl 11(5):441-486, 1973; Zelikin and Borisov in Theory of Chattering Control with Applications to Astronautics, Robotics, Economics, and Engineering. Birkhäuser, Basal 1994; in J Math Sci 114(3):1227-1344, 2003). The sufficient optimality conditions for the L^1 -minimization problem with fixed endpoints have been developed in (Chen et al. in SIAM J Control Optim 54(3):1245-1265, 2016). In the current paper, we establish second-order conditions for optimal control problems with more general final conditions defined by a smooth submanifold target. In addition, the numerical implementation to check these optimality conditions is given. Finally, approximating the Earth-Moon-Spacecraft system by the CRTBP, an L^1 -minimization trajectory for the translational motion of a spacecraft is computed by combining a shooting method with a continuation method in (Caillau et al. in Celest Mech Dyn Astron 114:137-150, 2012; Caillau and Daoud in SIAM J Control Optim 50(6):3178-3202, 2012). The local optimality of the computed trajectory is asserted thanks to the second-order optimality conditions developed.

Design and optimal control of on-orbit servicing trajectory for target vehicle in non-coplanar elliptical orbit

NASA Astrophysics Data System (ADS)

Zhou, Wenyong; Yuan, Jianping; Luo, Jianjun

2005-11-01

Autonomous on-orbit servicing provides flexibility to space systems and has great value both in civil and in military. When a satellite performs on-orbit servicing tasks, flying around is the basic type of motion. This paper is concerned with the design and control problems of a chaser satellite flying around a target spacecraft in non-coplanar elliptical orbit for a long time. At first, a mathematical model used to design a long-term flying around trajectory is presented, which is applicable to the situation that the target spacecraft flies in an elliptical orbit. The conditions of the target at the centre of the flying around path are deduced. Considering the safety and task requirements, a long-term flying around trajectory is designed. Taking into account perturbations and navigation errors which can cause the trajectory unstable and mission impossible, a two-impulse control method is put forward. Genetic algorithm is used to minimize the cost function which considers fuel consumption and bias simultaneously. Some simulation works are carried out and the results indicate the flying around mathematical model and the trajectory control method can be used in the design and control of a long-term flying around trajectory.

Optimal Output Trajectory Redesign for Invertible Systems

NASA Technical Reports Server (NTRS)

Devasia, S.

1996-01-01

Given a desired output trajectory, inversion-based techniques find input-state trajectories required to exactly track the output. These inversion-based techniques have been successfully applied to the endpoint tracking control of multijoint flexible manipulators and to aircraft control. The specified output trajectory uniquely determines the required input and state trajectories that are found through inversion. These input-state trajectories exactly track the desired output; however, they might not meet acceptable performance requirements. For example, during slewing maneuvers of flexible structures, the structural deformations, which depend on the required state trajectories, may be unacceptably large. Further, the required inputs might cause actuator saturation during an exact tracking maneuver, for example, in the flight control of conventional takeoff and landing aircraft. In such situations, a compromise is desired between the tracking requirement and other goals such as reduction of internal vibrations and prevention of actuator saturation; the desired output trajectory needs to redesigned. Here, we pose the trajectory redesign problem as an optimization of a general quadratic cost function and solve it in the context of linear systems. The solution is obtained as an off-line prefilter of the desired output trajectory. An advantage of our technique is that the prefilter is independent of the particular trajectory. The prefilter can therefore be precomputed, which is a major advantage over other optimization approaches. Previous works have addressed the issue of preshaping inputs to minimize residual and in-maneuver vibrations for flexible structures; Since the command preshaping is computed off-line. Further minimization of optimal quadratic cost functions has also been previously use to preshape command inputs for disturbance rejection. All of these approaches are applicable when the inputs to the system are known a priori. Typically, outputs (not inputs) are specified in tracking problems, and hence the input trajectories have to be computed. The inputs to the system are however, difficult to determine for non-minimum phase systems like flexible structures. One approach to solve this problem is to (1) choose a tracking controller (the desired output trajectory is now an input to the closed-loop system and (2) redesign this input to the closed-loop system. Thus we effectively perform output redesign. These redesigns are however, dependent on the choice of the tracking controllers. Thus the controller optimization and trajectory redesign problems become coupled; this coupled optimization is still an open problem. In contrast, we decouple the trajectory redesign problem from the choice of feedback-based tracking controller. It is noted that our approach remains valid when a particular tracking controller is chosen. In addition, the formulation of our problem not only allows for the minimization of residual vibration as in available techniques but also allows for the optimal reduction fo vibrations during the maneuver, e.g., the altitude control of flexible spacecraft. We begin by formulating the optimal output trajectory redesign problem and then solve it in the context of general linear systems. This theory is then applied to an example flexible structure, and simulation results are provided.

A new optimization tool path planning for 3-axis end milling of free-form surfaces based on efficient machining intervals

NASA Astrophysics Data System (ADS)

Vu, Duy-Duc; Monies, Frédéric; Rubio, Walter

2018-05-01

A large number of studies, based on 3-axis end milling of free-form surfaces, seek to optimize tool path planning. Approaches try to optimize the machining time by reducing the total tool path length while respecting the criterion of the maximum scallop height. Theoretically, the tool path trajectories that remove the most material follow the directions in which the machined width is the largest. The free-form surface is often considered as a single machining area. Therefore, the optimization on the entire surface is limited. Indeed, it is difficult to define tool trajectories with optimal feed directions which generate largest machined widths. Another limiting point of previous approaches for effectively reduce machining time is the inadequate choice of the tool. Researchers use generally a spherical tool on the entire surface. However, the gains proposed by these different methods developed with these tools lead to relatively small time savings. Therefore, this study proposes a new method, using toroidal milling tools, for generating toolpaths in different regions on the machining surface. The surface is divided into several regions based on machining intervals. These intervals ensure that the effective radius of the tool, at each cutter-contact points on the surface, is always greater than the radius of the tool in an optimized feed direction. A parallel plane strategy is then used on the sub-surfaces with an optimal specific feed direction for each sub-surface. This method allows one to mill the entire surface with efficiency greater than with the use of a spherical tool. The proposed method is calculated and modeled using Maple software to find optimal regions and feed directions in each region. This new method is tested on a free-form surface. A comparison is made with a spherical cutter to show the significant gains obtained with a toroidal milling cutter. Comparisons with CAM software and experimental validations are also done. The results show the efficiency of the method.

Exploring the complexity of quantum control optimization trajectories.

PubMed

Nanduri, Arun; Shir, Ofer M; Donovan, Ashley; Ho, Tak-San; Rabitz, Herschel

2015-01-07

The control of quantum system dynamics is generally performed by seeking a suitable applied field. The physical objective as a functional of the field forms the quantum control landscape, whose topology, under certain conditions, has been shown to contain no critical point suboptimal traps, thereby enabling effective searches for fields that give the global maximum of the objective. This paper addresses the structure of the landscape as a complement to topological critical point features. Recent work showed that landscape structure is highly favorable for optimization of state-to-state transition probabilities, in that gradient-based control trajectories to the global maximum value are nearly straight paths. The landscape structure is codified in the metric R ≥ 1.0, defined as the ratio of the length of the control trajectory to the Euclidean distance between the initial and optimal controls. A value of R = 1 would indicate an exactly straight trajectory to the optimal observable value. This paper extends the state-to-state transition probability results to the quantum ensemble and unitary transformation control landscapes. Again, nearly straight trajectories predominate, and we demonstrate that R can take values approaching 1.0 with high precision. However, the interplay of optimization trajectories with critical saddle submanifolds is found to influence landscape structure. A fundamental relationship necessary for perfectly straight gradient-based control trajectories is derived, wherein the gradient on the quantum control landscape must be an eigenfunction of the Hessian. This relation is an indicator of landscape structure and may provide a means to identify physical conditions when control trajectories can achieve perfect linearity. The collective favorable landscape topology and structure provide a foundation to understand why optimal quantum control can be readily achieved.

Spatial-temporal travel pattern mining using massive taxi trajectory data

NASA Astrophysics Data System (ADS)

Zheng, Linjiang; Xia, Dong; Zhao, Xin; Tan, Longyou; Li, Hang; Chen, Li; Liu, Weining

2018-07-01

Deep understanding of residents' travel patterns would provide helpful insights into the mechanisms of many socioeconomic phenomena. With the rapid development of location-aware computing technologies, researchers have easy access to large quantities of travel data. As an important data source, taxi trajectory data are featured by their high quality, good continuity and wide distribution, making it suitable for travel pattern mining. In this paper, we use taxi trajectory data to study spatial-temporal characterization of urban residents' travel patterns from two aspects: attractive areas and hot paths. Firstly, a framework of trajectory preprocessing, including data cleaning and extracting the taxi passenger pick-up/drop-off points, is presented to reduce the noise and redundancy in raw trajectory data. Then, a grid density based clustering algorithm is proposed to discover travel attractive areas in different periods of a day. On this basis, we put forward a spatial-temporal trajectory clustering method to discover hot paths among travel attractive areas. Compared with previous algorithms, which only consider the spatial constraint between trajectories, temporal constraint is also considered in our method. Through the experiments, we discuss how to determine the optimal parameters of the two clustering algorithms and verify the effectiveness of the algorithms using real data. Furthermore, we analyze spatial-temporal characterization of Chongqing residents' travel pattern.

A novel method for trajectory planning of cooperative mobile manipulators.

PubMed

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method.

A Novel Method for Trajectory Planning of Cooperative Mobile Manipulators

PubMed Central

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method. PMID:22606656

A parametric sensitivity study for single-stage-to-orbit hypersonic vehicles using trajectory optimization

NASA Astrophysics Data System (ADS)

Lovell, T. Alan; Schmidt, D. K.

1994-03-01

The class of hypersonic vehicle configurations with single stage-to-orbit (SSTO) capability reflect highly integrated airframe and propulsion systems. These designs are also known to exhibit a large degree of interaction between the airframe and engine dynamics. Consequently, even simplified hypersonic models are characterized by tightly coupled nonlinear equations of motion. In addition, hypersonic SSTO vehicles present a major system design challenge; the vehicle's overall mission performance is a function of its subsystem efficiencies including structural, aerodynamic, propulsive, and operational. Further, all subsystem efficiencies are interrelated, hence, independent optimization of the subsystems is not likely to lead to an optimum design. Thus, it is desired to know the effect of various subsystem efficiencies on overall mission performance. For the purposes of this analysis, mission performance will be measured in terms of the payload weight inserted into orbit. In this report, a trajectory optimization problem is formulated for a generic hypersonic lifting body for a specified orbit-injection mission. A solution method is outlined, and results are detailed for the generic vehicle, referred to as the baseline model. After evaluating the performance of the baseline model, a sensitivity study is presented to determine the effect of various subsystem efficiencies on mission performance. This consists of performing a parametric analysis of the basic design parameters, generating a matrix of configurations, and determining the mission performance of each configuration. Also, the performance loss due to constraining the total head load experienced by the vehicle is evaluated. The key results from this analysis include the formulation of the sizing problem for this vehicle class using trajectory optimization, characteristics of the optimal trajectories, and the subsystem design sensitivities.

A parametric sensitivity study for single-stage-to-orbit hypersonic vehicles using trajectory optimization

NASA Technical Reports Server (NTRS)

Lovell, T. Alan; Schmidt, D. K.

1994-01-01

The class of hypersonic vehicle configurations with single stage-to-orbit (SSTO) capability reflect highly integrated airframe and propulsion systems. These designs are also known to exhibit a large degree of interaction between the airframe and engine dynamics. Consequently, even simplified hypersonic models are characterized by tightly coupled nonlinear equations of motion. In addition, hypersonic SSTO vehicles present a major system design challenge; the vehicle's overall mission performance is a function of its subsystem efficiencies including structural, aerodynamic, propulsive, and operational. Further, all subsystem efficiencies are interrelated, hence, independent optimization of the subsystems is not likely to lead to an optimum design. Thus, it is desired to know the effect of various subsystem efficiencies on overall mission performance. For the purposes of this analysis, mission performance will be measured in terms of the payload weight inserted into orbit. In this report, a trajectory optimization problem is formulated for a generic hypersonic lifting body for a specified orbit-injection mission. A solution method is outlined, and results are detailed for the generic vehicle, referred to as the baseline model. After evaluating the performance of the baseline model, a sensitivity study is presented to determine the effect of various subsystem efficiencies on mission performance. This consists of performing a parametric analysis of the basic design parameters, generating a matrix of configurations, and determining the mission performance of each configuration. Also, the performance loss due to constraining the total head load experienced by the vehicle is evaluated. The key results from this analysis include the formulation of the sizing problem for this vehicle class using trajectory optimization, characteristics of the optimal trajectories, and the subsystem design sensitivities.

Adaptive density trajectory cluster based on time and space distance

NASA Astrophysics Data System (ADS)

Liu, Fagui; Zhang, Zhijie

2017-10-01

There are some hotspot problems remaining in trajectory cluster for discovering mobile behavior regularity, such as the computation of distance between sub trajectories, the setting of parameter values in cluster algorithm and the uncertainty/boundary problem of data set. As a result, based on the time and space, this paper tries to define the calculation method of distance between sub trajectories. The significance of distance calculation for sub trajectories is to clearly reveal the differences in moving trajectories and to promote the accuracy of cluster algorithm. Besides, a novel adaptive density trajectory cluster algorithm is proposed, in which cluster radius is computed through using the density of data distribution. In addition, cluster centers and number are selected by a certain strategy automatically, and uncertainty/boundary problem of data set is solved by designed weighted rough c-means. Experimental results demonstrate that the proposed algorithm can perform the fuzzy trajectory cluster effectively on the basis of the time and space distance, and obtain the optimal cluster centers and rich cluster results information adaptably for excavating the features of mobile behavior in mobile and sociology network.

Optimal Collision Avoidance Trajectories for Unmanned/Remotely Piloted Aircraft

DTIC Science & Technology

2014-12-26

projected operational tempos (OPTEMPOs)” [15]. The Oce of the Secretary of Defense (OSD) Unmanned Systems Roadmap [15] goes on to say that the airspace...methods [63]. In an indirect method, the researcher derives the first- order necessary conditions for optimality “via the calculus of variations and...region around the ownship using a variation of a superquadric. From [116], the standard equation for a superellipsoid appears as: ✓ x a1 ◆ 2 ✏ 2

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

NASA Technical Reports Server (NTRS)

Hughes, Steven P.; Mailhe, Laurie M.; Guzman, Jose J.

2002-01-01

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

A Time-Regularized, Multiple Gravity-Assist Low-Thrust, Bounded-Impulse Model for Trajectory Optimization

NASA Technical Reports Server (NTRS)

Ellison, Donald H.; Englander, Jacob A.; Conway, Bruce A.

2017-01-01

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Keplers equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Keplers equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

A Time-Regularized Multiple Gravity-Assist Low-Thrust Bounded-Impulse Model for Trajectory Optimization

NASA Technical Reports Server (NTRS)

Ellison, Donald H.; Englander, Jacob A.; Conway, Bruce A.

2017-01-01

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Kepler's equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight-suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Kepler's equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Suborbital spaceplane optimization using non-stationary Gaussian processes

NASA Astrophysics Data System (ADS)

Dufour, Robin; de Muelenaere, Julien; Elham, Ali

2014-10-01

This paper presents multidisciplinary design optimization of a sub-orbital spaceplane. The optimization includes three disciplines: the aerodynamics, the structure and the trajectory. An Adjoint Euler code is used to calculate the aerodynamic lift and drag of the vehicle as well as their derivatives with respect to the design variables. A new surrogate model has been developed based on a non-stationary Gaussian process. That model was used to estimate the aerodynamic characteristics of the vehicle during the trajectory optimization. The trajectory of thevehicle has been optimized together with its geometry in order to maximize the amount of payload that can be carried by the spaceplane.

Optimization of Insertion Cost for Transfer Trajectories to Libration Point Orbits

NASA Technical Reports Server (NTRS)

Howell, K. C.; Wilson, R. S.; Lo, M. W.

1999-01-01

The objective of this work is the development of efficient techniques to optimize the cost associated with transfer trajectories to libration point orbits in the Sun-Earth-Moon four body problem, that may include lunar gravity assists. Initially, dynamical systems theory is used to determine invariant manifolds associated with the desired libration point orbit. These manifolds are employed to produce an initial approximation to the transfer trajectory. Specific trajectory requirements such as, transfer injection constraints, inclusion of phasing loops, and targeting of a specified state on the manifold are then incorporated into the design of the transfer trajectory. A two level differential corrections process is used to produce a fully continuous trajectory that satisfies the design constraints, and includes appropriate lunar and solar gravitational models. Based on this methodology, and using the manifold structure from dynamical systems theory, a technique is presented to optimize the cost associated with insertion onto a specified libration point orbit.

Fuel-conservative guidance system for powered-lift aircraft

NASA Technical Reports Server (NTRS)

Erzberger, H.; Mclean, J. D.

1979-01-01

A concept for automatic terminal area guidance, comprising two modes of operation, was developed and evaluated in flight tests. In the predictive mode, fuel efficient approach trajectories are synthesized in fast time. In the tracking mode, the synthesized trajectories are reconstructed and tracked automatically. An energy rate performance model derived from the lift, drag, and propulsion system characteristics of the aircraft is used in the synthesis algorithm. The method optimizes the trajectory for the initial aircraft position and wind and temperature profiles encountered during each landing approach. The design theory and the results of simulations and flight tests using the Augmentor Wing Jet STOL Research Aircraft are described.

A computational intelligence approach to the Mars Precision Landing problem

NASA Astrophysics Data System (ADS)

Birge, Brian Kent, III

Various proposed Mars missions, such as the Mars Sample Return Mission (MRSR) and the Mars Smart Lander (MSL), require precise re-entry terminal position and velocity states. This is to achieve mission objectives including rendezvous with a previous landed mission, or reaching a particular geographic landmark. The current state of the art footprint is in the magnitude of kilometers. For this research a Mars Precision Landing is achieved with a landed footprint of no more than 100 meters, for a set of initial entry conditions representing worst guess dispersions. Obstacles to reducing the landed footprint include trajectory dispersions due to initial atmospheric entry conditions (entry angle, parachute deployment height, etc.), environment (wind, atmospheric density, etc.), parachute deployment dynamics, unavoidable injection error (propagated error from launch on), etc. Weather and atmospheric models have been developed. Three descent scenarios have been examined. First, terminal re-entry is achieved via a ballistic parachute with concurrent thrusting events while on the parachute, followed by a gravity turn. Second, terminal re-entry is achieved via a ballistic parachute followed by gravity turn to hover and then thrust vector to desired location. Third, a guided parafoil approach followed by vectored thrusting to reach terminal velocity is examined. The guided parafoil is determined to be the best architecture. The purpose of this study is to examine the feasibility of using a computational intelligence strategy to facilitate precision planetary re-entry, specifically to take an approach that is somewhat more intuitive and less rigid, and see where it leads. The test problems used for all research are variations on proposed Mars landing mission scenarios developed by NASA. A relatively recent method of evolutionary computation is Particle Swarm Optimization (PSO), which can be considered to be in the same general class as Genetic Algorithms. An improvement over the regular PSO algorithm, allowing tracking of nonstationary error functions is detailed. Continued refinement of PSO in the larger research community comes from attempts to understand human-human social interaction as well as analysis of the emergent behavior. Using PSO and the parafoil scenario, optimized reference trajectories are created for an initial condition set of 76 states, representing the convex hull of 2001 states from an early Monte Carlo analysis. The controls are a set series of bank angles followed by a set series of 3DOF thrust vectoring. The reference trajectories are used to train an Artificial Neural Network Reference Trajectory Generator (ANNTraG), with the (marginal) ability to generalize a trajectory from initial conditions it has never been presented. The controls here allow continuous change in bank angle as well as thrust vector. The optimized reference trajectories represent the best achievable trajectory given the initial condition. Steps toward a closed loop neural controller with online learning updates are examined. The inner loop of the simulation employs the Program to Optimize Simulated Trajectories (POST) as the basic model, containing baseline dynamics and state generation. This is controlled from a MATLAB shell that directs the optimization, learning, and control strategy. Using mainly bank angle guidance coupled with CI strategies, the set of achievable reference trajectories are shown to be 88% under 10 meters, a significant improvement in the state of the art. Further, the automatic real-time generation of realistic reference trajectories in the presence of unknown initial conditions is shown to have promise. The closed loop CI guidance strategy is outlined. An unexpected advance came from the effort to optimize the optimization, where the PSO algorithm was improved with the capability for tracking a changing error environment.

An optimal model-based trajectory following architecture synthesising the lateral adaptive preview strategy and longitudinal velocity planning for highly automated vehicle

NASA Astrophysics Data System (ADS)

Cao, Haotian; Song, Xiaolin; Zhao, Song; Bao, Shan; Huang, Zhi

2017-08-01

Automated driving has received a broad of attentions from the academia and industry, since it is effective to greatly reduce the severity of potential traffic accidents and achieve the ultimate automobile safety and comfort. This paper presents an optimal model-based trajectory following architecture for highly automated vehicle in its driving tasks such as automated guidance or lane keeping, which includes a velocity-planning module, a steering controller and a velocity-tracking controller. The velocity-planning module considering the optimal time-consuming and passenger comforts simultaneously could generate a smooth velocity profile. The robust sliding mode control (SMC) steering controller with adaptive preview time strategy could not only track the target path well, but also avoid a big lateral acceleration occurred in its path-tracking progress due to a fuzzy-adaptive preview time mechanism introduced. In addition, an SMC controller with input-output linearisation method for velocity tracking is built and validated. Simulation results show this trajectory following architecture are effective and feasible for high automated driving vehicle, comparing with the Driver-in-the-Loop simulations performed by an experienced driver and novice driver, respectively. The simulation results demonstrate that the present trajectory following architecture could plan a satisfying longitudinal speed profile, track the target path well and safely when dealing with different road geometry structure, it ensures a good time efficiency and driving comfort simultaneously.

A new approach for estimating the Jupiter and Saturn gravity fields using Juno and Cassini measurements, trajectory estimation analysis, and a dynamical wind model optimization

NASA Astrophysics Data System (ADS)

Galanti, Eli; Durante, Daniele; Iess, Luciano; Kaspi, Yohai

2017-04-01

The ongoing Juno spacecraft measurements are improving our knowledge of Jupiter's gravity field. Similarly, the Cassini Grand Finale will improve the gravity estimate of Saturn. The analysis of the Juno and Cassini Doppler data will provide a very accurate reconstruction of spacial gravity variations, but these measurements will be very accurate only over a limited latitudinal range. In order to deduce the full gravity fields of Jupiter and Saturn, additional information needs to be incorporated into the analysis, especially with regards to the planets' wind structures. In this work we propose a new iterative approach for the estimation of Jupiter and Saturn gravity fields, using simulated measurements, a trajectory estimation model, and an adjoint based inverse thermal wind model. Beginning with an artificial gravitational field, the trajectory estimation model is used to obtain the gravitational moments. The solution from the trajectory model is then used as an initial guess for the thermal wind model, and together with an optimization method, the likely penetration depth of the winds is computed, and its uncertainty is evaluated. As a final step, the gravity harmonics solution from the thermal wind model is given back to the trajectory model, along with an estimate of their uncertainties, to be used as a priori for a new calculation of the gravity field. We test this method both for zonal harmonics only and with a full gravity field including tesseral harmonics. The results show that by using this method some of the gravitational moments are fitted better to the `observed' ones, mainly due to the added information from the dynamical model which includes the wind structure and its depth. Thus, it is suggested that the method presented here has the potential of improving the accuracy of the expected gravity moments estimated from the Juno and Cassini radio science experiments.

Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints

NASA Technical Reports Server (NTRS)

Englander, Jacob A.; Vavrina, Matthew A.; Hinckley, David

2016-01-01

Low-thrust interplanetary space missions are highly complex and there can be many locally optimal solutions. While several techniques exist to search for globally optimal solutions to low-thrust trajectory design problems, they are typically limited to unconstrained trajectories. The operational design community in turn has largely avoided using such techniques and has primarily focused on accurate constrained local optimization combined with grid searches and intuitive design processes at the expense of efficient exploration of the global design space. This work is an attempt to bridge the gap between the global optimization and operational design communities by presenting a mathematical framework for global optimization of low-thrust trajectories subject to complex constraints including the targeting of planetary landing sites, a solar range constraint to simplify the thermal design of the spacecraft, and a real-world multi-thruster electric propulsion system that must switch thrusters on and off as available power changes over the course of a mission.

SeGRAm - A practical and versatile tool for spacecraft trajectory optimization

NASA Technical Reports Server (NTRS)

Rishikof, Brian H.; Mccormick, Bernell R.; Pritchard, Robert E.; Sponaugle, Steven J.

1991-01-01

An implementation of the Sequential Gradient/Restoration Algorithm, SeGRAm, is presented along with selected examples. This spacecraft trajectory optimization and simulation program uses variational calculus to solve problems of spacecraft flying under the influence of one or more gravitational bodies. It produces a series of feasible solutions to problems involving a wide range of vehicles, environments and optimization functions, until an optimal solution is found. The examples included highlight the various capabilities of the program and emphasize in particular its versatility over a wide spectrum of applications from ascent to interplanetary trajectories.

Efficient Planning of Wind-Optimal Routes in North Atlantic Oceanic Airspace

NASA Technical Reports Server (NTRS)

Rodionova, Olga; Sridhar, Banavar

2017-01-01

The North Atlantic oceanic airspace (NAT) is crossed daily by more than a thousand flights, which are greatly affected by strong jet stream air currents. Several studies devoted to generating wind-optimal (WO) aircraft trajectories in the NAT demonstrated great efficiency of such an approach for individual flights. However, because of the large separation norms imposed in the NAT, previously proposed WO trajectories induce a large number of potential conflicts. Much work has been done on strategic conflict detection and resolution (CDR) in the NAT. The work presented here extends previous methods and attempts to take advantage of the NAT traffic structure to simplify the problem and improve the results of CDR. Four approaches are studied in this work: 1) subdividing the existing CDR problem into sub-problems of smaller sizes, which are easier to handle; 2) more efficient data reorganization within the considered time period; 3) problem localization, i.e. concentrating the resolution effort in the most conflicted regions; 4) applying CDR to the pre-tactical decision horizon (a couple of hours in advance). Obtained results show that these methods efficiently resolve potential conflicts at the strategic and pre-tactical levels by keeping the resulting trajectories close to the initial WO ones.

Time-dependent fermentation control strategies for enhancing synthesis of marine bacteriocin 1701 using artificial neural network and genetic algorithm.

PubMed

Peng, Jiansheng; Meng, Fanmei; Ai, Yuncan

2013-06-01

The artificial neural network (ANN) and genetic algorithm (GA) were combined to optimize the fermentation process for enhancing production of marine bacteriocin 1701 in a 5-L-stirred-tank. Fermentation time, pH value, dissolved oxygen level, temperature and turbidity were used to construct a "5-10-1" ANN topology to identify the nonlinear relationship between fermentation parameters and the antibiotic effects (shown as in inhibition diameters) of bacteriocin 1701. The predicted values by the trained ANN model were coincided with the observed ones (the coefficient of R(2) was greater than 0.95). As the fermentation time was brought in as one of the ANN input nodes, fermentation parameters could be optimized by stages through GA, and an optimal fermentation process control trajectory was created. The production of marine bacteriocin 1701 was significantly improved by 26% under the guidance of fermentation control trajectory that was optimized by using of combined ANN-GA method. Copyright © 2013 Elsevier Ltd. All rights reserved.

Designing train-speed trajectory with energy efficiency and service quality

NASA Astrophysics Data System (ADS)

Jia, Jiannan; Yang, Kai; Yang, Lixing; Gao, Yuan; Li, Shukai

2018-05-01

With the development of automatic train operations, optimal trajectory design is significant to the performance of train operations in railway transportation systems. Considering energy efficiency and service quality, this article formulates a bi-objective train-speed trajectory optimization model to minimize simultaneously the energy consumption and travel time in an inter-station section. This article is distinct from previous studies in that more sophisticated train driving strategies characterized by the acceleration/deceleration gear, the cruising speed, and the speed-shift site are specifically considered. For obtaining an optimal train-speed trajectory which has equal satisfactory degree on both objectives, a fuzzy linear programming approach is applied to reformulate the objectives. In addition, a genetic algorithm is developed to solve the proposed train-speed trajectory optimization problem. Finally, a series of numerical experiments based on a real-world instance of Beijing-Tianjin Intercity Railway are implemented to illustrate the practicability of the proposed model as well as the effectiveness of the solution methodology.

Optimal bounds and extremal trajectories for time averages in dynamical systems

NASA Astrophysics Data System (ADS)

Tobasco, Ian; Goluskin, David; Doering, Charles

2017-11-01

For systems governed by differential equations it is natural to seek extremal solution trajectories, maximizing or minimizing the long-time average of a given quantity of interest. A priori bounds on optima can be proved by constructing auxiliary functions satisfying certain point-wise inequalities, the verification of which does not require solving the underlying equations. We prove that for any bounded autonomous ODE, the problems of finding extremal trajectories on the one hand and optimal auxiliary functions on the other are strongly dual in the sense of convex duality. As a result, auxiliary functions provide arbitrarily sharp bounds on optimal time averages. Furthermore, nearly optimal auxiliary functions provide volumes in phase space where maximal and nearly maximal trajectories must lie. For polynomial systems, such functions can be constructed by semidefinite programming. We illustrate these ideas using the Lorenz system, producing explicit volumes in phase space where extremal trajectories are guaranteed to reside. Supported by NSF Award DMS-1515161, Van Loo Postdoctoral Fellowships, and the John Simon Guggenheim Foundation.

Low-Thrust Many-Revolution Trajectory Optimization via Differential Dynamic Programming and a Sundman Transformation

NASA Astrophysics Data System (ADS)

Aziz, Jonathan D.; Parker, Jeffrey S.; Scheeres, Daniel J.; Englander, Jacob A.

2018-01-01

Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to an orbit angle and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are computed with the transfer duration extended up to 2000 revolutions. The flexibility of the approach to higher fidelity dynamics is shown with Earth's J 2 perturbation and lunar gravity included for a 500 revolution transfer.

Low-Thrust Many-Revolution Trajectory Optimization via Differential Dynamic Programming and a Sundman Transformation

NASA Astrophysics Data System (ADS)

Aziz, Jonathan D.; Parker, Jeffrey S.; Scheeres, Daniel J.; Englander, Jacob A.

2018-06-01

Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to an orbit angle and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are computed with the transfer duration extended up to 2000 revolutions. The flexibility of the approach to higher fidelity dynamics is shown with Earth's J 2 perturbation and lunar gravity included for a 500 revolution transfer.

Head-target tracking control of well drilling

NASA Astrophysics Data System (ADS)

Agzamov, Z. V.

2018-05-01

The method of directional drilling trajectory control for oil and gas wells using predictive models is considered in the paper. The developed method does not apply optimization and therefore there is no need for the high-performance computing. Nevertheless, it allows following the well-plan with high precision taking into account process input saturation. Controller output is calculated both from the present target reference point of the well-plan and from well trajectory prediction with using the analytical model. This method allows following a well-plan not only on angular, but also on the Cartesian coordinates. Simulation of the control system has confirmed the high precision and operation performance with a wide range of random disturbance action.

Development of Advanced Methods of Structural and Trajectory Analysis for Transport Aircraft

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Windhorst, Robert; Phillips, James

1998-01-01

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Bernoulli substitution in the Ramsey model: Optimal trajectories under control constraints

NASA Astrophysics Data System (ADS)

Krasovskii, A. A.; Lebedev, P. D.; Tarasyev, A. M.

2017-05-01

We consider a neoclassical (economic) growth model. A nonlinear Ramsey equation, modeling capital dynamics, in the case of Cobb-Douglas production function is reduced to the linear differential equation via a Bernoulli substitution. This considerably facilitates the search for a solution to the optimal growth problem with logarithmic preferences. The study deals with solving the corresponding infinite horizon optimal control problem. We consider a vector field of the Hamiltonian system in the Pontryagin maximum principle, taking into account control constraints. We prove the existence of two alternative steady states, depending on the constraints. A proposed algorithm for constructing growth trajectories combines methods of open-loop control and closed-loop regulatory control. For some levels of constraints and initial conditions, a closed-form solution is obtained. We also demonstrate the impact of technological change on the economic equilibrium dynamics. Results are supported by computer calculations.

Numerical study and ex vivo assessment of HIFU treatment time reduction through optimization of focal point trajectory

NASA Astrophysics Data System (ADS)

Grisey, A.; Yon, S.; Pechoux, T.; Letort, V.; Lafitte, P.

2017-03-01

Treatment time reduction is a key issue to expand the use of high intensity focused ultrasound (HIFU) surgery, especially for benign pathologies. This study aims at quantitatively assessing the potential reduction of the treatment time arising from moving the focal point during long pulses. In this context, the optimization of the focal point trajectory is crucial to achieve a uniform thermal dose repartition and avoid boiling. At first, a numerical optimization algorithm was used to generate efficient trajectories. Thermal conduction was simulated in 3D with a finite difference code and damages to the tissue were modeled using the thermal dose formula. Given an initial trajectory, the thermal dose field was first computed, then, making use of Pontryagin's maximum principle, the trajectory was iteratively refined. Several initial trajectories were tested. Then, an ex vivo study was conducted in order to validate the efficicency of the resulting optimized strategies. Single pulses were performed at 3MHz on fresh veal liver samples with an Echopulse and the size of each unitary lesion was assessed by cutting each sample along three orthogonal planes and measuring the dimension of the whitened area based on photographs. We propose a promising approach to significantly shorten HIFU treatment time: the numerical optimization algorithm was shown to provide a reliable insight on trajectories that can improve treatment strategies. The model must now be improved in order to take in vivo conditions into account and extensively validated.

Second-order variational equations for N-body simulations

NASA Astrophysics Data System (ADS)

Rein, Hanno; Tamayo, Daniel

2016-07-01

First-order variational equations are widely used in N-body simulations to study how nearby trajectories diverge from one another. These allow for efficient and reliable determinations of chaos indicators such as the Maximal Lyapunov characteristic Exponent (MLE) and the Mean Exponential Growth factor of Nearby Orbits (MEGNO). In this paper we lay out the theoretical framework to extend the idea of variational equations to higher order. We explicitly derive the differential equations that govern the evolution of second-order variations in the N-body problem. Going to second order opens the door to new applications, including optimization algorithms that require the first and second derivatives of the solution, like the classical Newton's method. Typically, these methods have faster convergence rates than derivative-free methods. Derivatives are also required for Riemann manifold Langevin and Hamiltonian Monte Carlo methods which provide significantly shorter correlation times than standard methods. Such improved optimization methods can be applied to anything from radial-velocity/transit-timing-variation fitting to spacecraft trajectory optimization to asteroid deflection. We provide an implementation of first- and second-order variational equations for the publicly available REBOUND integrator package. Our implementation allows the simultaneous integration of any number of first- and second-order variational equations with the high-accuracy IAS15 integrator. We also provide routines to generate consistent and accurate initial conditions without the need for finite differencing.

Optimisation des trajectoires d'un systeme de gestion de vol d'avions pour la reduction des couts de vol

NASA Astrophysics Data System (ADS)

Sidibe, Souleymane

The implementation and monitoring of operational flight plans is a major occupation for a crew of commercial flights. The purpose of this operation is to set the vertical and lateral trajectories followed by airplane during phases of flight: climb, cruise, descent, etc. These trajectories are subjected to conflicting economical constraints: minimization of flight time and minimization of fuel consumed and environmental constraints. In its task of mission planning, the crew is assisted by the Flight Management System (FMS) which is used to construct the path to follow and to predict the behaviour of the aircraft along the flight plan. The FMS considered in our research, particularly includes an optimization model of flight only by calculating the optimal speed profile that minimizes the overall cost of flight synthesized by a criterion of cost index following a steady cruising altitude. However, the model based solely on optimization of the speed profile is not sufficient. It is necessary to expand the current optimization for simultaneous optimization of the speed and altitude in order to determine an optimum cruise altitude that minimizes the overall cost when the path is flown with the optimal speed profile. Then, a new program was developed. The latter is based on the method of dynamic programming invented by Bellman to solve problems of optimal paths. In addition, the improvement passes through research new patterns of trajectories integrating ascendant cruises and using the lateral plane with the effect of the weather: wind and temperature. Finally, for better optimization, the program takes into account constraint of flight domain of aircrafts which utilize the FMS.

Optimal Estimation of Glider’s Underwater Trajectory with Depth-Dependent Correction Using the Navy Coastal Ocean Model with Application to Antisubmarine Warfare

DTIC Science & Technology

2014-09-01

deployed simultaneously. For example, a fleet of gliders would be able to act as an intelligence network by gathering underwater target information ...and to verify our novel method, a glider’s real underwater trajectory information must be obtained by using additional sensors like ADCP or DVL (see...lacks of inexpensive and efficient localization sensors during its subsurface mission. Therefore, knowing its precise underwater position is a

Fast and reliable method to estimate losses of single-mode waveguides with an arbitrary 2D trajectory.

PubMed

Negredo, F; Blaicher, M; Nesic, A; Kraft, P; Ott, J; Dörfler, W; Koos, C; Rockstuhl, C

2018-06-01

Photonic wire bonds, i.e., freeform waveguides written by 3D direct laser writing, emerge as a technology to connect different optical chips in fully integrated photonic devices. With the long-term vision of scaling up this technology to a large-scale fabrication process, the in situ optimization of the trajectory of photonic wire bonds is at stake. A prerequisite for the real-time optimization is the availability of a fast loss estimator for single-mode waveguides of arbitrary trajectory. Losses occur because of the bending of the waveguides and at transitions among sections of the waveguide with different curvatures. Here, we present an approach that resides on the fundamental mode approximation, i.e., the assumption that the photonic wire bonds predominantly carry their energy in a single mode. It allows us to predict in a quick and reliable way the pertinent losses from pre-computed modal properties of the waveguide, enabling fast design of optimum paths.

Multi-Objective Hybrid Optimal Control for Multiple-Flyby Interplanetary Mission Design Using Chemical Propulsion

NASA Technical Reports Server (NTRS)

Englander, Jacob A.; Vavrina, Matthew A.

2015-01-01

Preliminary design of high-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys and the bodies at which those flybys are performed. For some missions, such as surveys of small bodies, the mission designer also contributes to target selection. In addition, real-valued decision variables, such as launch epoch, flight times, maneuver and flyby epochs, and flyby altitudes must be chosen. There are often many thousands 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 impulsive mission design problem as a multiobjective hybrid optimal control problem. The method is demonstrated on several real-world problems.

Trajectory optimization for the national aerospace plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1993-01-01

During the past six months the research objectives outlined in the last semi-annual report were accomplished. Specifically, these are: three-dimensional (3-D) fuel-optimal ascent trajectory of the aerospace plane and the effects of thrust vectoring control (TVC) on the fuel consumption and trajectory shaping were investigated; the maximum abort landing area (footprint) was studied; preliminary assessment of simultaneous design of the ascent trajectory and the vehicle configuration for the aerospace plane was also conducted. The work accomplished in the reporting period is summarized.

Automation for Air Traffic Control: The Rise of a New Discipline

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; Tobias, Leonard (Technical Monitor)

1997-01-01

The current debate over the concept of Free Flight has renewed interest in automated conflict detection and resolution in the enroute airspace. An essential requirement for effective conflict detection is accurate prediction of trajectories. Trajectory prediction is, however, an inexact process which accumulates errors that grow in proportion to the length of the prediction time interval. Using a model of prediction errors for the trajectory predictor incorporated in the Center-TRACON Automation System (CTAS), a computationally fast algorithm for computing conflict probability has been derived. Furthermore, a method of conflict resolution has been formulated that minimizes the average cost of resolution, when cost is defined as the increment in airline operating costs incurred in flying the resolution maneuver. The method optimizes the trade off between early resolution at lower maneuver costs but higher prediction error on the one hand and late resolution with higher maneuver costs but lower prediction errors on the other. The method determines both the time to initiate the resolution maneuver as well as the characteristics of the resolution trajectory so as to minimize the cost of the resolution. Several computational examples relevant to the design of a conflict probe that can support user-preferred trajectories in the enroute airspace will be presented.

Cascaded Optimization for a Persistent Data Ferrying Unmanned Aircraft

NASA Astrophysics Data System (ADS)

Carfang, Anthony

This dissertation develops and assesses a cascaded method for designing optimal periodic trajectories and link schedules for an unmanned aircraft to ferry data between stationary ground nodes. This results in a fast solution method without the need to artificially constrain system dynamics. Focusing on a fundamental ferrying problem that involves one source and one destination, but includes complex vehicle and Radio-Frequency (RF) dynamics, a cascaded structure to the system dynamics is uncovered. This structure is exploited by reformulating the nonlinear optimization problem into one that reduces the independent control to the vehicle's motion, while the link scheduling control is folded into the objective function and implemented as an optimal policy that depends on candidate motion control. This formulation is proven to maintain optimality while reducing computation time in comparison to traditional ferry optimization methods. The discrete link scheduling problem takes the form of a combinatorial optimization problem that is known to be NP-Hard. A derived necessary condition for optimality guides the development of several heuristic algorithms, specifically the Most-Data-First Algorithm and the Knapsack Adaptation. These heuristics are extended to larger ferrying scenarios, and assessed analytically and through Monte Carlo simulation, showing better throughput performance in the same order of magnitude of computation time in comparison to other common link scheduling policies. The cascaded optimization method is implemented with a novel embedded software system on a small, unmanned aircraft to validate the simulation results with field experiments. To address the sensitivity of results on trajectory tracking performance, a system that combines motion and link control with waypoint-based navigation is developed and assessed through field experiments. The data ferrying algorithms are further extended by incorporating a Gaussian process to opportunistically learn the RF environment. By continuously improving RF models, the cascaded planner can continually improve the ferrying system's overall performance.

Optimal low-thrust trajectories for nuclear and solar electric propulsion

NASA Astrophysics Data System (ADS)

Genta, G.; Maffione, P. F.

2016-01-01

The optimization of the trajectory and of the thrust profile of a low-thrust interplanetary transfer is usually solved under the assumption that the specific mass of the power generator is constant. While this is reasonable in the case of nuclear electric propulsion, if solar electric propulsion is used the specific mass depends on the distance of the spacecraft from the Sun. In the present paper the optimization of the trajectory of the spacecraft and of the thrust profile is solved under the latter assumption, to obtain optimized interplanetary trajectories for solar electric spacecraft, also taking into account all phases of the journey, from low orbit about the starting planet to low orbit about the destination one. General plots linking together the travel time, the specific mass of the generator and the propellant consumption are obtained.

Model-Free Primitive-Based Iterative Learning Control Approach to Trajectory Tracking of MIMO Systems With Experimental Validation.

PubMed

Radac, Mircea-Bogdan; Precup, Radu-Emil; Petriu, Emil M

2015-11-01

This paper proposes a novel model-free trajectory tracking of multiple-input multiple-output (MIMO) systems by the combination of iterative learning control (ILC) and primitives. The optimal trajectory tracking solution is obtained in terms of previously learned solutions to simple tasks called primitives. The library of primitives that are stored in memory consists of pairs of reference input/controlled output signals. The reference input primitives are optimized in a model-free ILC framework without using knowledge of the controlled process. The guaranteed convergence of the learning scheme is built upon a model-free virtual reference feedback tuning design of the feedback decoupling controller. Each new complex trajectory to be tracked is decomposed into the output primitives regarded as basis functions. The optimal reference input for the control system to track the desired trajectory is next recomposed from the reference input primitives. This is advantageous because the optimal reference input is computed straightforward without the need to learn from repeated executions of the tracking task. In addition, the optimization problem specific to trajectory tracking of square MIMO systems is decomposed in a set of optimization problems assigned to each separate single-input single-output control channel that ensures a convenient model-free decoupling. The new model-free primitive-based ILC approach is capable of planning, reasoning, and learning. A case study dealing with the model-free control tuning for a nonlinear aerodynamic system is included to validate the new approach. The experimental results are given.

Optimization design and dynamic analysis on the drive mechanisms of flapping-wing air vehicles based on flapping trajectories

NASA Astrophysics Data System (ADS)

Xie, Lingwang; Zhang, Xingwei; Luo, Pan; Huang, Panpan

2017-10-01

The optimization designs and dynamic analysis on the driving mechanism of flapping-wing air vehicles on base of flapping trajectory patterns is carried out in this study. Three different driving mechanisms which are spatial double crank-rocker, plane five-bar and gear-double slider, are systematically optimized and analysed by using the Mat lab and Adams software. After a series debugging on the parameter, the comparatively ideal flapping trajectories are obtained by the simulation of Adams. Present results indicate that different drive mechanisms output different flapping trajectories and have their unique characteristic. The spatial double crank-rocker mechanism can only output the arc flapping trajectory and it has the advantages of small volume, high flexibility and efficient space utilization. Both planar five-bar mechanism and gear-double slider mechanism can output the oval, figure of eight and double eight flapping trajectories. Nevertheless, the gear-double slider mechanism has the advantage of convenient parameter setting and better performance in output double eight flapping trajectory. This study can provide theoretical basis and helpful reference for the design of the drive mechanisms of flapping-wing air vehicles with different output flapping trajectories.

Aircraft Trajectory Optimization and Contrails Avoidance in the Presence of Winds

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Chen, Neil Y.

2010-01-01

There are indications that persistent contrails can lead to adverse climate change, although the complete effect on climate forcing is still uncertain. A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectories are developed by solving a non-linear optimal control problem with path constraints. The regions of airspace favorable to persistent contrails formation are modeled as penalty areas that aircraft should avoid and are adjustable. The tradeoff between persistent contrails formation and additional fuel consumption is investigated, with and without altitude optimization, for 12 city-pairs in the continental United States. Without altitude optimization, the reduction in contrail travel times is gradual with increase in total fuel consumption. When altitude is optimized, a two percent increase in total fuel consumption can reduce the total travel times through contrail regions by more than six times. Allowing further increase in fuel consumption does not seem to result in proportionate decrease in contrail travel times.

Automated Sensitivity Analysis of Interplanetary Trajectories for Optimal Mission Design

NASA Technical Reports Server (NTRS)

Knittel, Jeremy; Hughes, Kyle; Englander, Jacob; Sarli, Bruno

2017-01-01

This work describes a suite of Python tools known as the Python EMTG Automated Trade Study Application (PEATSA). PEATSA was written to automate the operation of trajectory optimization software, simplify the process of performing sensitivity analysis, and was ultimately found to out-perform a human trajectory designer in unexpected ways. These benefits will be discussed and demonstrated on sample mission designs.

Constrained trajectory optimization for kinematically redundant arms

NASA Technical Reports Server (NTRS)

Carignan, Craig R.; Tarrant, Janice M.

1990-01-01

Two velocity optimization schemes for resolving redundant joint configurations are compared. The Extended Moore-Penrose Technique minimizes the joint velocities and avoids obstacles indirectly by adjoining a cost gradient to the solution. A new method can incorporate inequality constraints directly to avoid obstacles and singularities in the workspace. A four-link arm example is used to illustrate singularity avoidance while tracking desired end-effector paths.

Analysis of Nonlinear Dynamics by Square Matrix Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yu, Li Hua

The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. In this paper, we show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix from the original large number for high order calculation to low dimension in the first step of the analysis. Then a stable Jordan decomposition is obtained with much lower dimension. The transformation to Jordan form provides an excellent action-angle approximation to the solution of the nonlinear dynamics, in good agreement with trajectories and tune obtained from tracking. Andmore » more importantly, the deviation from constancy of the new action-angle variable provides a measure of the stability of the phase space trajectories and their tunes. Thus the square matrix provides a novel method to optimize the nonlinear dynamic system. The method is illustrated by many examples of comparison between theory and numerical simulation. Finally, in particular, we show that the square matrix method can be used for optimization to reduce the nonlinearity of a system.« less

Development of a Mars Airplane Entry, Descent, and Flight Trajectory

NASA Technical Reports Server (NTRS)

Murray, James E.; Tartabini, Paul V.

2001-01-01

An entry, descent, and flight (EDF) trajectory profile for a Mars airplane mission is defined as consisting of the following elements: ballistic entry of an aeroshell; supersonic deployment of a decelerator parachute; subsonic release of a heat shield; release, unfolding, and orientation of an airplane to flight attitude; and execution of a pull up maneuver to achieve trimmed, horizontal flight. Using the Program to Optimize Simulated Trajectories (POST) a trajectory optimization problem was formulated. Model data representative of a specific Mars airplane configuration, current models of the Mars surface topography and atmosphere, and current estimates of the interplanetary trajectory, were incorporated into the analysis. The goal is to develop an EDF trajectory to maximize the surface-relative altitude of the airplane at the end of a pull up maneuver, while subject to the mission design constraints. The trajectory performance was evaluated for three potential mission sites and was found to be site-sensitive. The trajectory performance, examined for sensitivity to a number of design and constraint variables, was found to be most sensitive to airplane mass, aerodynamic performance characteristics, and the pull up Mach constraint. Based on the results of this sensitivity study, an airplane-drag optimized trajectory was developed that showed a significant performance improvement.

An Earth-Moon Transfer Trajectory Design and Analysis Considering Spacecraft's Visibility from Daejeon Ground Station at TLI and LOI Maneuvers

NASA Astrophysics Data System (ADS)

Woo, Jin; Song, Young-Joo; Park, Sang-Young; Kim, Hae-Dong; Sim, Eun-Sup

2010-09-01

The optimal Earth-Moon transfer trajectory considering spacecraft's visibility from the Daejeon ground station visibility at both the trans lunar injection (TLI) and lunar orbit insertion (LOI) maneuvers is designed. Both the TLI and LOI maneuvers are assumed to be impulsive thrust. As the successful execution of the TLI and LOI maneuvers are crucial factors among the various lunar mission parameters, it is necessary to design an optimal lunar transfer trajectory which guarantees the visibility from a specified ground station while executing these maneuvers. The optimal Earth-Moon transfer trajectory is simulated by modifying the Korean Lunar Mission Design Software using Impulsive high Thrust Engine (KLMDS-ITE) which is developed in previous studies. Four different mission scenarios are established and simulated to analyze the effects of the spacecraft's visibility considerations at the TLI and LOI maneuvers. As a result, it is found that the optimal Earth-Moon transfer trajectory, guaranteeing the spacecraft's visibility from Daejeon ground station at both the TLI and LOI maneuvers, can be designed with slight changes in total amount of delta-Vs. About 1% difference is observed with the optimal trajectory when none of the visibility condition is guaranteed, and about 0.04% with the visibility condition is only guaranteed at the time of TLI maneuver. The spacecraft's mass which can delivered to the Moon, when both visibility conditions are secured is shown to be about 534 kg with assumptions of KSLV-2's on-orbit mass about 2.6 tons. To minimize total mission delta-Vs, it is strongly recommended that visibility conditions at both the TLI and LOI maneuvers should be simultaneously implemented to the trajectory optimization algorithm.

Optimal guidance law development for an advanced launch system

NASA Technical Reports Server (NTRS)

Calise, Anthony J.; Hodges, Dewey H.; Leung, Martin S.; Bless, Robert R.

1991-01-01

The proposed investigation on a Matched Asymptotic Expansion (MAE) method was carried out. It was concluded that the method of MAE is not applicable to launch vehicle ascent trajectory optimization due to a lack of a suitable stretched variable. More work was done on the earlier regular perturbation approach using a piecewise analytic zeroth order solution to generate a more accurate approximation. In the meantime, a singular perturbation approach using manifold theory is also under current investigation. Work on a general computational environment based on the use of MACSYMA and the weak Hamiltonian finite element method continued during this period. This methodology is capable of the solution of a large class of optimal control problems.

Global, Multi-Objective Trajectory Optimization With Parametric Spreading

NASA Technical Reports Server (NTRS)

Vavrina, Matthew A.; Englander, Jacob A.; Phillips, Sean M.; Hughes, Kyle M.

2017-01-01

Mission design problems are often characterized by multiple, competing trajectory optimization objectives. Recent multi-objective trajectory optimization formulations enable generation of globally-optimal, Pareto solutions via a multi-objective genetic algorithm. A byproduct of these formulations is that clustering in design space can occur in evolving the population towards the Pareto front. This clustering can be a drawback, however, if parametric evaluations of design variables are desired. This effort addresses clustering by incorporating operators that encourage a uniform spread over specified design variables while maintaining Pareto front representation. The algorithm is demonstrated on a Neptune orbiter mission, and enhanced multidimensional visualization strategies are presented.

An Efficient Method to Design Premature End-of-Life Trajectories: A Hypothetical Alternate Fate for Cassini

NASA Technical Reports Server (NTRS)

Vaquero, Mar; Senent, Juan

2015-01-01

What would happen if, hypothetically, the highly successful Cassini mission were to end prematurely due to lack of propellant or sudden subsystem failure? A solid plan to quickly produce a solution for any given scenario, regardless of where the spacecraft is along its reference path, must be in place to safely dispose of the spacecraft and meet all planetary protection requirements. As a contingency plan for this hypothetical situation, a method to design viable high-fidelity terminating trajectories based on a hybrid approach that exploits two-body and three-body flyby transfers combined with a numerical optimization scheme is detailed in this paper.

An Efficient Method of Sharing Mass Spatio-Temporal Trajectory Data Based on Cloudera Impala for Traffic Distribution Mapping in an Urban City.

PubMed

Zhou, Lianjie; Chen, Nengcheng; Yuan, Sai; Chen, Zeqiang

2016-10-29

The efficient sharing of spatio-temporal trajectory data is important to understand traffic congestion in mass data. However, the data volumes of bus networks in urban cities are growing rapidly, reaching daily volumes of one hundred million datapoints. Accessing and retrieving mass spatio-temporal trajectory data in any field is hard and inefficient due to limited computational capabilities and incomplete data organization mechanisms. Therefore, we propose an optimized and efficient spatio-temporal trajectory data retrieval method based on the Cloudera Impala query engine, called ESTRI, to enhance the efficiency of mass data sharing. As an excellent query tool for mass data, Impala can be applied for mass spatio-temporal trajectory data sharing. In ESTRI we extend the spatio-temporal trajectory data retrieval function of Impala and design a suitable data partitioning method. In our experiments, the Taiyuan BeiDou (BD) bus network is selected, containing 2300 buses with BD positioning sensors, producing 20 million records every day, resulting in two difficulties as described in the Introduction section. In addition, ESTRI and MongoDB are applied in experiments. The experiments show that ESTRI achieves the most efficient data retrieval compared to retrieval using MongoDB for data volumes of fifty million, one hundred million, one hundred and fifty million, and two hundred million. The performance of ESTRI is approximately seven times higher than that of MongoDB. The experiments show that ESTRI is an effective method for retrieving mass spatio-temporal trajectory data. Finally, bus distribution mapping in Taiyuan city is achieved, describing the buses density in different regions at different times throughout the day, which can be applied in future studies of transport, such as traffic scheduling, traffic planning and traffic behavior management in intelligent public transportation systems.

Flyby Geometry Optimization Tool

NASA Technical Reports Server (NTRS)

Karlgaard, Christopher D.

2007-01-01

The Flyby Geometry Optimization Tool is a computer program for computing trajectories and trajectory-altering impulsive maneuvers for spacecraft used in radio relay of scientific data to Earth from an exploratory airplane flying in the atmosphere of Mars.

Fuel-conservative guidance system for powered-lift aircraft

NASA Technical Reports Server (NTRS)

Erzberger, H.; Mclean, J. D.

1979-01-01

A concept for automatic terminal-area guidance, comprising two modes of operation, has been developed and evaluated in flight tests. In the first or predictive mode, fuel-efficient approach trajectories are synthesized in fast time. In the second or tracking mode, the synthesized trajectories are reconstructed and tracked automatically. An energy rate performance model derived from the lift, drag, and propulsion-system characteristics of the aircraft is used in the synthesis algorithm. The method optimizes the trajectory for the initial aircraft position and wind and temperature profiles encountered during each landing approach. The paper describes the design theory and discusses the results of simulations and flight tests using the Augmentor Wing Jet STOL Research Aircraft.

Simulation and Optimization Methods for Assessing the Impact of Aviation Operations on the Environment

NASA Technical Reports Server (NTRS)

Sridhar, Banavar; Chen, Neil; Ng, Hok K.

2010-01-01

There is increased awareness of anthropogenic factors affecting climate change and urgency to slow the negative impact. Greenhouse gases, oxides of Nitrogen and contrails resulting from aviation affect the climate in different and uncertain ways. This paper develops a flexible simulation and optimization software architecture to study the trade-offs involved in reducing emissions. The software environment is used to conduct analysis of two approaches for avoiding contrails using the concepts of contrail frequency index and optimal avoidance trajectories.

Method and apparatus for controlling LCL converters using asymmetric voltage cancellation techniques

DOEpatents

Wu, Hunter; Sealy, Kylee Devro; Sharp, Bryan Thomas; Gilchrist, Aaron

2016-01-26

A method and apparatus for LCL resonant converter control utilizing Asymmetric Voltage Cancellation is described. The methods to determine the optimal trajectory of the control variables are discussed. Practical implementations of sensing load parameters are included. Simple PI, PID and fuzzy logic controllers are included with AVC for achieving good transient response characteristics with output current regulation.

Optimal flight trajectories in the presence of windshear, 1984-86

NASA Technical Reports Server (NTRS)

Miele, A.

1986-01-01

Optimal flight trajectories were determined in the presence of windshear and guidance schemes were developed for near optimum flight in a windshear. This is a wind characterized by sharp change in intensity and direction over a relatively small region of space. This problem is important in the takeoff and landing of both civilian airplanes and military airplanes and is key to aircraft saftey. The topics covered in reference to takeoff problems are: equations of motion, problem formulation, algorithms, optimal flight trajectories, advanced guidance schemes, simplified guidance schemes, and piloting strategies.

General Methodology for Designing Spacecraft Trajectories

NASA Technical Reports Server (NTRS)

Condon, Gerald; Ocampo, Cesar; Mathur, Ravishankar; Morcos, Fady; Senent, Juan; Williams, Jacob; Davis, Elizabeth C.

2012-01-01

A methodology for designing spacecraft trajectories in any gravitational environment within the solar system has been developed. The methodology facilitates modeling and optimization for problems ranging from that of a single spacecraft orbiting a single celestial body to that of a mission involving multiple spacecraft and multiple propulsion systems operating in gravitational fields of multiple celestial bodies. The methodology consolidates almost all spacecraft trajectory design and optimization problems into a single conceptual framework requiring solution of either a system of nonlinear equations or a parameter-optimization problem with equality and/or inequality constraints.

Photogrammetry and ballistic analysis of a high-flying projectile in the STS-124 space shuttle launch

NASA Astrophysics Data System (ADS)

Metzger, Philip T.; Lane, John E.; Carilli, Robert A.; Long, Jason M.; Shawn, Kathy L.

2010-07-01

A method combining photogrammetry with ballistic analysis is demonstrated to identify flying debris in a rocket launch environment. Debris traveling near the STS-124 Space Shuttle was captured on cameras viewing the launch pad within the first few seconds after launch. One particular piece of debris caught the attention of investigators studying the release of flame trench fire bricks because its high trajectory could indicate a flight risk to the Space Shuttle. Digitized images from two pad perimeter high-speed 16-mm film cameras were processed using photogrammetry software based on a multi-parameter optimization technique. Reference points in the image were found from 3D CAD models of the launch pad and from surveyed points on the pad. The three-dimensional reference points were matched to the equivalent two-dimensional camera projections by optimizing the camera model parameters using a gradient search optimization technique. Using this method of solving the triangulation problem, the xyz position of the object's path relative to the reference point coordinate system was found for every set of synchronized images. This trajectory was then compared to a predicted trajectory while performing regression analysis on the ballistic coefficient and other parameters. This identified, with a high degree of confidence, the object's material density and thus its probable origin within the launch pad environment. Future extensions of this methodology may make it possible to diagnose the underlying causes of debris-releasing events in near-real time, thus improving flight safety.

Optimal spacecraft formation establishment and reconfiguration propelled by the geomagnetic Lorentz force

NASA Astrophysics Data System (ADS)

Huang, Xu; Yan, Ye; Zhou, Yang

2014-12-01

The Lorentz force acting on an electrostatically charged spacecraft as it moves through the planetary magnetic field could be utilized as propellantless electromagnetic propulsion for orbital maneuvering, such as spacecraft formation establishment and formation reconfiguration. By assuming that the Earth's magnetic field could be modeled as a tilted dipole located at the center of Earth that corotates with Earth, a dynamical model that describes the relative orbital motion of Lorentz spacecraft is developed. Based on the proposed dynamical model, the energy-optimal open-loop trajectories of control inputs, namely, the required specific charges of Lorentz spacecraft, for Lorentz-propelled spacecraft formation establishment or reconfiguration problems with both fixed and free final conditions constraints are derived via Gauss pseudospectral method. The effect of the magnetic dipole tilt angle on the optimal control inputs and the relative transfer trajectories for formation establishment or reconfiguration is also investigated by comparisons with the results derived from a nontilted dipole model. Furthermore, a closed-loop integral sliding mode controller is designed to guarantee the trajectory tracking in the presence of external disturbances and modeling errors. The stability of the closed-loop system is proved by a Lyapunov-based approach. Numerical simulations are presented to verify the validity of the proposed open-loop control methods and demonstrate the performance of the closed-loop controller. Also, the results indicate the dipole tilt angle should be considered when designing control strategies for Lorentz-propelled spacecraft formation establishment or reconfiguration.

Dynamic imperfections and optimized feedback design in the Compact Linear Collider main linac

NASA Astrophysics Data System (ADS)

Eliasson, Peder

2008-05-01

The Compact Linear Collider (CLIC) main linac is sensitive to dynamic imperfections such as element jitter, injected beam jitter, and ground motion. These effects cause emittance growth that, in case of ground motion, has to be counteracted by a trajectory feedback system. The feedback system itself will, due to jitter effects and imperfect beam position monitors (BPMs), indirectly cause emittance growth. Fast and accurate simulations of both the direct and indirect effects are desirable, but due to the many elements of the CLIC main linac, simulations may become very time consuming. In this paper, an efficient way of simulating linear (or nearly linear) dynamic effects is described. The method is also shown to facilitate the analytic determination of emittance growth caused by the different dynamic imperfections while using a trajectory feedback system. Emittance growth expressions are derived for quadrupole, accelerating structure, and beam jitter, for ground motion, and for noise in the feedback BPMs. Finally, it is shown how the method can be used to design a feedback system that is optimized for the optics of the machine and the ground motion spectrum of the particular site. This feedback system gives an emittance growth rate that is approximately 10 times lower than that of traditional trajectory feedbacks. The robustness of the optimized feedback system is studied for a number of additional imperfections, e.g., dipole corrector imperfections and faulty knowledge about the machine optics, with promising results.

HILTOP supplement: Heliocentric interplanetary low thrust trajectory optimization program, supplement 1

NASA Technical Reports Server (NTRS)

Mann, F. I.; Horsewood, J. L.

1974-01-01

Modifications and improvements are described that were made to the HILTOP electric propulsion trajectory optimization computer program during calendar years 1973 and 1974. New program features include the simulation of power degradation, housekeeping power, launch asymptote declination optimization, and powered and unpowered ballistic multiple swingby missions with an optional deep space burn.

Optimal starting conditions for the rendezvous maneuver: Analytical and computational approach

NASA Astrophysics Data System (ADS)

Ciarcia, Marco

The three-dimensional rendezvous between two spacecraft is considered: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular travel for the target spacecraft. The above problem has been studied by several authors under the assumption that the initial separation coordinates and the initial separation velocities are given, hence known initial conditions for the chaser spacecraft. In this paper, it is assumed that both the initial separation coordinates and initial separation velocities are free except for the requirement that the initial chaser-to-target distance is given so as to prevent the occurrence of trivial solutions. Two approaches are employed: optimal control formulation (Part A) and mathematical programming formulation (Part B). In Part A, analyses are performed with the multiple-subarc sequential gradient-restoration algorithm for optimal control problems. They show that the fuel-optimal trajectory is zero-bang, namely it is characterized by two subarcs: a long coasting zero-thrust subarc followed by a short powered max-thrust braking subarc. While the thrust direction of the powered subarc is continuously variable for the optimal trajectory, its replacement with a constant (yet optimized) thrust direction produces a very efficient guidance trajectory. Indeed, for all values of the initial distance, the fuel required by the guidance trajectory is within less than one percent of the fuel required by the optimal trajectory. For the guidance trajectory, because of the replacement of the variable thrust direction of the powered subarc with a constant thrust direction, the optimal control problem degenerates into a mathematical programming problem with a relatively small number of degrees of freedom, more precisely: three for case (i) time-to-rendezvous free and two for case (ii) time-to-rendezvous given. In particular, we consider the rendezvous between the Space Shuttle (chaser) and the International Space Station (target). Once a given initial distance SS-to-ISS is preselected, the present work supplies not only the best initial conditions for the rendezvous trajectory, but simultaneously the corresponding final conditions for the ascent trajectory. In Part B, an analytical solution of the Clohessy-Wiltshire equations is presented (i) neglecting the change of the spacecraft mass due to the fuel consumption and (ii) and assuming that the thrust is finite, that is, the trajectory includes powered subarcs flown with max thrust and coasting subarc flown with zero thrust. Then, employing the found analytical solution, we study the rendezvous problem under the assumption that the initial separation coordinates and initial separation velocities are free except for the requirement that the initial chaser-to-target distance is given. The main contribution of Part B is the development of analytical solutions for the powered subarcs, an important extension of the analytical solutions already available for the coasting subarcs. One consequence is that the entire optimal trajectory can be described analytically. Another consequence is that the optimal control problems degenerate into mathematical programming problems. A further consequence is that, vis-a-vis the optimal control formulation, the mathematical programming formulation reduces the CPU time by a factor of order 1000. Key words. Space trajectories, rendezvous, optimization, guidance, optimal control, calculus of variations, Mayer problems, Bolza problems, transformation techniques, multiple-subarc sequential gradient-restoration algorithm.

Trajectory Optimization for Crewed Missions to an Earth-Moon L2 Halo Orbit

NASA Astrophysics Data System (ADS)

Dowling, Jennifer

Baseline trajectories to an Earth-Moon L2 halo orbit and round trip trajectories for crewed missions have been created in support of an advanced Orion mission concept. Various transfer durations and orbit insertion locations have been evaluated. The trajectories often include a deterministic mid-course maneuver that decreases the overall change in velocity in the trajectory. This paper presents the application of primer vector theory to study the existence, location, and magnitude of the mid-course maneuver in order to understand how to build an optimal round trip trajectory to an Earth-Moon L2 halo orbit. The lessons learned about when to add mid-course maneuvers can be applied to other mission designs.

Fast Calculation of Abort Return Trajectories for Manned Missions to the Moon

NASA Technical Reports Server (NTRS)

Senent, Juan S.

2010-01-01

In order to support the anytime abort requirements of a manned mission to the Moon, the vehicle abort capabilities for the translunar and circumlunar phases of the mission must be studied. Depending on the location of the abort maneuver, the maximum return time to Earth and the available propellant, two different kinds of return trajectories can be calculated: direct and fly-by. This paper presents a new method to compute these return trajectories in a deterministic and fast way without using numerical optimizers. Since no simplifications of the gravity model are required, the resulting trajectories are very accurate and can be used for both mission design and operations. This technique has been extensively used to evaluate the abort capabilities of the Orion/Altair vehicles in the Constellation program for the translunar phase of the mission.

A practical six-degree of freedom solar sail dynamics model for optimizing solar sail trajectories with torque constraints

NASA Technical Reports Server (NTRS)

Lisano, Michael E.

2004-01-01

Controlled flight of a solar sail-propelled spacecraft ('sailcraft') is a six-degree-of-freedom dynamics problem. Current state-of-the-art tools that simulate and optimize the trajectories flown by sailcraft do not treat the full kinetic (i.e. force and torque-constrained) motion, instead treating a discrete history of commanded sail attitudes, and either neglecting the sail attitude motion over an integration timestep, or treating the attitude evolution kinematically with a spline or similar treatment. The present paper discusses an aspect of developing a next generation sailcraf trajectory designing optimization tool JPL, for NASA's Solar Sail Spaceflight Simulation Software (SS). The aspect discussed in an experimental approach to modeling full six-degree-of-freedom kinetic motion of a solar sail in a trajectory propagator. Early results from implementing this approach in a new trajectory propagation tool are given.

Interplanetary Program to Optimize Simulated Trajectories (IPOST). Volume 3: Programmer's manual

NASA Technical Reports Server (NTRS)

Hong, P. E.; Kent, P. D.; Olson, D. W.; Vallado, C. A.

1992-01-01

The Interplanetary Program to Optimize Space Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. Here, information is given on the IPOST code.

Dynamics and Control of Three-Dimensional Perching Maneuver under Dynamic Stall Influence

NASA Astrophysics Data System (ADS)

Feroskhan, Mir Alikhan Bin Mohammad

Perching is a type of aggressive maneuver performed by the class 'Aves' species to attain precision point landing with a generally short landing distance. Perching capability is desirable on unmanned aerial vehicles (UAVs) due to its efficient deceleration process that potentially expands the functionality and flight envelope of the aircraft. This dissertation extends the previous works on perching, which is mostly limited to two-dimensional (2D) cases, to its state-of-the-art threedimensional (3D) variety. This dissertation presents the aerodynamic modeling and optimization framework adopted to generate unprecedented variants of the 3D perching maneuver that include the sideslip perching trajectory, which ameliorates the existing 2D perching concept by eliminating the undesirable undershoot and reliance on gravity. The sideslip perching technique methodically utilizes the lateral and longitudinal drag mechanisms through consecutive phases of yawing and pitching-up motion. Since perching maneuver involves high rates of change in the angles of attack and large turn rates, introduction of three internal variables thus becomes necessary for addressing the influence of dynamic stall delay on the UAV's transient post-stall behavior. These variables are then integrated into a static nonlinear aerodynamic model, developed using empirical and analytical methods, and into an optimization framework that generates a trajectory of sideslip perching maneuver, acquiring over 70% velocity reduction. An impact study of the dynamic stall influence on the optimal perching trajectories suggests that consideration of dynamic stall delay is essential due to the significant discrepancies in the corresponding control inputs required. A comparative study between 2D and 3D perching is also conducted to examine the different drag mechanisms employed by 2D and 3D perching respectively. 3D perching is presented as a more efficient deceleration technique with respect to spatial costs and initial altitude range. Contraction analysis is shown to be a useful technique in identifying the state variables that are required to be tracked for attaining stability of optimal perching trajectories. Based on the selected tracking variables, two sliding control strategies are proposed and comparatively examined to close the control loop and provide the required robustness and convergence to the optimal perching trajectory in the presence of perturbations and dynamic stall model inaccuracies. This dissertation concludes that the sliding controller with the adaptive gain feature is more effective and essential in providing better tracking performance through illustrations of the corresponding convergence area and at higher intensity of perturbations.

Trajectory optimization for the National aerospace plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1993-01-01

While continuing the application of the inverse dynamics approach in obtaining the optimal numerical solutions, the research during the past six months has been focused on the formulation and derivation of closed-form solutions for constrained hypersonic flight trajectories. Since it was found in the research of the first year that a dominant portion of the optimal ascent trajectory of the aerospace plane is constrained by dynamic pressure and heating constraints, the application of the analytical solutions significantly enhances the efficiency in trajectory optimization, provides a better insight to understanding of the trajectory and conceivably has great potential in guidance of the vehicle. Work of this period has been reported in four technical papers. Two of the papers were presented in the AIAA Guidance, Navigation, and Control Conference (Hilton Head, SC, August, 1992) and Fourth International Aerospace Planes Conference (Orlando, FL, December, 1992). The other two papers have been accepted for publication by Journal of Guidance, Control, and Dynamics, and will appear in 1993. This report briefly summarizes the work done in the past six months and work currently underway.

TU-AB-201-04: Optimizing the Number of Catheter Implants and Their Tracks for Prostate HDR Brachytherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Riofrio, D; Luan, S; Zhou, J

Purpose: In prostate HDR brachytherapy, interstitial implants are placed manually on the fly. The aim for this research is to develop a computer algorithm to find optimal and reliable implant trajectories using minimal number of implants. Methods: Our new algorithm mainly uses these key ideas: (1) positive charged static particles are uniformly placed on the surface of prostate and critical structures such as urethra, bladder, and rectum. (2) Positive charged kinetic particles are placed at a cross-section of the prostate with an initial velocity parallel to the principal implant direction. (3) The kinetic particles move through the prostate, interacting withmore » each other, spreading out, while staying away from the prostate surface and critical structures. The initial velocity ensures that the trajectories observe the curvature constraints of typical implant procedures. (4) The finial trajectories of kinetic particles are smoothed using a third-degree polynomial regression, which become the implant trajectories. (5) The dwelling times and final dose distribution are calculated using least-distance programming. Results: (1) We experimented with previously treated cases. Our plan achieves all prescription goals while reducing the number of implants by 41%! Our plan also has less uniform target dose, which implies a higher dose is delivered to the prostate. (2) We expect future implant procedures will be performed under the guidance of such pre-calculated trajectories. To assess the applicability, we randomly perturb the tracks to mimic the manual implant errors. Our studies showed the impact of these perturbations are negligible, which is compensated by the least distance programming. Conclusions: We developed a new inverse planning system for prostate HDR therapy that can find optimal implant trajectories while minimizing the number of implants. For future work, we plan to integrate our new inverse planning system with an existing needle tracking system.« less

A study of variable thrust, variable specific impulse trajectories for solar system exploration

NASA Astrophysics Data System (ADS)

Sakai, Tadashi

A study has been performed to determine the advantages and disadvantages of variable thrust and variable Isp (specific impulse) trajectories for solar system exploration. There have been several numerical research efforts for variable thrust, variable Isp, power-limited trajectory optimization problems. All of these results conclude that variable thrust, variable Isp (variable specific impulse, or VSI) engines are superior to constant thrust, constant Isp (constant specific impulse; or CSI) engines. However, most of these research efforts assume a mission from Earth to Mars, and some of them further assume that these planets are circular and coplanar. Hence they still lack the generality. This research has been conducted to answer the following questions: (1) Is a VSI engine always better than a CSI engine or a high thrust engine for any mission to any planet with any time of flight considering lower propellant mass as the sole criterion? (2) If a planetary swing-by is used for a VSI trajectory, is the fuel savings of a VSI swing-by trajectory better than that of a CSI swing-by or high thrust swing-by trajectory? To support this research, an unique, new computer-based interplanetary trajectory calculation program has been created. This program utilizes a calculus of variations algorithm to perform overall optimization of thrust, Isp, and thrust vector direction along a trajectory that minimizes fuel consumption for interplanetary travel. It is assumed that the propulsion system is power-limited, and thus the compromise between thrust and Isp is a variable to be optimized along the flight path. This program is capable of optimizing not only variable thrust trajectories but also constant thrust trajectories in 3-D space using a planetary ephemeris database. It is also capable of conducting planetary swing-bys. Using this program, various Earth-originating trajectories have been investigated and the optimized results have been compared to traditional CSI and high thrust trajectory solutions. Results show that VSI rocket engines reduce fuel requirements for any mission compared to CSI rocket engines. Fuel can be saved by applying swing-by maneuvers for VSI engines; but the effects of swing-bys due to VSI engines are smaller than that of CSI or high thrust engines.

A New Computational Technique for the Generation of Optimised Aircraft Trajectories

NASA Astrophysics Data System (ADS)

Chircop, Kenneth; Gardi, Alessandro; Zammit-Mangion, David; Sabatini, Roberto

2017-12-01

A new computational technique based on Pseudospectral Discretisation (PSD) and adaptive bisection ɛ-constraint methods is proposed to solve multi-objective aircraft trajectory optimisation problems formulated as nonlinear optimal control problems. This technique is applicable to a variety of next-generation avionics and Air Traffic Management (ATM) Decision Support Systems (DSS) for strategic and tactical replanning operations. These include the future Flight Management Systems (FMS) and the 4-Dimensional Trajectory (4DT) planning and intent negotiation/validation tools envisaged by SESAR and NextGen for a global implementation. In particular, after describing the PSD method, the adaptive bisection ɛ-constraint method is presented to allow an efficient solution of problems in which two or multiple performance indices are to be minimized simultaneously. Initial simulation case studies were performed adopting suitable aircraft dynamics models and addressing a classical vertical trajectory optimisation problem with two objectives simultaneously. Subsequently, a more advanced 4DT simulation case study is presented with a focus on representative ATM optimisation objectives in the Terminal Manoeuvring Area (TMA). The simulation results are analysed in-depth and corroborated by flight performance analysis, supporting the validity of the proposed computational techniques.

Path integral learning of multidimensional movement trajectories

NASA Astrophysics Data System (ADS)

André, João; Santos, Cristina; Costa, Lino

2013-10-01

This paper explores the use of Path Integral Methods, particularly several variants of the recent Path Integral Policy Improvement (PI2) algorithm in multidimensional movement parametrized policy learning. We rely on Dynamic Movement Primitives (DMPs) to codify discrete and rhythmic trajectories, and apply the PI2-CMA and PIBB methods in the learning of optimal policy parameters, according to different cost functions that inherently encode movement objectives. Additionally we merge both of these variants and propose the PIBB-CMA algorithm, comparing all of them with the vanilla version of PI2. From the obtained results we conclude that PIBB-CMA surpasses all other methods in terms of convergence speed and iterative final cost, which leads to an increased interest in its application to more complex robotic problems.

Complexity Science Applications to Dynamic Trajectory Management: Research Strategies

NASA Technical Reports Server (NTRS)

Sawhill, Bruce; Herriot, James; Holmes, Bruce J.; Alexandrov, Natalia

2009-01-01

The promise of the Next Generation Air Transportation System (NextGen) is strongly tied to the concept of trajectory-based operations in the national airspace system. Existing efforts to develop trajectory management concepts are largely focused on individual trajectories, optimized independently, then de-conflicted among each other, and individually re-optimized, as possible. The benefits in capacity, fuel, and time are valuable, though perhaps could be greater through alternative strategies. The concept of agent-based trajectories offers a strategy for automation of simultaneous multiple trajectory management. The anticipated result of the strategy would be dynamic management of multiple trajectories with interacting and interdependent outcomes that satisfy multiple, conflicting constraints. These constraints would include the business case for operators, the capacity case for the Air Navigation Service Provider (ANSP), and the environmental case for noise and emissions. The benefits in capacity, fuel, and time might be improved over those possible under individual trajectory management approaches. The proposed approach relies on computational agent-based modeling (ABM), combinatorial mathematics, as well as application of "traffic physics" concepts to the challenge, and modeling and simulation capabilities. The proposed strategy could support transforming air traffic control from managing individual aircraft behaviors to managing systemic behavior of air traffic in the NAS. A system built on the approach could provide the ability to know when regions of airspace approach being "full," that is, having non-viable local solution space for optimizing trajectories in advance.

A six degree of freedom, plume-fuel optimal trajectory planner for spacecraft proximity operations using an A* node search. M.S. Thesis - MIT

NASA Technical Reports Server (NTRS)

Jackson, Mark Charles

1994-01-01

Spacecraft proximity operations are complicated by the fact that exhaust plume impingement from the reaction control jets of space vehicles can cause structural damage, contamination of sensitive arrays and instruments, or attitude misalignment during docking. The occurrence and effect of jet plume impingement can be reduced by planning approach trajectories with plume effects considered. An A* node search is used to find plume-fuel optimal trajectories through a discretized six dimensional attitude-translation space. A plume cost function which approximates jet plume isopressure envelopes is presented. The function is then applied to find relative costs for predictable 'trajectory altering' firings and unpredictable 'deadbanding' firings. Trajectory altering firings are calculated by running the spacecraft jet selection algorithm and summing the cost contribution from each jet fired. A 'deadbanding effects' function is defined and integrated to determine the potential for deadbanding impingement along candidate trajectories. Plume costs are weighed against fuel costs in finding the optimal solution. A* convergence speed is improved by solving approach trajectory problems in reverse time. Results are obtained on a high fidelity space shuttle/space station simulation. Trajectory following is accomplished by a six degree of freedom autopilot. Trajectories planned with, and without, plume costs are compared in terms of force applied to the target structure.

Singular perturbation techniques for real time aircraft trajectory optimization and control

NASA Technical Reports Server (NTRS)

Calise, A. J.; Moerder, D. D.

1982-01-01

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Optimism and Pessimism as Predictors of Alcohol Use Trajectories in Adolescence

ERIC Educational Resources Information Center

Wray, Tyler B.; Dvorak, Rob D.; Hsia, Jennifer F.; Arens, Ashley M.; Schweinle, William E.

2013-01-01

A range of research has recognized the benefits of optimism in a variety of health-related outcomes. Pessimism has received less attention but may be a distinct concept that is uniquely related to certain health behaviors, including drug use. The present study examined relationships between optimism and pessimism and alcohol use trajectories of…

An Interpolation Approach to Optimal Trajectory Planning for Helicopter Unmanned Aerial Vehicles

DTIC Science & Technology

2012-06-01

Armament Data Line DOF Degree of Freedom PS Pseudospectral LGL Legendre -Gauss-Lobatto quadrature nodes ODE Ordinary Differential Equation xiv...low order polynomials patched together in such away so that the resulting trajectory has several continuous derivatives at all points. In [7], Murray...claims that splines are ideal for optimal control problems because each segment of the spline’s piecewise polynomials approximate the trajectory

Gamma guidance of trajectories for coplanar, aeroassisted orbital transfer

NASA Technical Reports Server (NTRS)

Miele, A.; Wang, T.

1990-01-01

The optimization and guidance of trajectories for coplaner, aeroassisted orbital transfer (AOT) from high Earth orbit (HEO) to low Earth orbit (LEO) are examined. In particular, HEO can be a geosynchronous Earth orbit (GEO). It is assumed that the initial and final orbits are circular, that the gravitational field is central and is governed by the inverse square law, and that at most three impulses are employed: one at HEO exit, one at atmospheric exit, and one at LEO entry. It is also assumed that, during the atmospheric pass, the trajectory is controlled via the lift coefficient. The presence of upper and lower bounds on the lift coefficient is considered. First, optimal trajectories are computed by minimizing the total velocity impulse (hence, the propellant consumption) required for AOT transfer. The sequential gradient-restoration algorithm (SGRA) is used for optimal control problems. The optimal trajectory is shown to include two branches: a relatively short descending flight branch (branch 1) and a long ascending flight branch (branch 2). Next, attention is focused on guidance trajectories capable of approximating the optimal trajectories in real time, while retaining the essential characteristics of simplicity, ease of implementation, and reliability. For the atmospheric pass, a feedback control scheme is employed and the lift coefficient is adjusted according to a two-stage gamma guidance law. Further improvements are possible via a modified gamma guidance which is more stable with respect to dispersion effects arising from navigation errors, variations of the atmospheric density, and uncertainties in the aerodynamic coefficients than gamma guidance trajectory. A byproduct of the studies on dispersion effects is the following design concept. For coplaner aeroassisted orbital transfer, the lift-range-to-weight ratio appears to play a more important role than the lift-to-drag ratio. This is because the lift-range-to-weight ratio controls mainly the minimum altitude (hence, the peak heating rate) of the guidance trajectory; on the other hand, the lift-to-drag ratio controls mainly the duration of the atmospheric pass of the guidance trajectory.

A study of the application of singular perturbation theory. [development of a real time algorithm for optimal three dimensional aircraft maneuvers

NASA Technical Reports Server (NTRS)

Mehra, R. K.; Washburn, R. B.; Sajan, S.; Carroll, J. V.

1979-01-01

A hierarchical real time algorithm for optimal three dimensional control of aircraft is described. Systematic methods are developed for real time computation of nonlinear feedback controls by means of singular perturbation theory. The results are applied to a six state, three control variable, point mass model of an F-4 aircraft. Nonlinear feedback laws are presented for computing the optimal control of throttle, bank angle, and angle of attack. Real Time capability is assessed on a TI 9900 microcomputer. The breakdown of the singular perturbation approximation near the terminal point is examined Continuation methods are examined to obtain exact optimal trajectories starting from the singular perturbation solutions.

Aerospace plane guidance using geometric control theory

NASA Technical Reports Server (NTRS)

Van Buren, Mark A.; Mease, Kenneth D.

1990-01-01

A reduced-order method employing decomposition, based on time-scale separation, of the 4-D state space in a 2-D slow manifold and a family of 2-D fast manifolds is shown to provide an excellent approximation to the full-order minimum-fuel ascent trajectory. Near-optimal guidance is obtained by tracking the reduced-order trajectory. The tracking problem is solved as regulation problems on the family of fast manifolds, using the exact linearization methodology from nonlinear geometric control theory. The validity of the overall guidance approach is indicated by simulation.

TH-EF-BRB-02: Feasibility of Optimization for Dynamic Trajectory Radiotherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fix, MK; Frei, D; Volken, W

2016-06-15

Purpose: Over the last years, volumetric modulated arc therapy (VMAT) has been widely introduced into clinical routine using a coplanar delivery technique. However, VMAT might be improved by including dynamic couch and collimator rotations, leading to dynamic trajectory radiotherapy (DTRT). In this work the feasibility and the potential benefit of DTRT was investigated. Methods: A general framework for the optimization was developed using the Eclipse Scripting Research Application Programming Interface (ESRAPI). Based on contoured target and organs at risk (OARs), the structures are extracted using the ESRAPI. Sampling potential beam directions, regularly distributed on a sphere using a Fibanocci-lattice, themore » fractional volume-overlap of each OAR and the target is determined and used to establish dynamic gantry-couch movements. Then, for each gantry-couch track the most suitable collimator angle is determined for each control point by optimizing the area between the MLC leaves and the target contour. The resulting dynamic trajectories are used as input to perform the optimization using a research version of the VMAT optimization algorithm and the ESRAPI. The feasibility of this procedure was tested for a clinically motivated head and neck case. Resulting dose distributions for the VMAT plan and for the dynamic trajectory treatment plan were compared based on DVH-parameters. Results: While the DVH for the target is virtually preserved, improvements in maximum dose for the DTRT plan were achieved for all OARs except for the inner-ear, where maximum dose remains the same. The major improvements in maximum dose were 6.5% of the prescribed dose (66 Gy) for the parotid and 5.5% for the myelon and the eye. Conclusion: The result of this work suggests that DTRT has a great potential to reduce dose to OARs with similar target coverage when compared to conventional VMAT treatment plans. This work was supported by Varian Medical Systems. This work was supported by Varian Medical Systems.« less

Identification of optimal feedback control rules from micro-quadrotor and insect flight trajectories.

PubMed

Faruque, Imraan A; Muijres, Florian T; Macfarlane, Kenneth M; Kehlenbeck, Andrew; Humbert, J Sean

2018-06-01

This paper presents "optimal identification," a framework for using experimental data to identify the optimality conditions associated with the feedback control law implemented in the measurements. The technique compares closed loop trajectory measurements against a reduced order model of the open loop dynamics, and uses linear matrix inequalities to solve an inverse optimal control problem as a convex optimization that estimates the controller optimality conditions. In this study, the optimal identification technique is applied to two examples, that of a millimeter-scale micro-quadrotor with an engineered controller on board, and the example of a population of freely flying Drosophila hydei maneuvering about forward flight. The micro-quadrotor results show that the performance indices used to design an optimal flight control law for a micro-quadrotor may be recovered from the closed loop simulated flight trajectories, and the Drosophila results indicate that the combined effect of the insect longitudinal flight control sensing and feedback acts principally to regulate pitch rate.

Multiple-Vehicle Resource-Constrained Navigation in the Deep Ocean

DTIC Science & Technology

2011-09-01

Kalman filtering is often used in practice with intermit - tent observations, which uses the simple intuitive result that the optimal method for...trajectory? This level is concerned with fast vehicle dynamics, which are highly dependent on the particular vehicle design and hydrodynamics. Some

Trajectory Tracking of a Planer Parallel Manipulator by Using Computed Force Control Method

NASA Astrophysics Data System (ADS)

Bayram, Atilla

2017-03-01

Despite small workspace, parallel manipulators have some advantages over their serial counterparts in terms of higher speed, acceleration, rigidity, accuracy, manufacturing cost and payload. Accordingly, this type of manipulators can be used in many applications such as in high-speed machine tools, tuning machine for feeding, sensitive cutting, assembly and packaging. This paper presents a special type of planar parallel manipulator with three degrees of freedom. It is constructed as a variable geometry truss generally known planar Stewart platform. The reachable and orientation workspaces are obtained for this manipulator. The inverse kinematic analysis is solved for the trajectory tracking according to the redundancy and joint limit avoidance. Then, the dynamics model of the manipulator is established by using Virtual Work method. The simulations are performed to follow the given planar trajectories by using the dynamic equations of the variable geometry truss manipulator and computed force control method. In computed force control method, the feedback gain matrices for PD control are tuned with fixed matrices by trail end error and variable ones by means of optimization with genetic algorithm.

Optimal estimation of diffusion coefficients from single-particle trajectories

NASA Astrophysics Data System (ADS)

Vestergaard, Christian L.; Blainey, Paul C.; Flyvbjerg, Henrik

2014-02-01

How does one optimally determine the diffusion coefficient of a diffusing particle from a single-time-lapse recorded trajectory of the particle? We answer this question with an explicit, unbiased, and practically optimal covariance-based estimator (CVE). This estimator is regression-free and is far superior to commonly used methods based on measured mean squared displacements. In experimentally relevant parameter ranges, it also outperforms the analytically intractable and computationally more demanding maximum likelihood estimator (MLE). For the case of diffusion on a flexible and fluctuating substrate, the CVE is biased by substrate motion. However, given some long time series and a substrate under some tension, an extended MLE can separate particle diffusion on the substrate from substrate motion in the laboratory frame. This provides benchmarks that allow removal of bias caused by substrate fluctuations in CVE. The resulting unbiased CVE is optimal also for short time series on a fluctuating substrate. We have applied our estimators to human 8-oxoguanine DNA glycolase proteins diffusing on flow-stretched DNA, a fluctuating substrate, and found that diffusion coefficients are severely overestimated if substrate fluctuations are not accounted for.

Time-optimal trajectory planning for underactuated spacecraft using a hybrid particle swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Zhuang, Yufei; Huang, Haibin

2014-02-01

A hybrid algorithm combining particle swarm optimization (PSO) algorithm with the Legendre pseudospectral method (LPM) is proposed for solving time-optimal trajectory planning problem of underactuated spacecrafts. At the beginning phase of the searching process, an initialization generator is constructed by the PSO algorithm due to its strong global searching ability and robustness to random initial values, however, PSO algorithm has a disadvantage that its convergence rate around the global optimum is slow. Then, when the change in fitness function is smaller than a predefined value, the searching algorithm is switched to the LPM to accelerate the searching process. Thus, with the obtained solutions by the PSO algorithm as a set of proper initial guesses, the hybrid algorithm can find a global optimum more quickly and accurately. 200 Monte Carlo simulations results demonstrate that the proposed hybrid PSO-LPM algorithm has greater advantages in terms of global searching capability and convergence rate than both single PSO algorithm and LPM algorithm. Moreover, the PSO-LPM algorithm is also robust to random initial values.

Trajectory planning and optimal tracking for an industrial mobile robot

NASA Astrophysics Data System (ADS)

Hu, Huosheng; Brady, J. Michael; Probert, Penelope J.

1994-02-01

This paper introduces a unified approach to trajectory planning and tracking for an industrial mobile robot subject to non-holonomic constraints. We show (1) how a smooth trajectory is generated that takes into account the constraints from the dynamic environment and the robot kinematics; and (2) how a general predictive controller works to provide optimal tracking capability for nonlinear systems. The tracking performance of the proposed guidance system is analyzed by simulation.

Multi-Target Tracking via Mixed Integer Optimization

DTIC Science & Technology

2016-05-13

solving these two problems separately, however few algorithms attempt to solve these simultaneously and even fewer utilize optimization. In this paper we...introduce a new mixed integer optimization (MIO) model which solves the data association and trajectory estimation problems simultaneously by minimizing...Kalman filter [5], which updates the trajectory estimates before the algorithm progresses forward to the next scan. This process repeats sequentially

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum.

PubMed

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents' positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness.

A Hybrid Spatio-Temporal Data Indexing Method for Trajectory Databases

PubMed Central

Ke, Shengnan; Gong, Jun; Li, Songnian; Zhu, Qing; Liu, Xintao; Zhang, Yeting

2014-01-01

In recent years, there has been tremendous growth in the field of indoor and outdoor positioning sensors continuously producing huge volumes of trajectory data that has been used in many fields such as location-based services or location intelligence. Trajectory data is massively increased and semantically complicated, which poses a great challenge on spatio-temporal data indexing. This paper proposes a spatio-temporal data indexing method, named HBSTR-tree, which is a hybrid index structure comprising spatio-temporal R-tree, B*-tree and Hash table. To improve the index generation efficiency, rather than directly inserting trajectory points, we group consecutive trajectory points as nodes according to their spatio-temporal semantics and then insert them into spatio-temporal R-tree as leaf nodes. Hash table is used to manage the latest leaf nodes to reduce the frequency of insertion. A new spatio-temporal interval criterion and a new node-choosing sub-algorithm are also proposed to optimize spatio-temporal R-tree structures. In addition, a B*-tree sub-index of leaf nodes is built to query the trajectories of targeted objects efficiently. Furthermore, a database storage scheme based on a NoSQL-type DBMS is also proposed for the purpose of cloud storage. Experimental results prove that HBSTR-tree outperforms TB*-tree in some aspects such as generation efficiency, query performance and query type. PMID:25051028

A hybrid spatio-temporal data indexing method for trajectory databases.

PubMed

Ke, Shengnan; Gong, Jun; Li, Songnian; Zhu, Qing; Liu, Xintao; Zhang, Yeting

2014-07-21

In recent years, there has been tremendous growth in the field of indoor and outdoor positioning sensors continuously producing huge volumes of trajectory data that has been used in many fields such as location-based services or location intelligence. Trajectory data is massively increased and semantically complicated, which poses a great challenge on spatio-temporal data indexing. This paper proposes a spatio-temporal data indexing method, named HBSTR-tree, which is a hybrid index structure comprising spatio-temporal R-tree, B*-tree and Hash table. To improve the index generation efficiency, rather than directly inserting trajectory points, we group consecutive trajectory points as nodes according to their spatio-temporal semantics and then insert them into spatio-temporal R-tree as leaf nodes. Hash table is used to manage the latest leaf nodes to reduce the frequency of insertion. A new spatio-temporal interval criterion and a new node-choosing sub-algorithm are also proposed to optimize spatio-temporal R-tree structures. In addition, a B*-tree sub-index of leaf nodes is built to query the trajectories of targeted objects efficiently. Furthermore, a database storage scheme based on a NoSQL-type DBMS is also proposed for the purpose of cloud storage. Experimental results prove that HBSTR-tree outperforms TB*-tree in some aspects such as generation efficiency, query performance and query type.

A Real-Time Brain-Machine Interface Combining Motor Target and Trajectory Intent Using an Optimal Feedback Control Design

PubMed Central

Shanechi, Maryam M.; Williams, Ziv M.; Wornell, Gregory W.; Hu, Rollin C.; Powers, Marissa; Brown, Emery N.

2013-01-01

Real-time brain-machine interfaces (BMI) have focused on either estimating the continuous movement trajectory or target intent. However, natural movement often incorporates both. Additionally, BMIs can be modeled as a feedback control system in which the subject modulates the neural activity to move the prosthetic device towards a desired target while receiving real-time sensory feedback of the state of the movement. We develop a novel real-time BMI using an optimal feedback control design that jointly estimates the movement target and trajectory of monkeys in two stages. First, the target is decoded from neural spiking activity before movement initiation. Second, the trajectory is decoded by combining the decoded target with the peri-movement spiking activity using an optimal feedback control design. This design exploits a recursive Bayesian decoder that uses an optimal feedback control model of the sensorimotor system to take into account the intended target location and the sensory feedback in its trajectory estimation from spiking activity. The real-time BMI processes the spiking activity directly using point process modeling. We implement the BMI in experiments consisting of an instructed-delay center-out task in which monkeys are presented with a target location on the screen during a delay period and then have to move a cursor to it without touching the incorrect targets. We show that the two-stage BMI performs more accurately than either stage alone. Correct target prediction can compensate for inaccurate trajectory estimation and vice versa. The optimal feedback control design also results in trajectories that are smoother and have lower estimation error. The two-stage decoder also performs better than linear regression approaches in offline cross-validation analyses. Our results demonstrate the advantage of a BMI design that jointly estimates the target and trajectory of movement and more closely mimics the sensorimotor control system. PMID:23593130

Optimal Trajectories and Control Strategies for the Helicopter in One-Engine-Inoperative Terminal-Area Operations

NASA Technical Reports Server (NTRS)

Chen, Robert T. N.; Zhao, Yi-Yuan; Aiken, Edwin W. (Technical Monitor)

1995-01-01

Engine failure represents a major safety concern to helicopter operations, especially in the critical flight phases of takeoff and landing from/to small, confined areas. As a result, the JAA and FAA both certificate a transport helicopter as either Category-A or Category-B according to the ability to continue its operations following engine failures. A Category-B helicopter must be able to land safely in the event of one or all engine failures. There is no requirement, however, for continued flight capability. In contrast, Category-A certification, which applies to multi-engine transport helicopters with independent engine systems, requires that they continue the flight with one engine inoperative (OEI). These stringent requirements, while permitting its operations from rooftops and oil rigs and flight to areas where no emergency landing sites are available, restrict the payload of a Category-A transport helicopter to a value safe for continued flight as well as for landing with one engine inoperative. The current certification process involves extensive flight tests, which are potentially dangerous, costly, and time consuming. These tests require the pilot to simulate engine failures at increasingly critical conditions, Flight manuals based on these tests tend to provide very conservative recommendations with regard to maximum takeoff weight or required runway length. There are very few theoretical studies on this subject to identify the fundamental parameters and tradeoff factors involved. Furthermore, a capability for real-time generation of OEI optimal trajectories is very desirable for providing timely cockpit display guidance to assist the pilot in reducing his workload and to increase safety in a consistent and reliable manner. A joint research program involving NASA Ames Research Center, the FAA, and the University of Minnesota is being conducted to determine OEI optimal control strategies and the associated optimal,trajectories for continued takeoff (CTO), rejected takeoff (RTO), balked landing (BL), and continued landing (CL) for a twin engine helicopter in both VTOL and STOL terminal-area operations. This proposed paper will present the problem formulation, the optimal control solution methods, and the key results of the trajectory optimization studies for both STOL and VTOL OEI operations. In addition, new results concerning the recently developed methodology, which enable a real-time generation of optimal OEI trajectories, will be presented in the paper. This new real-time capability was developed to support the second piloted simulator investigation on cockpit displays for Category-A operations being scheduled for the NASA Ames Vertical Motion Simulator in June-August of 1995. The first VMS simulation was conducted in 1994 and reported.

Impact of Airspace Charges on Transatlantic Aircraft Trajectories

NASA Technical Reports Server (NTRS)

Sridhar, Banavar; Ng, Hok K.; Linke, Florian; Chen, Neil Y.

2015-01-01

Aircraft flying over the airspace of different countries are subject to over-flight charges. These charges vary from country to country. Airspace charges, while necessary to support the communication, navigation and surveillance services, may lead to aircraft flying routes longer than wind-optimal routes and produce additional carbon dioxide and other gaseous emissions. This paper develops an optimal route between city pairs by modifying the cost function to include an airspace cost whenever an aircraft flies through a controlled airspace without landing or departing from that airspace. It is assumed that the aircraft will fly the trajectory at a constant cruise altitude and constant speed. The computationally efficient optimal trajectory is derived by solving a non-linear optimal control problem. The operational strategies investigated in this study for minimizing aircraft fuel burn and emissions include flying fuel-optimal routes and flying cost-optimal routes that may completely or partially reduce airspace charges en route. The results in this paper use traffic data for transatlantic flights during July 2012. The mean daily savings in over-flight charges, fuel cost and total operation cost during the period are 17.6 percent, 1.6 percent, and 2.4 percent respectively, along the cost- optimal trajectories. The transatlantic flights can potentially save $600,000 in fuel cost plus $360,000 in over-flight charges daily by flying the cost-optimal trajectories. In addition, the aircraft emissions can be potentially reduced by 2,070 metric tons each day. The airport pairs and airspace regions that have the highest potential impacts due to airspace charges are identified for possible reduction of fuel burn and aircraft emissions for the transatlantic flights. The results in the paper show that the impact of the variation in fuel price on the optimal routes is to reduce the difference between wind-optimal and cost-optimal routes as the fuel price increases. The additional fuel consumption is quantified using the 30 percent variation in fuel prices during March 2014 to March 2015.

Co-Optimization of Blunt Body Shapes for Moving Vehicles

NASA Technical Reports Server (NTRS)

Kinney, David J. (Inventor); Mansour, Nagi N (Inventor); Brown, James L. (Inventor); Garcia, Joseph A (Inventor); Bowles, Jeffrey V (Inventor)

2014-01-01

A method and associated system for multi-disciplinary optimization of various parameters associated with a space vehicle that experiences aerocapture and atmospheric entry in a specified atmosphere. In one embodiment, simultaneous maximization of a ratio of landed payload to vehicle atmospheric entry mass, maximization of fluid flow distance before flow separation from vehicle, and minimization of heat transfer to the vehicle are performed with respect to vehicle surface geometric parameters, and aerostructure and aerothermal vehicle response for the vehicle moving along a specified trajectory. A Pareto Optimal set of superior performance parameters is identified.

Optimal feedback strategies for pursuit-evasion and interception in a plane

NASA Technical Reports Server (NTRS)

Rajan, N.; Ardema, M. D.

1983-01-01

Variable-speed pursuit-evasion and interception for two aircraft moving in a horizontal plane are analyzed in terms of a coordinate frame fixed in the plane at termination. Each participant's optimal motion can be represented by extremal trajectory maps. These maps are used to discuss sub-optimal approximations that are independent of the other participant. A method of constructing sections of the barrier, dispersal, and control-level surfaces and thus determining feedback strategies is described. Some examples are shown for pursuit-evasion and the minimum-time interception of a straight-flying target.

Program to Optimize Simulated Trajectories (POST). Volume 3: Programmer's manual

NASA Technical Reports Server (NTRS)

Brauer, G. L.; Cornick, D. E.; Habeger, A. R.; Petersen, F. M.; Stevenson, R.

1975-01-01

Information pertinent to the programmer and relating to the program to optimize simulated trajectories (POST) is presented. Topics discussed include: program structure and logic, subroutine listings and flow charts, and internal FORTRAN symbols. The POST core requirements are summarized along with program macrologic.

Optimal aeroassisted coplanar orbital transfer using an energy model

NASA Technical Reports Server (NTRS)

Halyo, Nesim; Taylor, Deborah B.

1989-01-01

The atmospheric portion of the trajectories for the aeroassisted coplanar orbit transfer was investigated. The equations of motion for the problem are expressed using reduced order model and total vehicle energy, kinetic plus potential, as the independent variable rather than time. The order reduction is achieved analytically without an approximation of the vehicle dynamics. In this model, the problem of coplanar orbit transfer is seen as one in which a given amount of energy must be transferred from the vehicle to the atmosphere during the trajectory without overheating the vehicle. An optimal control problem is posed where a linear combination of the integrated square of the heating rate and the vehicle drag is the cost function to be minimized. The necessary conditions for optimality are obtained. These result in a 4th order two-point-boundary-value problem. A parametric study of the optimal guidance trajectory in which the proportion of the heating rate term versus the drag varies is made. Simulations of the guidance trajectories are presented.

Developmental Trajectories of Subjective Social Status.

PubMed

Goodman, Elizabeth; Maxwell, Sarah; Malspeis, Susan; Adler, Nancy

2015-09-01

Subjective social status (SSS), a person's sense of their (or for youth, abstract their family's) position in the socioeconomic hierarchy, is strongly related to health in adults but not health in adolescence. Understanding this developmental discrepancy requires first understanding the developmental trajectory of SSS. The objective of this study was to identify the number and shape of SSS trajectories as adolescents transition to adulthood and explore if trajectory membership affects health. Using data from 7436 assessments from the Princeton School District Study, a decade long cohort study of non-Hispanic black and white youth, latent class growth models with 3 to 7 SSS trajectories were developed. Model fit, trajectory structure, and shape were used to guide optimal model selection. Using this optimal model, the associations of trajectory membership with BMI and depressive symptoms in young adulthood were explored. The 5-class model was optimal. In this model, trajectories were persistent high (7.8%),mid–high (32.2%), middle (43.4%), low–lower (7.4%), and high–low (9.1%). Non-Hispanic black race/ethnicity, lower household income, and low parent education were associated with membership in this high–low trajectory. High–low trajectory membership was associated with higher BMI and depressive symptoms in non-Hispanic white subjects but was not associated with depressive symptoms. It was associated with lower BMI only after adjustment for BMI in adolescence in non-Hispanic black subjects. SSS is relatively stable in adolescence and the transition to adulthood, and it generally reflects objective markers of social advantage. However, socially disadvantaged youth with high SSS in early adolescence may be at increased health risk.

Minimum Fuel Trajectory Design in Multiple Dynamical Environments Utilizing Direct Transcription Methods and Particle Swarm Optimization

DTIC Science & Technology

2016-03-01

89 3.1.3 NLP Improvement...3.2.1.2 NLP Improvement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 3.2.2 Multiple-burn Planar LEO to GEO Transfer...101 3.2.2.1 PSO Initial Guess Generation . . . . . . . . . . . . . . . . . . . . . 101 3.2.2.2 NLP Improvement

Kinetic constrained optimization of the golf swing hub path.

PubMed

Nesbit, Steven M; McGinnis, Ryan S

2014-12-01

This study details an optimization of the golf swing, where the hand path and club angular trajectories are manipulated. The optimization goal was to maximize club head velocity at impact within the interaction kinetic limitations (force, torque, work, and power) of the golfer as determined through the analysis of a typical swing using a two-dimensional dynamic model. The study was applied to four subjects with diverse swing capabilities and styles. It was determined that it is possible for all subjects to increase their club head velocity at impact within their respective kinetic limitations through combined modifications to their respective hand path and club angular trajectories. The manner of the modifications, the degree of velocity improvement, the amount of kinetic reduction, and the associated kinetic limitation quantities were subject dependent. By artificially minimizing selected kinetic inputs within the optimization algorithm, it was possible to identify swing trajectory characteristics that indicated relative kinetic weaknesses of a subject. Practical implications are offered based upon the findings of the study. Key PointsThe hand path trajectory is an important characteristic of the golf swing and greatly affects club head velocity and golfer/club energy transfer.It is possible to increase the energy transfer from the golfer to the club by modifying the hand path and swing trajectories without increasing the kinetic output demands on the golfer.It is possible to identify relative kinetic output strengths and weakness of a golfer through assessment of the hand path and swing trajectories.Increasing any one of the kinetic outputs of the golfer can potentially increase the club head velocity at impact.The hand path trajectory has important influences over the club swing trajectory.

Kinetic Constrained Optimization of the Golf Swing Hub Path

PubMed Central

Nesbit, Steven M.; McGinnis, Ryan S.

2014-01-01

This study details an optimization of the golf swing, where the hand path and club angular trajectories are manipulated. The optimization goal was to maximize club head velocity at impact within the interaction kinetic limitations (force, torque, work, and power) of the golfer as determined through the analysis of a typical swing using a two-dimensional dynamic model. The study was applied to four subjects with diverse swing capabilities and styles. It was determined that it is possible for all subjects to increase their club head velocity at impact within their respective kinetic limitations through combined modifications to their respective hand path and club angular trajectories. The manner of the modifications, the degree of velocity improvement, the amount of kinetic reduction, and the associated kinetic limitation quantities were subject dependent. By artificially minimizing selected kinetic inputs within the optimization algorithm, it was possible to identify swing trajectory characteristics that indicated relative kinetic weaknesses of a subject. Practical implications are offered based upon the findings of the study. Key Points The hand path trajectory is an important characteristic of the golf swing and greatly affects club head velocity and golfer/club energy transfer. It is possible to increase the energy transfer from the golfer to the club by modifying the hand path and swing trajectories without increasing the kinetic output demands on the golfer. It is possible to identify relative kinetic output strengths and weakness of a golfer through assessment of the hand path and swing trajectories. Increasing any one of the kinetic outputs of the golfer can potentially increase the club head velocity at impact. The hand path trajectory has important influences over the club swing trajectory. PMID:25435779

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

NASA Technical Reports Server (NTRS)

Brown, Aaron J.

2015-01-01

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Near-Optimal Guidance Method for Maximizing the Reachable Domain of Gliding Aircraft

NASA Astrophysics Data System (ADS)

Tsuchiya, Takeshi

This paper proposes a guidance method for gliding aircraft by using onboard computers to calculate a near-optimal trajectory in real-time, and thereby expanding the reachable domain. The results are applicable to advanced aircraft and future space transportation systems that require high safety. The calculation load of the optimal control problem that is used to maximize the reachable domain is too large for current computers to calculate in real-time. Thus the optimal control problem is divided into two problems: a gliding distance maximization problem in which the aircraft motion is limited to a vertical plane, and an optimal turning flight problem in a horizontal direction. First, the former problem is solved using a shooting method. It can be solved easily because its scale is smaller than that of the original problem, and because some of the features of the optimal solution are obtained in the first part of this paper. Next, in the latter problem, the optimal bank angle is computed from the solution of the former; this is an analytical computation, rather than an iterative computation. Finally, the reachable domain obtained from the proposed near-optimal guidance method is compared with that obtained from the original optimal control problem.

Solar Sail Spaceflight Simulation

NASA Technical Reports Server (NTRS)

Lisano, Michael; Evans, James; Ellis, Jordan; Schimmels, John; Roberts, Timothy; Rios-Reyes, Leonel; Scheeres, Daniel; Bladt, Jeff; Lawrence, Dale; Piggott, Scott

2007-01-01

The Solar Sail Spaceflight Simulation Software (S5) toolkit provides solar-sail designers with an integrated environment for designing optimal solar-sail trajectories, and then studying the attitude dynamics/control, navigation, and trajectory control/correction of sails during realistic mission simulations. Unique features include a high-fidelity solar radiation pressure model suitable for arbitrarily-shaped solar sails, a solar-sail trajectory optimizer, capability to develop solar-sail navigation filter simulations, solar-sail attitude control models, and solar-sail high-fidelity force models.

Generalized gradient algorithm for trajectory optimization

NASA Technical Reports Server (NTRS)

Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

1990-01-01

The generalized gradient algorithm presented and verified as a basis for the solution of trajectory optimization problems improves the performance index while reducing path equality constraints, and terminal equality constraints. The algorithm is conveniently divided into two phases, of which the first, 'feasibility' phase yields a solution satisfying both path and terminal constraints, while the second, 'optimization' phase uses the results of the first phase as initial guesses.

Fuel optimization for low-thrust Earth-Moon transfer via indirect optimal control

NASA Astrophysics Data System (ADS)

Pérez-Palau, Daniel; Epenoy, Richard

2018-02-01

The problem of designing low-energy transfers between the Earth and the Moon has attracted recently a major interest from the scientific community. In this paper, an indirect optimal control approach is used to determine minimum-fuel low-thrust transfers between a low Earth orbit and a Lunar orbit in the Sun-Earth-Moon Bicircular Restricted Four-Body Problem. First, the optimal control problem is formulated and its necessary optimality conditions are derived from Pontryagin's Maximum Principle. Then, two different solution methods are proposed to overcome the numerical difficulties arising from the huge sensitivity of the problem's state and costate equations. The first one consists in the use of continuation techniques. The second one is based on a massive exploration of the set of unknown variables appearing in the optimality conditions. The dimension of the search space is reduced by considering adapted variables leading to a reduction of the computational time. The trajectories found are classified in several families according to their shape, transfer duration and fuel expenditure. Finally, an analysis based on the dynamical structure provided by the invariant manifolds of the two underlying Circular Restricted Three-Body Problems, Earth-Moon and Sun-Earth is presented leading to a physical interpretation of the different families of trajectories.

A weak Hamiltonian finite element method for optimal control problems

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.; Bless, Robert R.

1989-01-01

A temporal finite element method based on a mixed form of the Hamiltonian weak principle is developed for dynamics and optimal control problems. The mixed form of Hamilton's weak principle contains both displacements and momenta as primary variables that are expanded in terms of nodal values and simple polynomial shape functions. Unlike other forms of Hamilton's principle, however, time derivatives of the momenta and displacements do not appear therein; instead, only the virtual momenta and virtual displacements are differentiated with respect to time. Based on the duality that is observed to exist between the mixed form of Hamilton's weak principle and variational principles governing classical optimal control problems, a temporal finite element formulation of the latter can be developed in a rather straightforward manner. Several well-known problems in dynamics and optimal control are illustrated. The example dynamics problem involves a time-marching problem. As optimal control examples, elementary trajectory optimization problems are treated.

A weak Hamiltonian finite element method for optimal control problems

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.; Bless, Robert R.

1990-01-01

A temporal finite element method based on a mixed form of the Hamiltonian weak principle is developed for dynamics and optimal control problems. The mixed form of Hamilton's weak principle contains both displacements and momenta as primary variables that are expanded in terms of nodal values and simple polynomial shape functions. Unlike other forms of Hamilton's principle, however, time derivatives of the momenta and displacements do not appear therein; instead, only the virtual momenta and virtual displacements are differentiated with respect to time. Based on the duality that is observed to exist between the mixed form of Hamilton's weak principle and variational principles governing classical optimal control problems, a temporal finite element formulation of the latter can be developed in a rather straightforward manner. Several well-known problems in dynamics and optimal control are illustrated. The example dynamics problem involves a time-marching problem. As optimal control examples, elementary trajectory optimization problems are treated.

Weak Hamiltonian finite element method for optimal control problems

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.; Bless, Robert R.

1991-01-01

A temporal finite element method based on a mixed form of the Hamiltonian weak principle is developed for dynamics and optimal control problems. The mixed form of Hamilton's weak principle contains both displacements and momenta as primary variables that are expanded in terms of nodal values and simple polynomial shape functions. Unlike other forms of Hamilton's principle, however, time derivatives of the momenta and displacements do not appear therein; instead, only the virtual momenta and virtual displacements are differentiated with respect to time. Based on the duality that is observed to exist between the mixed form of Hamilton's weak principle and variational principles governing classical optimal control problems, a temporal finite element formulation of the latter can be developed in a rather straightforward manner. Several well-known problems in dynamics and optimal control are illustrated. The example dynamics problem involves a time-marching problem. As optimal control examples, elementary trajectory optimization problems are treated.

Path Planning Algorithms for Autonomous Border Patrol Vehicles

NASA Astrophysics Data System (ADS)

Lau, George Tin Lam

This thesis presents an online path planning algorithm developed for unmanned vehicles in charge of autonomous border patrol. In this Pursuit-Evasion game, the unmanned vehicle is required to capture multiple trespassers on its own before any of them reach a target safe house where they are safe from capture. The problem formulation is based on Isaacs' Target Guarding problem, but extended to the case of multiple evaders. The proposed path planning method is based on Rapidly-exploring random trees (RRT) and is capable of producing trajectories within several seconds to capture 2 or 3 evaders. Simulations are carried out to demonstrate that the resulting trajectories approach the optimal solution produced by a nonlinear programming-based numerical optimal control solver. Experiments are also conducted on unmanned ground vehicles to show the feasibility of implementing the proposed online path planning algorithm on physical applications.

An analytic model for footprint dispersions and its application to mission design

NASA Technical Reports Server (NTRS)

Rao, J. R. Jagannatha; Chen, Yi-Chao

1992-01-01

This is the final report on our recent research activities that are complementary to those conducted by our colleagues, Professor Farrokh Mistree and students, in the context of the Taguchi method. We have studied the mathematical model that forms the basis of the Simulation and Optimization of Rocket Trajectories (SORT) program and developed an analytic method for determining mission reliability with a reduced number of flight simulations. This method can be incorporated in a design algorithm to mathematically optimize different performance measures of a mission, thus leading to a robust and easy-to-use methodology for mission planning and design.

Locally optimal transfer trajectories between libration point orbits using invariant manifolds

NASA Astrophysics Data System (ADS)

Davis, Kathryn E.

2009-12-01

Techniques from dynamical systems theory and primer vector theory have been applied to the construction of locally optimal transfer trajectories between libration point orbits. When two libration point orbits have different energies, it has been found that the unstable manifold of the first orbit can be connected to the stable manifold of the second orbit with a bridging trajectory. A bounding sphere centered on the secondary, with a radius less than the radius of the sphere of influence of the secondary, was used to study the stable and unstable manifold trajectories. It was numerically demonstrated that within the bounding sphere, the two-body parameters of the unstable and stable manifold trajectories could be analyzed to locate low transfer costs. It was shown that as the two-body parameters of an unstable manifold trajectory more closely matched the two-body parameters of a stable manifold trajectory, the total DeltaV necessary to complete the transfer decreased. Primer vector theory was successfully applied to a transfer to determine the optimal maneuvers required to create the bridging trajectory that connected the unstable manifold of the first orbit to the stable manifold of the second orbit. Transfer trajectories were constructed between halo orbits in the Sun-Earth and Earth-Moon three-body systems. Multiple solutions were found between the same initial and final orbits, where certain solutions retraced interior portions of the trajectory. All of the trajectories created satisfied the conditions for optimality. The costs of transfers constructed using invariant manifolds were compared to the costs of transfers constructed without the use of invariant manifolds, when data was available. In all cases, the total cost of the transfers were significantly lower when invariant manifolds were used in the transfer construction. In many cases, the transfers that employed invariant manifolds were three to four times more efficient, in terms of fuel expenditure, than the transfer that did not. The decrease in transfer cost was accompanied by an increase in transfer time of flight. Transfers constructed in the Earth-Moon system were shown to be particularly viable for lunar navigation and communication constellations, as excellent coverage of the lunar surface can be achieved during the transfer.

SU-D-206-03: Segmentation Assisted Fast Iterative Reconstruction Method for Cone-Beam CT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, P; Mao, T; Gong, S

2016-06-15

Purpose: Total Variation (TV) based iterative reconstruction (IR) methods enable accurate CT image reconstruction from low-dose measurements with sparse projection acquisition, due to the sparsifiable feature of most CT images using gradient operator. However, conventional solutions require large amount of iterations to generate a decent reconstructed image. One major reason is that the expected piecewise constant property is not taken into consideration at the optimization starting point. In this work, we propose an iterative reconstruction method for cone-beam CT (CBCT) using image segmentation to guide the optimization path more efficiently on the regularization term at the beginning of the optimizationmore » trajectory. Methods: Our method applies general knowledge that one tissue component in the CT image contains relatively uniform distribution of CT number. This general knowledge is incorporated into the proposed reconstruction using image segmentation technique to generate the piecewise constant template on the first-pass low-quality CT image reconstructed using analytical algorithm. The template image is applied as an initial value into the optimization process. Results: The proposed method is evaluated on the Shepp-Logan phantom of low and high noise levels, and a head patient. The number of iterations is reduced by overall 40%. Moreover, our proposed method tends to generate a smoother reconstructed image with the same TV value. Conclusion: We propose a computationally efficient iterative reconstruction method for CBCT imaging. Our method achieves a better optimization trajectory and a faster convergence behavior. It does not rely on prior information and can be readily incorporated into existing iterative reconstruction framework. Our method is thus practical and attractive as a general solution to CBCT iterative reconstruction. This work is supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. LR16F010001), National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917).« less

Modified Newton-Raphson GRAPE methods for optimal control of spin systems

NASA Astrophysics Data System (ADS)

Goodwin, D. L.; Kuprov, Ilya

2016-05-01

Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.

Partial Validation of Multibody Program to Optimize Simulated Trajectories II (POST II) Parachute Simulation With Interacting Forces

NASA Technical Reports Server (NTRS)

Raiszadeh, Ben; Queen, Eric M.

2002-01-01

A capability to simulate trajectories Of Multiple interacting rigid bodies has been developed. This capability uses the Program to Optimize Simulated Trajectories II (POST II). Previously, POST II had the ability to simulate multiple bodies without interacting forces. The current implementation is used for the Simulation of parachute trajectories, in which the parachute and suspended bodies can be treated as rigid bodies. An arbitrary set of connecting lines can be included in the model and are treated as massless spring-dampers. This paper discusses details of the connection line modeling and results of several test cases used to validate the capability.

Outer-Planet Mission Analysis Using Solar-Electric Ion Propulsion

NASA Technical Reports Server (NTRS)

Woo, Byoungsam; Coverstone, Victoria L.; Hartmann, John W.; Cupples, Michael

2003-01-01

Outer-planet mission analysis was performed using three next generation solar-electric ion thruster models. Optimal trajectories are presented that maximize the delivered mass to the designated outer planet. Trajectories to Saturn and Neptune with a single Venus gravity assist are investigated. For each thruster model, the delivered mass versus flight time curve was generated to obtain thruster model performance. The effects of power to the thrusters and resonance ratio of Venutian orbital periods to spacecraft period were also studied. Multiple locally optimal trajectories to Saturn and Neptune have been discovered in different regions of the parameter search space. The characteristics of each trajectory are noted.

Parallelization of Program to Optimize Simulated Trajectories (POST3D)

NASA Technical Reports Server (NTRS)

Hammond, Dana P.; Korte, John J. (Technical Monitor)

2001-01-01

This paper describes the parallelization of the Program to Optimize Simulated Trajectories (POST3D). POST3D uses a gradient-based optimization algorithm that reaches an optimum design point by moving from one design point to the next. The gradient calculations required to complete the optimization process, dominate the computational time and have been parallelized using a Single Program Multiple Data (SPMD) on a distributed memory NUMA (non-uniform memory access) architecture. The Origin2000 was used for the tests presented.

A gradient system solution to Potts mean field equations and its electronic implementation.

PubMed

Urahama, K; Ueno, S

1993-03-01

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Nonparametric variational optimization of reaction coordinates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Banushkina, Polina V.; Krivov, Sergei V., E-mail: s.krivov@leeds.ac.uk

State of the art realistic simulations of complex atomic processes commonly produce trajectories of large size, making the development of automated analysis tools very important. A popular approach aimed at extracting dynamical information consists of projecting these trajectories into optimally selected reaction coordinates or collective variables. For equilibrium dynamics between any two boundary states, the committor function also known as the folding probability in protein folding studies is often considered as the optimal coordinate. To determine it, one selects a functional form with many parameters and trains it on the trajectories using various criteria. A major problem with such anmore » approach is that a poor initial choice of the functional form may lead to sub-optimal results. Here, we describe an approach which allows one to optimize the reaction coordinate without selecting its functional form and thus avoiding this source of error.« less

Sensory Agreement Guides Kinetic Energy Optimization of Arm Movements during Object Manipulation.

PubMed

Farshchiansadegh, Ali; Melendez-Calderon, Alejandro; Ranganathan, Rajiv; Murphey, Todd D; Mussa-Ivaldi, Ferdinando A

2016-04-01

The laws of physics establish the energetic efficiency of our movements. In some cases, like locomotion, the mechanics of the body dominate in determining the energetically optimal course of action. In other tasks, such as manipulation, energetic costs depend critically upon the variable properties of objects in the environment. Can the brain identify and follow energy-optimal motions when these motions require moving along unfamiliar trajectories? What feedback information is required for such optimal behavior to occur? To answer these questions, we asked participants to move their dominant hand between different positions while holding a virtual mechanical system with complex dynamics (a planar double pendulum). In this task, trajectories of minimum kinetic energy were along curvilinear paths. Our findings demonstrate that participants were capable of finding the energy-optimal paths, but only when provided with veridical visual and haptic information pertaining to the object, lacking which the trajectories were executed along rectilinear paths.

An Efficient Method of Sharing Mass Spatio-Temporal Trajectory Data Based on Cloudera Impala for Traffic Distribution Mapping in an Urban City

PubMed Central

Zhou, Lianjie; Chen, Nengcheng; Yuan, Sai; Chen, Zeqiang

2016-01-01

The efficient sharing of spatio-temporal trajectory data is important to understand traffic congestion in mass data. However, the data volumes of bus networks in urban cities are growing rapidly, reaching daily volumes of one hundred million datapoints. Accessing and retrieving mass spatio-temporal trajectory data in any field is hard and inefficient due to limited computational capabilities and incomplete data organization mechanisms. Therefore, we propose an optimized and efficient spatio-temporal trajectory data retrieval method based on the Cloudera Impala query engine, called ESTRI, to enhance the efficiency of mass data sharing. As an excellent query tool for mass data, Impala can be applied for mass spatio-temporal trajectory data sharing. In ESTRI we extend the spatio-temporal trajectory data retrieval function of Impala and design a suitable data partitioning method. In our experiments, the Taiyuan BeiDou (BD) bus network is selected, containing 2300 buses with BD positioning sensors, producing 20 million records every day, resulting in two difficulties as described in the Introduction section. In addition, ESTRI and MongoDB are applied in experiments. The experiments show that ESTRI achieves the most efficient data retrieval compared to retrieval using MongoDB for data volumes of fifty million, one hundred million, one hundred and fifty million, and two hundred million. The performance of ESTRI is approximately seven times higher than that of MongoDB. The experiments show that ESTRI is an effective method for retrieving mass spatio-temporal trajectory data. Finally, bus distribution mapping in Taiyuan city is achieved, describing the buses density in different regions at different times throughout the day, which can be applied in future studies of transport, such as traffic scheduling, traffic planning and traffic behavior management in intelligent public transportation systems. PMID:27801869

Low-energy Lunar Trajectories with Lunar Flybys

NASA Astrophysics Data System (ADS)

Wei, B. W.; Li, Y. S.

2017-09-01

The low-energy lunar trajectories with lunar flybys are investigated in the Sun-Earth-Moon bicircular problem (BCP). Accordingly, the characteristics of the distribution of trajectories in the phase space are summarized. To begin with, by using invariant manifolds of the BCP system, the low-energy lunar trajectories with lunar flybys are sought based on the BCP model. Secondly, through the treating time as an augmented dimension in the phase space of nonautonomous system, the state space map that reveals the distribution of these lunar trajectories in the phase space is given. As a result, it is become clear that low-energy lunar trajectories exist in families, and every moment of a Sun-Earth-Moon synodic period can be the departure date. Finally, the changing rule of departure impulse, midcourse impulse at Poincaré section, transfer duration, and system energy of different families are analyzed. Consequently, the impulse optimal family and transfer duration optimal family are obtained respectively.

A rapid method for optimization of the rocket propulsion system for single-stage-to-orbit vehicles

NASA Technical Reports Server (NTRS)

Eldred, C. H.; Gordon, S. V.

1976-01-01

A rapid analytical method for the optimization of rocket propulsion systems is presented for a vertical take-off, horizontal landing, single-stage-to-orbit launch vehicle. This method utilizes trade-offs between propulsion characteristics affecting flight performance and engine system mass. The performance results from a point-mass trajectory optimization program are combined with a linearized sizing program to establish vehicle sizing trends caused by propulsion system variations. The linearized sizing technique was developed for the class of vehicle systems studied herein. The specific examples treated are the optimization of nozzle expansion ratio and lift-off thrust-to-weight ratio to achieve either minimum gross mass or minimum dry mass. Assumed propulsion system characteristics are high chamber pressure, liquid oxygen and liquid hydrogen propellants, conventional bell nozzles, and the same fixed nozzle expansion ratio for all engines on a vehicle.

Interactive optimization approach for optimal impulsive rendezvous using primer vector and evolutionary algorithms

NASA Astrophysics Data System (ADS)

Luo, Ya-Zhong; Zhang, Jin; Li, Hai-yang; Tang, Guo-Jin

2010-08-01

In this paper, a new optimization approach combining primer vector theory and evolutionary algorithms for fuel-optimal non-linear impulsive rendezvous is proposed. The optimization approach is designed to seek the optimal number of impulses as well as the optimal impulse vectors. In this optimization approach, adding a midcourse impulse is determined by an interactive method, i.e. observing the primer-magnitude time history. An improved version of simulated annealing is employed to optimize the rendezvous trajectory with the fixed-number of impulses. This interactive approach is evaluated by three test cases: coplanar circle-to-circle rendezvous, same-circle rendezvous and non-coplanar rendezvous. The results show that the interactive approach is effective and efficient in fuel-optimal non-linear rendezvous design. It can guarantee solutions, which satisfy the Lawden's necessary optimality conditions.

Optimal control of parametric oscillations of compressed flexible bars

NASA Astrophysics Data System (ADS)

Alesova, I. M.; Babadzanjanz, L. K.; Pototskaya, I. Yu.; Pupysheva, Yu. Yu.; Saakyan, A. T.

2018-05-01

In this paper the problem of damping of the linear systems oscillations with piece-wise constant control is solved. The motion of bar construction is reduced to the form described by Hill's differential equation using the Bubnov-Galerkin method. To calculate switching moments of the one-side control the method of sequential linear programming is used. The elements of the fundamental matrix of the Hill's equation are approximated by trigonometric series. Examples of the optimal control of the systems for various initial conditions and different number of control stages have been calculated. The corresponding phase trajectories and transient processes are represented.

An Automated Solution of the Low-Thrust Interplanetary Trajectory Problem.

PubMed

Englander, Jacob A; Conway, Bruce A

2017-01-01

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, which 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 hybrid optimal control problem. The method is demonstrated on hypothetical missions to Mercury, the main asteroid belt, and Pluto.

An Automated Solution of the Low-Thrust Interplanetary Trajectory Problem

NASA Technical Reports Server (NTRS)

Englander, Jacob A.; Conway, Bruce

2016-01-01

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, which 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 hybrid optimal control problem. The method is demonstrated on hypothetical missions to Mercury, the main asteroid belt, and Pluto.

An Automated Solution of the Low-Thrust Interplanetary Trajectory Problem

PubMed Central

Englander, Jacob A.; Conway, Bruce A.

2017-01-01

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, which 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 hybrid optimal control problem. The method is demonstrated on hypothetical missions to Mercury, the main asteroid belt, and Pluto. PMID:29515289

Manipulator trajectories during orbital servicing mission: numerical simulations and experiments on microgravity simulator

NASA Astrophysics Data System (ADS)

Rybus, T.; Seweryn, K.

2018-06-01

It is considered to use a manipulator-equipped satellite for performing On-Orbit Servicing (OOS) or Active Debris Removal (ADR) missions. In this paper, several possible approaches are reviewed for end-effector (EE) trajectory planning in the Cartesian space, such as application of the Bézier curves for singularity avoidance and method for trajectory optimization. The results of numerical simulations for a satellite equipped with a 7 degree-of-freedom (DoF) manipulator and results of experiments performed on a planar air-bearing microgravity simulator for a simplified two-dimensional (2D) case with a 2-DoF manipulator are presented. Differences between the free-floating case and the case where Attitude and Orbit Control Systems (AOCS) keep constant position and orientation of the satellite are also shown.

Optimal and Autonomous Control Using Reinforcement Learning: A Survey.

PubMed

Kiumarsi, Bahare; Vamvoudakis, Kyriakos G; Modares, Hamidreza; Lewis, Frank L

2018-06-01

This paper reviews the current state of the art on reinforcement learning (RL)-based feedback control solutions to optimal regulation and tracking of single and multiagent systems. Existing RL solutions to both optimal and control problems, as well as graphical games, will be reviewed. RL methods learn the solution to optimal control and game problems online and using measured data along the system trajectories. We discuss Q-learning and the integral RL algorithm as core algorithms for discrete-time (DT) and continuous-time (CT) systems, respectively. Moreover, we discuss a new direction of off-policy RL for both CT and DT systems. Finally, we review several applications.

Locus of the apices of projectile trajectories under constant drag

NASA Astrophysics Data System (ADS)

Hernández-Saldaña, H.

2017-11-01

Using the hodograph method, we present an analytical solution for projectile coplanar motion under constant drag, parametrised by the velocity angle. We find the locus formed by the apices of the projectile trajectories, and discuss its implementation for the motion of a particle on an inclined plane in presence of Coulomb friction. The range and time of flight are obtained numerically, and we find that the optimal launching angle is smaller than in the drag-free case. This is a good example of a problem with constant dissipation of energy that includes curvature; it is appropriate for intermediate courses of mechanics.

Precision orbit raising trajectories. [solar electric propulsion orbital transfer program

NASA Technical Reports Server (NTRS)

Flanagan, P. F.; Horsewood, J. L.; Pines, S.

1975-01-01

A precision trajectory program has been developed to serve as a test bed for geocentric orbit raising steering laws. The steering laws to be evaluated have been developed using optimization methods employing averaging techniques. This program provides the capability of testing the steering laws in a precision simulation. The principal system models incorporated in the program are described, including the radiation environment, the solar array model, the thrusters and power processors, the geopotential, and the solar system. Steering and array orientation constraints are discussed, and the impact of these constraints on program design is considered.

Global Optimal Trajectory in Chaos and NP-Hardness

NASA Astrophysics Data System (ADS)

Latorre, Vittorio; Gao, David Yang

This paper presents an unconventional theory and method for solving general nonlinear dynamical systems. Instead of the direct iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. A newly developed canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by linear iterative methods are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems. The method and results presented in this paper should bring some new insights into nonlinear dynamical systems and NP-hardness in computational complexity theory.

Deep Brain Stimulation for Essential Tremor: Aligning Thalamic and Posterior Subthalamic Targets in 1 Surgical Trajectory.

PubMed

Bot, Maarten; van Rootselaar, Fleur; Contarino, Maria Fiorella; Odekerken, Vincent; Dijk, Joke; de Bie, Rob; Schuurman, Richard; van den Munckhof, Pepijn

2017-12-21

Ventral intermediate nucleus (VIM) deep brain stimulation (DBS) and posterior subthalamic area (PSA) DBS suppress tremor in essential tremor (ET) patients, but it is not clear which target is optimal. Aligning both targets in 1 surgical trajectory would facilitate exploring stimulation of either target in a single patient. To evaluate aligning VIM and PSA in 1 surgical trajectory for DBS in ET. Technical aspects of trajectories, intraoperative stimulation findings, final electrode placement, target used for chronic stimulation, and adverse and beneficial effects were evaluated. In 17 patients representing 33 trajectories, we successfully aligned VIM and PSA targets in 26 trajectories. Trajectory distance between targets averaged 7.2 (range 6-10) mm. In all but 4 aligned trajectories, optimal intraoperative tremor suppression was obtained in the PSA. During follow-up, active electrode contacts were located in PSA in the majority of cases. Overall, successful tremor control was achieved in 69% of patients. Stimulation-induced dysarthria or gait ataxia occurred in, respectively, 56% and 44% of patients. Neither difference in tremor suppression or side effects was noted between aligned and nonaligned leads nor between the different locations of chronic stimulation. Alignment of VIM and PSA for DBS in ET is feasible and enables intraoperative exploration of both targets in 1 trajectory. This facilitates positioning of electrode contacts in both areas, where multiple effective points of stimulation can be found. In the majority of aligned leads, optimal intraoperative and chronic stimulation were located in the PSA. Copyright © 2017 by the Congress of Neurological Surgeons

Dimensioning appropriate technical and economic parameters of elements in urban distribution power nets based on discrete fast marching method

NASA Astrophysics Data System (ADS)

Afanasyev, A. P.; Bazhenov, R. I.; Luchaninov, D. V.

2018-05-01

The main purpose of the research is to develop techniques for defining the best technical and economic trajectories of cables in urban power systems. The proposed algorithms of calculation of the routes for laying cables take into consideration topological, technical and economic features of the cabling. The discrete option of an algorithm Fast marching method is applied as a calculating tool. It has certain advantages compared to other approaches. In particular, this algorithm is cost-effective to compute, therefore, it is not iterative. Trajectories of received laying cables are considered as optimal ones from the point of view of technical and economic criteria. They correspond to the present rules of modern urban development.

Optimization of the launcher ascent trajectory leading to the global optimum without any initialization: the breakthrough of the Hamilton-Jacobi-Bellman approach

NASA Astrophysics Data System (ADS)

Bourgeois, E.; Bokanowski, O.; Zidani, H.; Désilles, A.

2018-06-01

The resolution of the launcher ascent trajectory problem by the so-called Hamilton-Jacobi-Bellman (HJB) approach, relying on the Dynamic Programming Principle, has been investigated. The method gives a global optimum and does not need any initialization procedure. Despite these advantages, this approach is seldom used because of the dicculties of computing the solution of the HJB equation for high dimension problems. The present study shows that an eccient resolution is found. An illustration of the method is proposed on a heavy class launcher, for a typical GEO (Geostationary Earth Orbit) mission. This study has been performed in the frame of the Centre National d'Etudes Spatiales (CNES) Launchers Research & Technology Program.

A Hidden Markov Model for Single Particle Tracks Quantifies Dynamic Interactions between LFA-1 and the Actin Cytoskeleton

PubMed Central

Das, Raibatak; Cairo, Christopher W.; Coombs, Daniel

2009-01-01

The extraction of hidden information from complex trajectories is a continuing problem in single-particle and single-molecule experiments. Particle trajectories are the result of multiple phenomena, and new methods for revealing changes in molecular processes are needed. We have developed a practical technique that is capable of identifying multiple states of diffusion within experimental trajectories. We model single particle tracks for a membrane-associated protein interacting with a homogeneously distributed binding partner and show that, with certain simplifying assumptions, particle trajectories can be regarded as the outcome of a two-state hidden Markov model. Using simulated trajectories, we demonstrate that this model can be used to identify the key biophysical parameters for such a system, namely the diffusion coefficients of the underlying states, and the rates of transition between them. We use a stochastic optimization scheme to compute maximum likelihood estimates of these parameters. We have applied this analysis to single-particle trajectories of the integrin receptor lymphocyte function-associated antigen-1 (LFA-1) on live T cells. Our analysis reveals that the diffusion of LFA-1 is indeed approximately two-state, and is characterized by large changes in cytoskeletal interactions upon cellular activation. PMID:19893741

Combining Simulation Tools for End-to-End Trajectory Optimization

NASA Technical Reports Server (NTRS)

Whitley, Ryan; Gutkowski, Jeffrey; Craig, Scott; Dawn, Tim; Williams, Jacobs; Stein, William B.; Litton, Daniel; Lugo, Rafael; Qu, Min

2015-01-01

Trajectory simulations with advanced optimization algorithms are invaluable tools in the process of designing spacecraft. Due to the need for complex models, simulations are often highly tailored to the needs of the particular program or mission. NASA's Orion and SLS programs are no exception. While independent analyses are valuable to assess individual spacecraft capabilities, a complete end-to-end trajectory from launch to splashdown maximizes potential performance and ensures a continuous solution. In order to obtain end-to-end capability, Orion's in-space tool (Copernicus) was made to interface directly with the SLS's ascent tool (POST2) and a new tool to optimize the full problem by operating both simulations simultaneously was born.

Constraint Force Equation Methodology for Modeling Multi-Body Stage Separation Dynamics

NASA Technical Reports Server (NTRS)

Toniolo, Matthew D.; Tartabini, Paul V.; Pamadi, Bandu N.; Hotchko, Nathaniel

2008-01-01

This paper discusses a generalized approach to the multi-body separation problems in a launch vehicle staging environment based on constraint force methodology and its implementation into the Program to Optimize Simulated Trajectories II (POST2), a widely used trajectory design and optimization tool. This development facilitates the inclusion of stage separation analysis into POST2 for seamless end-to-end simulations of launch vehicle trajectories, thus simplifying the overall implementation and providing a range of modeling and optimization capabilities that are standard features in POST2. Analysis and results are presented for two test cases that validate the constraint force equation methodology in a stand-alone mode and its implementation in POST2.

Conception et analyse d'un systeme d'optimisation de plans de vol pour les avions

NASA Astrophysics Data System (ADS)

Maazoun, Wissem

The main objective of this thesis is to develop an optimization method for the preparation of flight plans for aircrafts. The flight plan minimizes all costs associated with the flight. We determine an optimal path for an airplane from a departure airport to a destination airport. The optimal path minimizes the sum of all costs, i.e. the cost of fuel added to the cost of time (wages, rental of the aircraft, arrival delays, etc.). The optimal trajectory is obtained by considering all possible trajectories on a 3D graph (longitude, latitude and altitude) where the altitude levels are separated by 2,000 feet, and by applying a shortest path algorithm. The main task was to accurately compute fuel consumption on each edge of the graph, making sure that each arc has a minimal cost and is covered in a realistic way from the point of view of control, i.e. in accordance with the rules of navigation. To compute the cost of an arc, we take into account weather conditions (temperature, pressure, wind components, etc.). The optimization of each arc is done via the evaluation of an optimum speed that takes all costs into account. Each arc of the graph typically includes several sub-phases of the flight, e.g. altitude change, speed change, and constant speed and altitude. In the initial climb and the final descent phases, the costs are determined by considering altitude changes at constant CAS (Calibrated Air Speed) or constant Mach number. CAS and Mach number are adjusted to minimize cost. The aerodynamic model used is the one proposed by Eurocontrol, which uses the BADA (Base of Aircraft Data) tables. This model is based on the total energy equation that determines the instantaneous fuel consumption. Calculations on each arc are done by solving a system of differential equations that systematically takes all costs into account. To compute the cost of an arc, we must know the time to go through it, which is generally unknown. To have well-posed boundary conditions, we use the horizontal displacement as the independent variable of the system of differential equations. We consider the velocity components of the wind in a 3D system of coordinates to compute the instantaneous ground speed of the aircraft. To consider the cost of time, we use the cost index. The cost of an arc depends on the aircraft mass at the beginning of this arc, and this mass depends on the path. As we consider all possible paths, the cost of an arc must be computed for each trajectory to which it belongs. For a long-distance flight, the number of arcs to be considered in the graph is large and therefore the cost of an arc is typically computed many times. Our algorithm computes the costs of one million arcs in seconds while having a high accuracy. The determination of the optimal trajectory can therefore be done in a short time. To get the optimal path, the mass of the aircraft at the departure point must also be optimal. It is therefore necessary to know the optimal amount of fuel for the journey. The aircraft mass is known only at the arrival point. This mass is the mass of the aircraft including passengers, cargo and reserve fuel mass. The optimal path is determined by calculating backwards, i.e. from the arrival point to the departure point. For the determination of the optimal trajectory, we use an elliptical grid that has focal points at the departure and arrival points. The use of this grid is essential for the construction of a direct and acyclic graph. We use the Bellman-Ford algorithm on a DAG to determine the shortest path. This algorithm is easy to implement and results in short computation times. Our algorithm computes an optimal trajectory with an optimal cost for each arc. Altitude changes are done optimally with respect to the mass of the aircraft and the cost of time. Our algorithm gives the mass, speed, altitude and total cost at any point of the trajectory as well as the optimal profiles of climb and descent. A prototype has been implemented in C. We made simulations of all types of possible arcs and of several complete trajectories to illustrate the behaviour of the algorithm.

Automatic Multiple-Needle Surgical Planning of Robotic-Assisted Microwave Coagulation in Large Liver Tumor Therapy

PubMed Central

Liu, Shaoli; Xia, Zeyang; Liu, Jianhua; Xu, Jing; Ren, He; Lu, Tong; Yang, Xiangdong

2016-01-01

The “robotic-assisted liver tumor coagulation therapy” (RALTCT) system is a promising candidate for large liver tumor treatment in terms of accuracy and speed. A prerequisite for effective therapy is accurate surgical planning. However, it is difficult for the surgeon to perform surgical planning manually due to the difficulties associated with robot-assisted large liver tumor therapy. These main difficulties include the following aspects: (1) multiple needles are needed to destroy the entire tumor, (2) the insertion trajectories of the needles should avoid the ribs, blood vessels, and other tissues and organs in the abdominal cavity, (3) the placement of multiple needles should avoid interference with each other, (4) an inserted needle will cause some deformation of liver, which will result in changes in subsequently inserted needles’ operating environment, and (5) the multiple needle-insertion trajectories should be consistent with the needle-driven robot’s movement characteristics. Thus, an effective multiple-needle surgical planning procedure is needed. To overcome these problems, we present an automatic multiple-needle surgical planning of optimal insertion trajectories to the targets, based on a mathematical description of all relevant structure surfaces. The method determines the analytical expression of boundaries of every needle “collision-free reachable workspace” (CFRW), which are the feasible insertion zones based on several constraints. Then, the optimal needle insertion trajectory within the optimization criteria will be chosen in the needle CFRW automatically. Also, the results can be visualized with our navigation system. In the simulation experiment, three needle-insertion trajectories were obtained successfully. In the in vitro experiment, the robot successfully achieved insertion of multiple needles. The proposed automatic multiple-needle surgical planning can improve the efficiency and safety of robot-assisted large liver tumor therapy, significantly reduce the surgeon’s workload, and is especially helpful for an inexperienced surgeon. The methodology should be easy to adapt in other body parts. PMID:26982341

Minimum Hamiltonian Ascent Trajectory Evaluation (MASTRE) program (update to automatic flight trajectory design, performance prediction, and vehicle sizing for support of Shuttle and Shuttle derived vehicles) engineering manual

NASA Technical Reports Server (NTRS)

Lyons, J. T.

1993-01-01

The Minimum Hamiltonian Ascent Trajectory Evaluation (MASTRE) program and its predecessors, the ROBOT and the RAGMOP programs, have had a long history of supporting MSFC in the simulation of space boosters for the purpose of performance evaluation. The ROBOT program was used in the simulation of the Saturn 1B and Saturn 5 vehicles in the 1960's and provided the first utilization of the minimum Hamiltonian (or min-H) methodology and the steepest ascent technique to solve the optimum trajectory problem. The advent of the Space Shuttle in the 1970's and its complex airplane design required a redesign of the trajectory simulation code since aerodynamic flight and controllability were required for proper simulation. The RAGMOP program was the first attempt to incorporate the complex equations of the Space Shuttle into an optimization tool by using an optimization method based on steepest ascent techniques (but without the min-H methodology). Development of the complex partial derivatives associated with the Space Shuttle configuration and using techniques from the RAGMOP program, the ROBOT program was redesigned to incorporate these additional complexities. This redesign created the MASTRE program, which was referred to as the Minimum Hamiltonian Ascent Shuttle TRajectory Evaluation program at that time. Unique to this program were first-stage (or booster) nonlinear aerodynamics, upper-stage linear aerodynamics, engine control via moment balance, liquid and solid thrust forces, variable liquid throttling to maintain constant acceleration limits, and a total upgrade of the equations used in the forward and backward integration segments of the program. This modification of the MASTRE code has been used to simulate the new space vehicles associated with the National Launch Systems (NLS). Although not as complicated as the Space Shuttle, the simulation and analysis of the NLS vehicles required additional modifications to the MASTRE program in the areas of providing additional flexibility in the use of the program, allowing additional optimization options, and providing special options for the NLS configuration.

Fuel-optimal low-thrust formation reconfiguration via Radau pseudospectral method

NASA Astrophysics Data System (ADS)

Li, Jing

2016-07-01

This paper investigates fuel-optimal low-thrust formation reconfiguration near circular orbit. Based on the Clohessy-Wiltshire equations, first-order necessary optimality conditions are derived from the Pontryagin's maximum principle. The fuel-optimal impulsive solution is utilized to divide the low-thrust trajectory into thrust and coast arcs. By introducing the switching times as optimization variables, the fuel-optimal low-thrust formation reconfiguration is posed as a nonlinear programming problem (NLP) via direct transcription using multiple-phase Radau pseudospectral method (RPM), which is then solved by a sparse nonlinear optimization software SNOPT. To facilitate optimality verification and, if necessary, further refinement of the optimized solution of the NLP, formulas for mass costate estimation and initial costates scaling are presented. Numerical examples are given to show the application of the proposed optimization method. To fix the problem, generic fuel-optimal low-thrust formation reconfiguration can be simplified as reconfiguration without any initial and terminal coast arcs, whose optimal solutions can be efficiently obtained from the multiple-phase RPM at the cost of a slight fuel increment. Finally, influence of the specific impulse and maximum thrust magnitude on the fuel-optimal low-thrust formation reconfiguration is analyzed. Numerical results shown the links and differences between the fuel-optimal impulsive and low-thrust solutions.

From Basking Ridge to the Jupiter Trojans

NASA Technical Reports Server (NTRS)

Englander, Jacob

2017-01-01

This presentation describes the activities of the Global Trajectory Optimization Lab, a subdivision of the Navigation and Mission Design Branch at NASA GSFC. The students will learn the basics of interplanetary trajectory optimization and then, as an example, the Lucy mission to the Jupiter Trojans will be described from both a science and engineering perspective.

Optimal subhourly electricity resource dispatch under multiple price signals with high renewable generation availability

DOE PAGES

Chassin, David P.; Behboodi, Sahand; Djilali, Ned

2018-01-28

This article proposes a system-wide optimal resource dispatch strategy that enables a shift from a primarily energy cost-based approach, to a strategy using simultaneous price signals for energy, power and ramping behavior. A formal method to compute the optimal sub-hourly power trajectory is derived for a system when the price of energy and ramping are both significant. Optimal control functions are obtained in both time and frequency domains, and a discrete-time solution suitable for periodic feedback control systems is presented. The method is applied to North America Western Interconnection for the planning year 2024, and it is shown that anmore » optimal dispatch strategy that simultaneously considers both the cost of energy and the cost of ramping leads to significant cost savings in systems with high levels of renewable generation: the savings exceed 25% of the total system operating cost for a 50% renewables scenario.« less

Optimal subhourly electricity resource dispatch under multiple price signals with high renewable generation availability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chassin, David P.; Behboodi, Sahand; Djilali, Ned

This article proposes a system-wide optimal resource dispatch strategy that enables a shift from a primarily energy cost-based approach, to a strategy using simultaneous price signals for energy, power and ramping behavior. A formal method to compute the optimal sub-hourly power trajectory is derived for a system when the price of energy and ramping are both significant. Optimal control functions are obtained in both time and frequency domains, and a discrete-time solution suitable for periodic feedback control systems is presented. The method is applied to North America Western Interconnection for the planning year 2024, and it is shown that anmore » optimal dispatch strategy that simultaneously considers both the cost of energy and the cost of ramping leads to significant cost savings in systems with high levels of renewable generation: the savings exceed 25% of the total system operating cost for a 50% renewables scenario.« less

An Optimized Control for LLC Resonant Converter with Wide Load Range

NASA Astrophysics Data System (ADS)

Xi, Xia; Qian, Qinsong

2017-05-01

This paper presents an optimized control which makes LLC resonant converters operate with a wider load range and provides good closed-loop performance. The proposed control employs two paralleled digital compensations to guarantee the good closed-loop performance in a wide load range during the steady state, an optimized trajectory control will take over to change the gate-driving signals immediately at the load transients. Finally, the proposed control has been implemented and tested on a 150W 200kHz 400V/24V LLC resonant converter and the result validates the proposed method.

Estimation of the Maximum Theoretical Productivity of Fed-Batch Bioreactors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bomble, Yannick J; St. John, Peter C; Crowley, Michael F

2017-10-18

A key step towards the development of an integrated biorefinery is the screening of economically viable processes, which depends sharply on the yields and productivities that can be achieved by an engineered microorganism. In this study, we extend an earlier method which used dynamic optimization to find the maximum theoretical productivity of batch cultures to explicitly include fed-batch bioreactors. In addition to optimizing the intracellular distribution of metabolites between cell growth and product formation, we calculate the optimal control trajectory of feed rate versus time. We further analyze how sensitive the productivity is to substrate uptake and growth parameters.

Trajectory Approaches for Launching Hypersonic Flight Tests (Preprint)

DTIC Science & Technology

2014-08-01

This paper presents some approaches toward designing trajectories for hypersonic testing at up to Mach 10 speed using a reusable rocket -powered first...Program to Optimize Simulated Trajectories (POST) code to look at different ways of flying to Mach 10 with a reusable first stage rocket . These trajectories...are good starting points for how to setup a trajectory simulation to meet hypersonic testing needs. 15. SUBJECT TERMS responsive and reusable rocket

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

NASA Technical Reports Server (NTRS)

Vavrina, Matthew A.; Englander, Jacob A.; Ellison, Donald H.

2016-01-01

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.

Optimum Design of Hypersonic Airbreathing Propulsion

NASA Astrophysics Data System (ADS)

Kobayashi, Hiroaki; Sato, Tetsuya; Tanatsugu, Nobuhiro

The flight of Spaceplane is always under accelarating in the assent way and always under decelarating in the desent way and yet cruising in the return way. Besides, its flight envelope is considerably wider than that of airplane. Thus the integrated design method is required to build the best transportation system optimized taking into account the propulsion system and the airframe under the entire flight conditions. In this paper it is shown an optimization method on TSTO spaceplane system. Genetic algorithm (GA) was applied to optimize design parameters of engine, airframe, and trajectory simultaneously. Several types of engine were quantitatively compared using payload ratio as an evaluating function. It was concluded that precooled turbojets is the most promising engine for TSTO among Turbine Based Combined Cycle (TBCC) engines.

Optimal trajectories for aeroassisted orbital transfer

NASA Technical Reports Server (NTRS)

Miele, A.; Venkataraman, P.

1983-01-01

Consideration is given to classical and minimax problems involved in aeroassisted transfer from high earth orbit (HEO) to low earth orbit (LEO). The transfer is restricted to coplanar operation, with trajectory control effected by means of lift modulation. The performance of the maneuver is indexed to the energy expenditure or, alternatively, the time integral of the heating rate. Firist-order optimality conditions are defined for the classical approach, as are a sequential gradient-restoration algorithm and a combined gradient-restoration algorithm. Minimization techniques are presented for the aeroassisted transfer energy consumption and time-delay integral of the heating rate, as well as minimization of the pressure. It is shown that the eigenvalues of the Jacobian matrix of the differential system is both stiff and unstable, implying that the sequential gradient restoration algorithm in its present version is unsuitable. A new method, involving a multipoint approach to the two-poing boundary value problem, is recommended.

Optimization of a sensor cluster for determination of trajectories and velocities of supersonic objects

NASA Astrophysics Data System (ADS)

Cannella, Marco; Sciuto, Salvatore Andrea

2001-04-01

An evaluation of errors for a method for determination of trajectories and velocities of supersonic objects is conducted. The analytical study of a cluster, composed of three pressure transducers and generally used as an apparatus for cinematic determination of parameters of supersonic objects, is developed. Furthermore, detailed investigation into the accuracy of this cluster on determination of the slope of an incoming shock wave is carried out for optimization of the device. In particular, a specific non-dimensional parameter is proposed in order to evaluate accuracies for various values of parameters and reference graphs are provided in order to properly design the sensor cluster. Finally, on the basis of the error analysis conducted, a discussion on the best estimation of the relative distance for the sensor as a function of temporal resolution of the measuring system is presented.

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum

PubMed Central

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents’ positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness. PMID:27399904

MGA trajectory planning with an ACO-inspired algorithm

NASA Astrophysics Data System (ADS)

Ceriotti, Matteo; Vasile, Massimiliano

2010-11-01

Given a set of celestial bodies, the problem of finding an optimal sequence of swing-bys, deep space manoeuvres (DSM) and transfer arcs connecting the elements of the set is combinatorial in nature. The number of possible paths grows exponentially with the number of celestial bodies. Therefore, the design of an optimal multiple gravity assist (MGA) trajectory is a NP-hard mixed combinatorial-continuous problem. Its automated solution would greatly improve the design of future space missions, allowing the assessment of a large number of alternative mission options in a short time. This work proposes to formulate the complete automated design of a multiple gravity assist trajectory as an autonomous planning and scheduling problem. The resulting scheduled plan will provide the optimal planetary sequence and a good estimation of the set of associated optimal trajectories. The trajectory model consists of a sequence of celestial bodies connected by two-dimensional transfer arcs containing one DSM. For each transfer arc, the position of the planet and the spacecraft, at the time of arrival, are matched by varying the pericentre of the preceding swing-by, or the magnitude of the launch excess velocity, for the first arc. For each departure date, this model generates a full tree of possible transfers from the departure to the destination planet. Each leaf of the tree represents a planetary encounter and a possible way to reach that planet. An algorithm inspired by ant colony optimization (ACO) is devised to explore the space of possible plans. The ants explore the tree from departure to destination adding one node at the time: every time an ant is at a node, a probability function is used to select a feasible direction. This approach to automatic trajectory planning is applied to the design of optimal transfers to Saturn and among the Galilean moons of Jupiter. Solutions are compared to those found through more traditional genetic-algorithm techniques.

Rapid Onboard Trajectory Design for Autonomous Spacecraft in Multibody Systems

NASA Astrophysics Data System (ADS)

Trumbauer, Eric Michael

This research develops automated, on-board trajectory planning algorithms in order to support current and new mission concepts. These include orbiter missions to Phobos or Deimos, Outer Planet Moon orbiters, and robotic and crewed missions to small bodies. The challenges stem from the limited on-board computing resources which restrict full trajectory optimization with guaranteed convergence in complex dynamical environments. The approach taken consists of leveraging pre-mission computations to create a large database of pre-computed orbits and arcs. Such a database is used to generate a discrete representation of the dynamics in the form of a directed graph, which acts to index these arcs. This allows the use of graph search algorithms on-board in order to provide good approximate solutions to the path planning problem. Coupled with robust differential correction and optimization techniques, this enables the determination of an efficient path between any boundary conditions with very little time and computing effort. Furthermore, the optimization methods developed here based on sequential convex programming are shown to have provable convergence properties, as well as generating feasible major iterates in case of a system interrupt -- a key requirement for on-board application. The outcome of this project is thus the development of an algorithmic framework which allows the deployment of this approach in a variety of specific mission contexts. Test cases related to missions of interest to NASA and JPL such as a Phobos orbiter and a Near Earth Asteroid interceptor are demonstrated, including the results of an implementation on the RAD750 flight processor. This method fills a gap in the toolbox being developed to create fully autonomous space exploration systems.

Optimal trajectories for hypersonic launch vehicles

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Bowles, Jeffrey V.; Whittaker, Thomas

1992-01-01

In this paper, we derive a near-optimal guidance law for the ascent trajectory from Earth surface to Earth orbit of a hypersonic, dual-mode propulsion, lifting vehicle. Of interest are both the optimal flight path and the optimal operation of the propulsion system. The guidance law is developed from the energy-state approximation of the equations of motion. The performance objective is a weighted sum of fuel mass and volume, with the weighting factor selected to give minimum gross take-off weight for a specific payload mass and volume.

Analysis of Chemical, REP, and SEP missions to the Trojan asteroids

NASA Technical Reports Server (NTRS)

Bonfiglio, Eugene P.; Oh, David; Yen, Chen-Wan

2005-01-01

Recent studies suggest significant benefits from using 1st and 2nd generation Radioisotope Power Systems (RPS) as a power source for electric propulsion (EP) missions to the outer planets. This study focuses on trajectories to the Trojan asteroids. A high level analysis is performed with chemical trajectories to determine potential canidates for REP trajectory optimization. Extensive analysis of direct trajectories using REP is performed on these candidates. Solar Electric Propulsion (SEP) trajectories are also considered for comparison against REP trajectories.

Primer vector theory and applications

NASA Technical Reports Server (NTRS)

Jezewski, D. J.

1975-01-01

A method developed to compute two-body, optimal, N-impulse trajectories was presented. The necessary conditions established define the gradient structure of the primer vector and its derivative for any set of boundary conditions and any number of impulses. Inequality constraints, a conjugate gradient iterator technique, and the use of a penalty function were also discussed.

Fully Anisotropic Rotational Diffusion Tensor from Molecular Dynamics Simulations.

PubMed

Linke, Max; Köfinger, Jürgen; Hummer, Gerhard

2018-05-31

We present a method to calculate the fully anisotropic rotational diffusion tensor from molecular dynamics simulations. Our approach is based on fitting the time-dependent covariance matrix of the quaternions that describe the rigid-body rotational dynamics. Explicit analytical expressions have been derived for the covariances by Favro, which are valid irrespective of the degree of anisotropy. We use these expressions to determine an optimal rotational diffusion tensor from trajectory data. The molecular structures are aligned against a reference by optimal rigid-body superposition. The quaternion covariances can then be obtained directly from the rotation matrices used in the alignment. The rotational diffusion tensor is determined by a fit to the time-dependent quaternion covariances, or directly by Laplace transformation and matrix diagonalization. To quantify uncertainties in the fit, we derive analytical expressions and compare them with the results of Brownian dynamics simulations of anisotropic rotational diffusion. We apply the method to microsecond long trajectories of the Dickerson-Drew B-DNA dodecamer and of horse heart myoglobin. The anisotropic rotational diffusion tensors calculated from simulations agree well with predictions from hydrodynamics.

Advanced Structural Optimization Under Consideration of Cost Tracking

NASA Astrophysics Data System (ADS)

Zell, D.; Link, T.; Bickelmaier, S.; Albinger, J.; Weikert, S.; Cremaschi, F.; Wiegand, A.

2014-06-01

In order to improve the design process of launcher configurations in the early development phase, the software Multidisciplinary Optimization (MDO) was developed. The tool combines different efficient software tools such as Optimal Design Investigations (ODIN) for structural optimizations, Aerospace Trajectory Optimization Software (ASTOS) for trajectory and vehicle design optimization for a defined payload and mission.The present paper focuses to the integration and validation of ODIN. ODIN enables the user to optimize typical axis-symmetric structures by means of sizing the stiffening designs concerning strength and stability while minimizing the structural mass. In addition a fully automatic finite element model (FEM) generator module creates ready-to-run FEM models of a complete stage or launcher assembly.Cost tracking respectively future improvements concerning cost optimization are indicated.

Real-time optimal guidance for orbital maneuvering.

NASA Technical Reports Server (NTRS)

Cohen, A. O.; Brown, K. R.

1973-01-01

A new formulation for soft-constraint trajectory optimization is presented as a real-time optimal feedback guidance method for multiburn orbital maneuvers. Control is always chosen to minimize burn time plus a quadratic penalty for end condition errors, weighted so that early in the mission (when controllability is greatest) terminal errors are held negligible. Eventually, as controllability diminishes, the method partially relaxes but effectively still compensates perturbations in whatever subspace remains controllable. Although the soft-constraint concept is well-known in optimal control, the present formulation is novel in addressing the loss of controllability inherent in multiple burn orbital maneuvers. Moreover the necessary conditions usually obtained from a Bolza formulation are modified in this case so that the fully hard constraint formulation is a numerically well behaved subcase. As a result convergence properties have been greatly improved.

Power-limited low-thrust trajectory optimization with operation point detection

NASA Astrophysics Data System (ADS)

Chi, Zhemin; Li, Haiyang; Jiang, Fanghua; Li, Junfeng

2018-06-01

The power-limited solar electric propulsion system is considered more practical in mission design. An accurate mathematical model of the propulsion system, based on experimental data of the power generation system, is used in this paper. An indirect method is used to deal with the time-optimal and fuel-optimal control problems, in which the solar electric propulsion system is described using a finite number of operation points, which are characterized by different pairs of thruster input power. In order to guarantee the integral accuracy for the discrete power-limited problem, a power operation detection technique is embedded in the fourth-order Runge-Kutta algorithm with fixed step. Moreover, the logarithmic homotopy method and normalization technique are employed to overcome the difficulties caused by using indirect methods. Three numerical simulations with actual propulsion systems are given to substantiate the feasibility and efficiency of the proposed method.

Design space pruning heuristics and global optimization method for conceptual design of low-thrust asteroid tour missions

NASA Astrophysics Data System (ADS)

Alemany, Kristina

Electric propulsion has recently become a viable technology for spacecraft, enabling shorter flight times, fewer required planetary gravity assists, larger payloads, and/or smaller launch vehicles. With the maturation of this technology, however, comes a new set of challenges in the area of trajectory design. Because low-thrust trajectory optimization has historically required long run-times and significant user-manipulation, mission design has relied on expert-based knowledge for selecting departure and arrival dates, times of flight, and/or target bodies and gravitational swing-bys. These choices are generally based on known configurations that have worked well in previous analyses or simply on trial and error. At the conceptual design level, however, the ability to explore the full extent of the design space is imperative to locating the best solutions in terms of mass and/or flight times. Beginning in 2005, the Global Trajectory Optimization Competition posed a series of difficult mission design problems, all requiring low-thrust propulsion and visiting one or more asteroids. These problems all had large ranges on the continuous variables---launch date, time of flight, and asteroid stay times (when applicable)---as well as being characterized by millions or even billions of possible asteroid sequences. Even with recent advances in low-thrust trajectory optimization, full enumeration of these problems was not possible within the stringent time limits of the competition. This investigation develops a systematic methodology for determining a broad suite of good solutions to the combinatorial, low-thrust, asteroid tour problem. The target application is for conceptual design, where broad exploration of the design space is critical, with the goal being to rapidly identify a reasonable number of promising solutions for future analysis. The proposed methodology has two steps. The first step applies a three-level heuristic sequence developed from the physics of the problem, which allows for efficient pruning of the design space. The second phase applies a global optimization scheme to locate a broad suite of good solutions to the reduced problem. The global optimization scheme developed combines a novel branch-and-bound algorithm with a genetic algorithm and an industry-standard low-thrust trajectory optimization program to solve for the following design variables: asteroid sequence, launch date, times of flight, and asteroid stay times. The methodology is developed based on a small sample problem, which is enumerated and solved so that all possible discretized solutions are known. The methodology is then validated by applying it to a larger intermediate sample problem, which also has a known solution. Next, the methodology is applied to several larger combinatorial asteroid rendezvous problems, using previously identified good solutions as validation benchmarks. These problems include the 2nd and 3rd Global Trajectory Optimization Competition problems. The methodology is shown to be capable of achieving a reduction in the number of asteroid sequences of 6-7 orders of magnitude, in terms of the number of sequences that require low-thrust optimization as compared to the number of sequences in the original problem. More than 70% of the previously known good solutions are identified, along with several new solutions that were not previously reported by any of the competitors. Overall, the methodology developed in this investigation provides an organized search technique for the low-thrust mission design of asteroid rendezvous problems.

Finite element method for optimal guidance of an advanced launch vehicle

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.; Bless, Robert R.; Calise, Anthony J.; Leung, Martin

1992-01-01

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.

Potential for Integrating Entry Guidance into the Multi-Disciplinary Entry Vehicle Optimization Environment

NASA Technical Reports Server (NTRS)

D'souza, Sarah N.; Kinney, David J.; Garcia, Joseph A.; Sarigul-Klijn, Nesrin

2014-01-01

The state-of-the-art in vehicle design decouples flight feasible trajectory generation from the optimization process of an entry spacecraft shape. The disadvantage to this decoupled process is seen when a particular aeroshell does not meet in-flight requirements when integrated into Guidance, Navigation, and Control simulations. It is postulated that the integration of a guidance algorithm into the design process will provide a real-time, rapid trajectory generation technique to enhance the robustness of vehicle design solutions. The potential benefit of this integration is a reduction in design cycles (possible cost savings) and increased accuracy in the aerothermal environment (possible mass savings). This work examines two aspects: 1) the performance of a reference tracking guidance algorithm for five different geometries with the same reference trajectory and 2) the potential of mass savings from improved aerothermal predictions. An Apollo Derived Guidance (ADG) algorithm is used in this study. The baseline geometry and five test case geometries were flown using the same baseline trajectory. The guided trajectory results are compared to separate trajectories determined in a vehicle optimization study conducted for NASA's Mars Entry, Descent, and Landing System Analysis. This study revealed several aspects regarding the potential gains and required developments for integrating a guidance algorithm into the vehicle optimization environment. First, the generation of flight feasible trajectories is only as good as the robustness of the guidance algorithm. The set of dispersed geometries modelled aerodynamic dispersions that ranged from +/-1% to +/-17% and a single extreme case was modelled where the aerodynamics were approximately 80% less than the baseline geometry. The ADG, as expected, was able to guide the vehicle into the aeroshell separation box at the target location for dispersions up to 17%, but failed for the 80% dispersion cases. Finally, the results revealed that including flight feasible trajectories for a set of dispersed geometries has the potential to save mass up to 430 kg.

Development of Complexity Science and Technology Tools for NextGen Airspace Research and Applications

NASA Technical Reports Server (NTRS)

Holmes, Bruce J.; Sawhill, Bruce K.; Herriot, James; Seehart, Ken; Zellweger, Dres; Shay, Rick

2012-01-01

The objective of this research by NextGen AeroSciences, LLC is twofold: 1) to deliver an initial "toolbox" of algorithms, agent-based structures, and method descriptions for introducing trajectory agency as a methodology for simulating and analyzing airspace states, including bulk properties of large numbers of heterogeneous 4D aircraft trajectories in a test airspace -- while maintaining or increasing system safety; and 2) to use these tools in a test airspace to identify possible phase transition structure to predict when an airspace will approach the limits of its capacity. These 4D trajectories continuously replan their paths in the presence of noise and uncertainty while optimizing performance measures and performing conflict detection and resolution. In this approach, trajectories are represented as extended objects endowed with pseudopotential, maintaining time and fuel-efficient paths by bending just enough to accommodate separation while remaining inside of performance envelopes. This trajectory-centric approach differs from previous aircraft-centric distributed approaches to deconfliction. The results of this project are the following: 1) we delivered a toolbox of algorithms, agent-based structures and method descriptions as pseudocode; and 2) we corroborated the existence of phase transition structure in simulation with the addition of "early warning" detected prior to "full" airspace. This research suggests that airspace "fullness" can be anticipated and remedied before the airspace becomes unsafe.

Robust Feedback Control of Reconfigurable Multi-Agent Systems in Uncertain Adversarial Environments

DTIC Science & Technology

2015-07-09

R. G., Optimal Lunar Landing and Retargeting using a Hybrid Control Strategy. Proceedings of the 2013 AAS/AIAA Space Flight Mechanics Meeting (AAS...Furfaro, R. & Sanfelice, R. G., Switching System Model for Pinpoint Lunar Landing Guidance Using a Hybrid Control Strategy. Proceedings of the AIAA...methods in distributed settings and the design of numerical methods to properly compute their trajectories . We have generate results showing that

High-Order Model and Dynamic Filtering for Frame Rate Up-Conversion.

PubMed

Bao, Wenbo; Zhang, Xiaoyun; Chen, Li; Ding, Lianghui; Gao, Zhiyong

2018-08-01

This paper proposes a novel frame rate up-conversion method through high-order model and dynamic filtering (HOMDF) for video pixels. Unlike the constant brightness and linear motion assumptions in traditional methods, the intensity and position of the video pixels are both modeled with high-order polynomials in terms of time. Then, the key problem of our method is to estimate the polynomial coefficients that represent the pixel's intensity variation, velocity, and acceleration. We propose to solve it with two energy objectives: one minimizes the auto-regressive prediction error of intensity variation by its past samples, and the other minimizes video frame's reconstruction error along the motion trajectory. To efficiently address the optimization problem for these coefficients, we propose the dynamic filtering solution inspired by video's temporal coherence. The optimal estimation of these coefficients is reformulated into a dynamic fusion of the prior estimate from pixel's temporal predecessor and the maximum likelihood estimate from current new observation. Finally, frame rate up-conversion is implemented using motion-compensated interpolation by pixel-wise intensity variation and motion trajectory. Benefited from the advanced model and dynamic filtering, the interpolated frame has much better visual quality. Extensive experiments on the natural and synthesized videos demonstrate the superiority of HOMDF over the state-of-the-art methods in both subjective and objective comparisons.

MADS Users' Guide

NASA Technical Reports Server (NTRS)

Moerder, Daniel D.

2014-01-01

MADS (Minimization Assistant for Dynamical Systems) is a trajectory optimization code in which a user-specified performance measure is directly minimized, subject to constraints placed on a low-order discretization of user-supplied plant ordinary differential equations. This document describes the mathematical formulation of the set of trajectory optimization problems for which MADS is suitable, and describes the user interface. Usage examples are provided.

Two-phase framework for near-optimal multi-target Lambert rendezvous

NASA Astrophysics Data System (ADS)

Bang, Jun; Ahn, Jaemyung

2018-03-01

This paper proposes a two-phase framework to obtain a near-optimal solution of multi-target Lambert rendezvous problem. The objective of the problem is to determine the minimum-cost rendezvous sequence and trajectories to visit a given set of targets within a maximum mission duration. The first phase solves a series of single-target rendezvous problems for all departure-arrival object pairs to generate the elementary solutions, which provides candidate rendezvous trajectories. The second phase formulates a variant of traveling salesman problem (TSP) using the elementary solutions prepared in the first phase and determines the final rendezvous sequence and trajectories of the multi-target rendezvous problem. The validity of the proposed optimization framework is demonstrated through an asteroid exploration case study.

Optimizing interplanetary trajectories with deep space maneuvers. M.S. Thesis

NASA Technical Reports Server (NTRS)

Navagh, John

1993-01-01

Analysis of interplanetary trajectories is a crucial area for both manned and unmanned missions of the Space Exploration Initiative. A deep space maneuver (DSM) can improve a trajectory in much the same way as a planetary swingby. However, instead of using a gravitational field to alter the trajectory, the on-board propulsion system of the spacecraft is used when the vehicle is not near a planet. The purpose is to develop an algorithm to determine where and when to use deep space maneuvers to reduce the cost of a trajectory. The approach taken to solve this problem uses primer vector theory in combination with a non-linear optimizing program to minimize Delta(V). A set of necessary conditions on the primer vector is shown to indicate whether a deep space maneuver will be beneficial. Deep space maneuvers are applied to a round trip mission to Mars to determine their effect on the launch opportunities. Other studies which were performed include cycler trajectories and Mars mission abort scenarios. It was found that the software developed was able to locate quickly DSM's which lower the total Delta(V) on these trajectories.

Optimizing interplanetary trajectories with deep space maneuvers

NASA Astrophysics Data System (ADS)

Navagh, John

1993-09-01

Analysis of interplanetary trajectories is a crucial area for both manned and unmanned missions of the Space Exploration Initiative. A deep space maneuver (DSM) can improve a trajectory in much the same way as a planetary swingby. However, instead of using a gravitational field to alter the trajectory, the on-board propulsion system of the spacecraft is used when the vehicle is not near a planet. The purpose is to develop an algorithm to determine where and when to use deep space maneuvers to reduce the cost of a trajectory. The approach taken to solve this problem uses primer vector theory in combination with a non-linear optimizing program to minimize Delta(V). A set of necessary conditions on the primer vector is shown to indicate whether a deep space maneuver will be beneficial. Deep space maneuvers are applied to a round trip mission to Mars to determine their effect on the launch opportunities. Other studies which were performed include cycler trajectories and Mars mission abort scenarios. It was found that the software developed was able to locate quickly DSM's which lower the total Delta(V) on these trajectories.

Direct Multiple Shooting Optimization with Variable Problem Parameters

NASA Technical Reports Server (NTRS)

Whitley, Ryan J.; Ocampo, Cesar A.

2009-01-01

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.

Optimization of dynamic soaring maneuvers to enhance endurance of a versatile UAV

NASA Astrophysics Data System (ADS)

Mir, Imran; Maqsood, Adnan; Akhtar, Suhail

2017-06-01

Dynamic soaring is a process of acquiring energy available in atmospheric wind shears and is commonly exhibited by soaring birds to perform long distance flights. This paper aims to demonstrate a viable algorithm which can be implemented in near real time environment to formulate optimal trajectories for dynamic soaring maneuvers for a small scale Unmanned Aerial Vehicle (UAV). The objective is to harness maximum energy from atmosphere wind shear to improve loiter time for Intelligence, Surveillance and Reconnaissance (ISR) missions. Three-dimensional point-mass UAV equations of motion and linear wind gradient profile are used to model flight dynamics. Utilizing UAV states, controls, operational constraints, initial and terminal conditions that enforce a periodic flight, dynamic soaring problem is formulated as an optimal control problem. Optimized trajectories of the maneuver are subsequently generated employing pseudo spectral techniques against distant UAV performance parameters. The discussion also encompasses the requirement for generation of optimal trajectories for dynamic soaring in real time environment and the ability of the proposed algorithm for speedy solution generation. Coupled with the fact that dynamic soaring is all about immediately utilizing the available energy from the wind shear encountered, the proposed algorithm promises its viability for practical on board implementations requiring computation of trajectories in near real time.

An inverse dynamics approach to trajectory optimization and guidance for an aerospace plane

NASA Technical Reports Server (NTRS)

Lu, Ping

1992-01-01

The optimal ascent problem for an aerospace planes is formulated as an optimal inverse dynamic problem. Both minimum-fuel and minimax type of performance indices are considered. Some important features of the optimal trajectory and controls are used to construct a nonlinear feedback midcourse controller, which not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suited for onboard implementation. Robust ascent guidance is obtained by using combination of feedback compensation and onboard generation of control through the inverse dynamics approach. Accurate orbital insertion can be achieved with near-optimal control of the rocket through inverse dynamics even in the presence of disturbances.

On making things the best - Aeronautical uses of optimization /Wright Bros. lecture/

NASA Technical Reports Server (NTRS)

Ashley, H.

1981-01-01

The paper's purpose is to summarize and evaluate the results of an investigation into the degree to which formal optimization methods have contributed practically to the design and operation of atmospheric flight vehicles. The nature of this technology is reviewed and illustrated with simple structural examples. A series of published successful applications is described, from the fields of aerodynamics, structures, guidance and control, optimal trajectories and vehicle configuration optimization. The corresponding improvements over conventional analysis are assessed. Speculations are offered as to why these tools have made such little headway toward acceptance by designers. The growing need for their use in the future is explained; they hold out an unparalleled opportunity for improved efficiencies.

A guidance law for hypersonic descent to a point

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eisler, G.R.; Hull, D.G.

1992-05-01

A neighboring external control problem is formulated for a hypersonic glider to execute a maximum-terminal-velocity descent to a stationary target. The resulting two-part, feedback control scheme initially solves a nonlinear algebraic problem to generate a nominal trajectory to the target altitude. Secondly, a neighboring optimal path computation about the nominal provides a lift and side-force perturbations necessary to achieve the target downrange and crossrange. On-line feedback simulations of the proposed scheme and a form of proportional navigation are compared with an off-line parameter optimization method. The neighboring optimal terminal velocity compares very well with the parameter optimization solution and ismore » far superior to proportional navigation. 8 refs.« less

A guidance law for hypersonic descent to a point

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eisler, G.R.; Hull, D.G.

1992-01-01

A neighboring external control problem is formulated for a hypersonic glider to execute a maximum-terminal-velocity descent to a stationary target. The resulting two-part, feedback control scheme initially solves a nonlinear algebraic problem to generate a nominal trajectory to the target altitude. Secondly, a neighboring optimal path computation about the nominal provides a lift and side-force perturbations necessary to achieve the target downrange and crossrange. On-line feedback simulations of the proposed scheme and a form of proportional navigation are compared with an off-line parameter optimization method. The neighboring optimal terminal velocity compares very well with the parameter optimization solution and ismore » far superior to proportional navigation. 8 refs.« less

Coarse analysis of collective behaviors: Bifurcation analysis of the optimal velocity model for traffic jam formation

NASA Astrophysics Data System (ADS)

Miura, Yasunari; Sugiyama, Yuki

2017-12-01

We present a general method for analyzing macroscopic collective phenomena observed in many-body systems. For this purpose, we employ diffusion maps, which are one of the dimensionality-reduction techniques, and systematically define a few relevant coarse-grained variables for describing macroscopic phenomena. The time evolution of macroscopic behavior is described as a trajectory in the low-dimensional space constructed by these coarse variables. We apply this method to the analysis of the traffic model, called the optimal velocity model, and reveal a bifurcation structure, which features a transition to the emergence of a moving cluster as a traffic jam.

Global Search Capabilities of Indirect Methods for Impulsive Transfers

NASA Astrophysics Data System (ADS)

Shen, Hong-Xin; Casalino, Lorenzo; Luo, Ya-Zhong

2015-09-01

An optimization method which combines an indirect method with homotopic approach is proposed and applied to impulsive trajectories. Minimum-fuel, multiple-impulse solutions, with either fixed or open time are obtained. The homotopic approach at hand is relatively straightforward to implement and does not require an initial guess of adjoints, unlike previous adjoints estimation methods. A multiple-revolution Lambert solver is used to find multiple starting solutions for the homotopic procedure; this approach can guarantee to obtain multiple local solutions without relying on the user's intuition, thus efficiently exploring the solution space to find the global optimum. The indirect/homotopic approach proves to be quite effective and efficient in finding optimal solutions, and outperforms the joint use of evolutionary algorithms and deterministic methods in the test cases.

Zebrafish tracking using convolutional neural networks.

PubMed

Xu, Zhiping; Cheng, Xi En

2017-02-17

Keeping identity for a long term after occlusion is still an open problem in the video tracking of zebrafish-like model animals, and accurate animal trajectories are the foundation of behaviour analysis. We utilize the highly accurate object recognition capability of a convolutional neural network (CNN) to distinguish fish of the same congener, even though these animals are indistinguishable to the human eye. We used data augmentation and an iterative CNN training method to optimize the accuracy for our classification task, achieving surprisingly accurate trajectories of zebrafish of different size and age zebrafish groups over different time spans. This work will make further behaviour analysis more reliable.

Zebrafish tracking using convolutional neural networks

NASA Astrophysics Data System (ADS)

Xu, Zhiping; Cheng, Xi En

2017-02-01

Keeping identity for a long term after occlusion is still an open problem in the video tracking of zebrafish-like model animals, and accurate animal trajectories are the foundation of behaviour analysis. We utilize the highly accurate object recognition capability of a convolutional neural network (CNN) to distinguish fish of the same congener, even though these animals are indistinguishable to the human eye. We used data augmentation and an iterative CNN training method to optimize the accuracy for our classification task, achieving surprisingly accurate trajectories of zebrafish of different size and age zebrafish groups over different time spans. This work will make further behaviour analysis more reliable.

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

DOE PAGES

Simonetto, Andrea; Dall'Anese, Emiliano

2017-07-26

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do notmore » require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.« less

Near-Optimal Tracking Control of Mobile Robots Via Receding-Horizon Dual Heuristic Programming.

PubMed

Lian, Chuanqiang; Xu, Xin; Chen, Hong; He, Haibo

2016-11-01

Trajectory tracking control of wheeled mobile robots (WMRs) has been an important research topic in control theory and robotics. Although various tracking control methods with stability have been developed for WMRs, it is still difficult to design optimal or near-optimal tracking controller under uncertainties and disturbances. In this paper, a near-optimal tracking control method is presented for WMRs based on receding-horizon dual heuristic programming (RHDHP). In the proposed method, a backstepping kinematic controller is designed to generate desired velocity profiles and the receding horizon strategy is used to decompose the infinite-horizon optimal control problem into a series of finite-horizon optimal control problems. In each horizon, a closed-loop tracking control policy is successively updated using a class of approximate dynamic programming algorithms called finite-horizon dual heuristic programming (DHP). The convergence property of the proposed method is analyzed and it is shown that the tracking control system based on RHDHP is asymptotically stable by using the Lyapunov approach. Simulation results on three tracking control problems demonstrate that the proposed method has improved control performance when compared with conventional model predictive control (MPC) and DHP. It is also illustrated that the proposed method has lower computational burden than conventional MPC, which is very beneficial for real-time tracking control.

Nozzle Mounting Method Optimization Based on Robot Kinematic Analysis

NASA Astrophysics Data System (ADS)

Chen, Chaoyue; Liao, Hanlin; Montavon, Ghislain; Deng, Sihao

2016-08-01

Nowadays, the application of industrial robots in thermal spray is gaining more and more importance. A desired coating quality depends on factors such as a balanced robot performance, a uniform scanning trajectory and stable parameters (e.g. nozzle speed, scanning step, spray angle, standoff distance). These factors also affect the mass and heat transfer as well as the coating formation. Thus, the kinematic optimization of all these aspects plays a key role in order to obtain an optimal coating quality. In this study, the robot performance was optimized from the aspect of nozzle mounting on the robot. An optimized nozzle mounting for a type F4 nozzle was designed, based on the conventional mounting method from the point of view of robot kinematics validated on a virtual robot. Robot kinematic parameters were obtained from the simulation by offline programming software and analyzed by statistical methods. The energy consumptions of different nozzle mounting methods were also compared. The results showed that it was possible to reasonably assign the amount of robot motion to each axis during the process, so achieving a constant nozzle speed. Thus, it is possible optimize robot performance and to economize robot energy.

Design of Quiet Rotorcraft Approach Trajectories

NASA Technical Reports Server (NTRS)

Padula, Sharon L.; Burley, Casey L.; Boyd, D. Douglas, Jr.; Marcolini, Michael A.

2009-01-01

A optimization procedure for identifying quiet rotorcraft approach trajectories is proposed and demonstrated. The procedure employs a multi-objective genetic algorithm in order to reduce noise and create approach paths that will be acceptable to pilots and passengers. The concept is demonstrated by application to two different helicopters. The optimized paths are compared with one another and to a standard 6-deg approach path. The two demonstration cases validate the optimization procedure but highlight the need for improved noise prediction techniques and for additional rotorcraft acoustic data sets.

Hodograph analysis in aircraft trajectory optimization

NASA Technical Reports Server (NTRS)

Cliff, Eugene M.; Seywald, Hans; Bless, Robert R.

1993-01-01

An account is given of key geometrical concepts involved in the use of a hodograph as an optimal control theory resource which furnishes a framework for geometrical interpretation of the minimum principle. Attention is given to the effects of different convexity properties on the hodograph, which bear on the existence of solutions and such types of controls as chattering controls, 'bang-bang' control, and/or singular control. Illustrative aircraft trajectory optimization problems are examined in view of this use of the hodograph.

An Automated Method to Compute Orbital Re-entry Trajectories with Heating Constraints

NASA Technical Reports Server (NTRS)

Zimmerman, Curtis; Dukeman, Greg; Hanson, John; Fogle, Frank R. (Technical Monitor)

2002-01-01

Determining how to properly manipulate the controls of a re-entering re-usable launch vehicle (RLV) so that it is able to safely return to Earth and land involves the solution of a two-point boundary value problem (TPBVP). This problem, which can be quite difficult, is traditionally solved on the ground prior to flight. If necessary, a nearly unlimited amount of time is available to find the 'best' solution using a variety of trajectory design and optimization tools. The role of entry guidance during flight is to follow the pre- determined reference solution while correcting for any errors encountered along the way. This guidance method is both highly reliable and very efficient in terms of onboard computer resources. There is a growing interest in a style of entry guidance that places the responsibility of solving the TPBVP in the actual entry guidance flight software. Here there is very limited computer time. The powerful, but finicky, mathematical tools used by trajectory designers on the ground cannot in general be converted to do the job. Non-convergence or slow convergence can result in disaster. The challenges of designing such an algorithm are numerous and difficult. Yet the payoff (in the form of decreased operational costs and increased safety) can be substantiaL This paper presents an algorithm that incorporates features of both types of guidance strategies. It takes an initial RLV orbital re-entry state and finds a trajectory that will safely transport the vehicle to Earth. During actual flight, the computed trajectory is used as the reference to be flown by a more traditional guidance method.

Moving-window dynamic optimization: design of stimulation profiles for walking.

PubMed

Dosen, Strahinja; Popović, Dejan B

2009-05-01

The overall goal of the research is to improve control for electrical stimulation-based assistance of walking in hemiplegic individuals. We present the simulation for generating offline input (sensors)-output (intensity of muscle stimulation) representation of walking that serves in synthesizing a rule-base for control of electrical stimulation for restoration of walking. The simulation uses new algorithm termed moving-window dynamic optimization (MWDO). The optimization criterion was to minimize the sum of the squares of tracking errors from desired trajectories with the penalty function on the total muscle efforts. The MWDO was developed in the MATLAB environment and tested using target trajectories characteristic for slow-to-normal walking recorded in healthy individual and a model with the parameters characterizing the potential hemiplegic user. The outputs of the simulation are piecewise constant intensities of electrical stimulation and trajectories generated when the calculated stimulation is applied to the model. We demonstrated the importance of this simulation by showing the outputs for healthy and hemiplegic individuals, using the same target trajectories. Results of the simulation show that the MWDO is an efficient tool for analyzing achievable trajectories and for determining the stimulation profiles that need to be delivered for good tracking.

Guidance trajectories for aeroassisted orbital transfer

NASA Technical Reports Server (NTRS)

Miele, A.

1990-01-01

Research on aerobraking guidance schemes is presented. The intent is to produce aerobraking guidance trajectories exhibiting many of the desirable characteristics of optimal aerobraking trajectories. Both one-control schemes and two-control schemes are studied. The research is in the interest of aeroassisted flight experiment vehicles (AFE) and aeroassisted orbital transfer (AOT) vehicles.

Self-optimized construction of transition rate matrices from accelerated atomistic simulations with Bayesian uncertainty quantification

NASA Astrophysics Data System (ADS)

Swinburne, Thomas D.; Perez, Danny

2018-05-01

A massively parallel method to build large transition rate matrices from temperature-accelerated molecular dynamics trajectories is presented. Bayesian Markov model analysis is used to estimate the expected residence time in the known state space, providing crucial uncertainty quantification for higher-scale simulation schemes such as kinetic Monte Carlo or cluster dynamics. The estimators are additionally used to optimize where exploration is performed and the degree of temperature acceleration on the fly, giving an autonomous, optimal procedure to explore the state space of complex systems. The method is tested against exactly solvable models and used to explore the dynamics of C15 interstitial defects in iron. Our uncertainty quantification scheme allows for accurate modeling of the evolution of these defects over timescales of several seconds.

Waypoints Following Guidance for Surface-to-Surface Missiles

NASA Astrophysics Data System (ADS)

Zhou, Hao; Khalil, Elsayed M.; Rahman, Tawfiqur; Chen, Wanchun

2018-04-01

The paper proposes waypoints following guidance law. In this method an optimal trajectory is first generated which is then represented through a set of waypoints that are distributed from the starting point up to the final target point using a polynomial. The guidance system then works by issuing guidance command needed to move from one waypoint to the next one. Here the method is applied for a surface-to-surface missile. The results show that the method is feasible for on-board application.

Mechanical vibration compensation method for 3D+t multi-particle tracking in microscopic volumes.

PubMed

Pimentel, A; Corkidi, G

2009-01-01

The acquisition and analysis of data in microscopic systems with spatiotemporal evolution is a very relevant topic. In this work, we describe a method to optimize an experimental setup for acquiring and processing spatiotemporal (3D+t) data in microscopic systems. The method is applied to a three-dimensional multi-tracking and analysis system of free-swimming sperm trajectories previously developed. The experimental set uses a piezoelectric device making oscillate a large focal-distance objective mounted on an inverted microscope (over its optical axis) to acquire stacks of images at a high frame rate over a depth on the order of 250 microns. A problem arise when the piezoelectric device oscillates, in such a way that a vibration is transmitted to the whole microscope, inducing undesirable 3D vibrations to the whole set. For this reason, as a first step, the biological preparation was isolated from the body of the microscope to avoid modifying the free swimming pattern of the microorganism due to the transmission of these vibrations. Nevertheless, as the image capturing device is mechanically attached to the "vibrating" microscope, the resulting acquired data are contaminated with an undesirable 3D movement that biases the original trajectory of these high speed moving cells. The proposed optimization method determines the functional form of these 3D oscillations to neutralize them from the original acquired data set. Given the spatial scale of the system, the added correction increases significantly the data accuracy. The optimized system may be very useful in a wide variety of 3D+t applications using moving optical devices.

Kinematic control of redundant robots and the motion optimizability measure.

PubMed

Li, L; Gruver, W A; Zhang, Q; Yang, Z

2001-01-01

This paper treats the kinematic control of manipulators with redundant degrees of freedom. We derive an analytical solution for the inverse kinematics that provides a means for accommodating joint velocity constraints in real time. We define the motion optimizability measure and use it to develop an efficient method for the optimization of joint trajectories subject to multiple criteria. An implementation of the method for a 7-dof experimental redundant robot is present.

A New Architecture for Extending the Capabilities of the Copernicus Trajectory Optimization Program

NASA Technical Reports Server (NTRS)

Williams, Jacob

2015-01-01

This paper describes a new plugin architecture developed for the Copernicus spacecraft trajectory optimization program. Details of the software architecture design and development are described, as well as examples of how the capability can be used to extend the tool in order to expand the type of trajectory optimization problems that can be solved. The inclusion of plugins is a significant update to Copernicus, allowing user-created algorithms to be incorporated into the tool for the first time. The initial version of the new capability was released to the Copernicus user community with version 4.1 in March 2015, and additional refinements and improvements were included in the recent 4.2 release. It is proving quite useful, enabling Copernicus to solve problems that it was not able to solve before.

An explicit solution to the exoatmospheric powered flight guidance and trajectory optimization problem for rocket propelled vehicles

NASA Technical Reports Server (NTRS)

Jaggers, R. F.

1977-01-01

A derivation of an explicit solution to the two point boundary-value problem of exoatmospheric guidance and trajectory optimization is presented. Fixed initial conditions and continuous burn, multistage thrusting are assumed. Any number of end conditions from one to six (throttling is required in the case of six) can be satisfied in an explicit and practically optimal manner. The explicit equations converge for off nominal conditions such as engine failure, abort, target switch, etc. The self starting, predictor/corrector solution involves no Newton-Rhapson iterations, numerical integration, or first guess values, and converges rapidly if physically possible. A form of this algorithm has been chosen for onboard guidance, as well as real time and preflight ground targeting and trajectory shaping for the NASA Space Shuttle Program.

A Global Approach to the Optimal Trajectory Based on an Improved Ant Colony Algorithm for Cold Spray

NASA Astrophysics Data System (ADS)

Cai, Zhenhua; Chen, Tingyang; Zeng, Chunnian; Guo, Xueping; Lian, Huijuan; Zheng, You; Wei, Xiaoxu

2016-12-01

This paper is concerned with finding a global approach to obtain the shortest complete coverage trajectory on complex surfaces for cold spray applications. A slicing algorithm is employed to decompose the free-form complex surface into several small pieces of simple topological type. The problem of finding the optimal arrangement of the pieces is translated into a generalized traveling salesman problem (GTSP). Owing to its high searching capability and convergence performance, an improved ant colony algorithm is then used to solve the GTSP. Through off-line simulation, a robot trajectory is generated based on the optimized result. The approach is applied to coat real components with a complex surface by using the cold spray system with copper as the spraying material.

The application of nonlinear programming and collocation to optimal aeroassisted orbital transfers

NASA Astrophysics Data System (ADS)

Shi, Y. Y.; Nelson, R. L.; Young, D. H.; Gill, P. E.; Murray, W.; Saunders, M. A.

1992-01-01

Sequential quadratic programming (SQP) and collocation of the differential equations of motion were applied to optimal aeroassisted orbital transfers. The Optimal Trajectory by Implicit Simulation (OTIS) computer program codes with updated nonlinear programming code (NZSOL) were used as a testbed for the SQP nonlinear programming (NLP) algorithms. The state-of-the-art sparse SQP method is considered to be effective for solving large problems with a sparse matrix. Sparse optimizers are characterized in terms of memory requirements and computational efficiency. For the OTIS problems, less than 10 percent of the Jacobian matrix elements are nonzero. The SQP method encompasses two phases: finding an initial feasible point by minimizing the sum of infeasibilities and minimizing the quadratic objective function within the feasible region. The orbital transfer problem under consideration involves the transfer from a high energy orbit to a low energy orbit.

Two neural network algorithms for designing optimal terminal controllers with open final time

NASA Technical Reports Server (NTRS)

Plumer, Edward S.

1992-01-01

Multilayer neural networks, trained by the backpropagation through time algorithm (BPTT), have been used successfully as state-feedback controllers for nonlinear terminal control problems. Current BPTT techniques, however, are not able to deal systematically with open final-time situations such as minimum-time problems. Two approaches which extend BPTT to open final-time problems are presented. In the first, a neural network learns a mapping from initial-state to time-to-go. In the second, the optimal number of steps for each trial run is found using a line-search. Both methods are derived using Lagrange multiplier techniques. This theoretical framework is used to demonstrate that the derived algorithms are direct extensions of forward/backward sweep methods used in N-stage optimal control. The two algorithms are tested on a Zermelo problem and the resulting trajectories compare favorably to optimal control results.

An improved multi-paths optimization method for video stabilization

NASA Astrophysics Data System (ADS)

Qin, Tao; Zhong, Sheng

2018-03-01

For video stabilization, the difference between original camera motion path and the optimized one is proportional to the cropping ratio and warping ratio. A good optimized path should preserve the moving tendency of the original one meanwhile the cropping ratio and warping ratio of each frame should be kept in a proper range. In this paper we use an improved warping-based motion representation model, and propose a gauss-based multi-paths optimization method to get a smoothing path and obtain a stabilized video. The proposed video stabilization method consists of two parts: camera motion path estimation and path smoothing. We estimate the perspective transform of adjacent frames according to warping-based motion representation model. It works well on some challenging videos where most previous 2D methods or 3D methods fail for lacking of long features trajectories. The multi-paths optimization method can deal well with parallax, as we calculate the space-time correlation of the adjacent grid, and then a kernel of gauss is used to weigh the motion of adjacent grid. Then the multi-paths are smoothed while minimize the crop ratio and the distortion. We test our method on a large variety of consumer videos, which have casual jitter and parallax, and achieve good results.