Future ambitious solar system exploration missions are likely to require ever larger propulsion capabilities and involve innovative interplanetary trajectories in order to accommodate the increasingly complex mission scenarios. Two recent advances in trajectory design can be exploited to meet those new requirements: the use of low-thrust propulsion which enables larger cumulative momentum exchange relative to chemical propulsion; and the consideration of low-energy transfers relying on full multi-body dynamics. Yet the resulting optimal control problems are hypersensitive, time-consuming and extremely difficult to tackle with current optimization tools. Therefore, the goal of the thesis is to develop a methodology that facilitates and simplifies the solution finding process of low-thrust optimization problems in multi-body environments. Emphasis is placed on robust techniques to produce good solutions for a wide range of cases despite the strong nonlinearities of the problems. The complete trajectory is broken down into different component phases, which facilitates the modeling of the effects of multiple bodies and makes the process less sensitive to the initial guess. A unified optimization framework is created to solve the resulting multi-phase optimal control problems. Interfaces to state-of-the-art solvers SNOPT and IPOPT are included. In addition, a new, robust Hybrid Differential Dynamic Programming (HDDP) algorithm is developed. HDDP is based on differential dynamic programming, a proven robust second-order technique that relies on Bellman's Principle of Optimality and successive minimization of quadratic approximations. HDDP also incorporates nonlinear mathematical programming techniques to increase efficiency, and decouples the optimization from the dynamics using first- and second-order state transition matrices. Crucial to this optimization procedure is the generation of the sensitivities with respect to the variables of the system. In the context of trajectory optimization, these derivatives are often tedious and cumbersome to estimate analytically, especially when complex multi-body dynamics are considered. To produce a solution with minimal effort, an new approach is derived that computes automatically first- and high-order derivatives via multicomplex numbers. Another important aspect of the methodology is the representation of low-thrust trajectories by different dynamical models with varying degrees of fidelity. Emphasis is given on analytical expressions to speed up the optimization process. In particular, one novelty of the framework is the derivation and implementation of analytic expressions for motion subjected to Newtonian gravitation plus an additional constant inertial force. Example applications include low-thrust asteroid tour design, multiple flyby trajectories, and planetary inter-moon transfers. In the latter case, we generate good initial guesses using dynamical systems theory to exploit the chaotic nature of these multi-body systems. The developed optimization framework is then used to generate low-energy, inter-moon trajectories with multiple resonant gravity assists.

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

A spacecraft tour trajectory is a trajectory in which a spacecraft visits a number of objects in sequence. The target objects may consist of satellites, moons, planets or any other body in orbit, and the spacecraft may visit these in a variety of ways, for example flying by or rendezvousing with them. The key characteristic is the target object sequence which can be represented as a discrete set of decisions that must be made along the trajectory. When this sequence is free to be chosen, the result is a hybrid discrete-continuous optimization problem that combines the challenges of discrete and combinatorial optimization with continuous optimization. The problem can be viewed as a generalization of the traveling salesman problem; such problems are NP-hard and their computational complexity grows exponentially with the problem size. The focus of this dissertation is the development of a novel methodology for the solution of spacecraft tour trajectory optimization problems. A general model for spacecraft tour trajectories is first developed which defines the parameterization and decision variables for use in the rest of the work. A global search methodology based on the tabu search metaheuristic is then developed. The tabu search approach is extended to operate on a tree-based solution representation and neighborhood structure, which is shown to be especially efficient for problems with expensive solution evaluations. Concepts of tabu search including recency-based tabu memory and strategic intensification and diversification are then applied to ensure a diverse exploration of the search space. The result is an automated, adaptive and efficient search algorithm for spacecraft tour trajectory optimization problems. The algorithm is deterministic, and results in a diverse population of feasible solutions upon termination. A novel numerical search space pruning approach is then developed, based on computing upper bounds to the reachable domain of the spacecraft, to accelerate the search. Finally, the overall methodology is applied to the fourth annual Global Trajectory Optimization Competition (GTOC4), resulting in previously unknown solutions to the problem, including one exceeding the best known in the literature. / text

Challenging science requirements and complex space missions are driving the need for fast and robust space trajectory design and simulation tools. The main aim of this thesis is to develop new and improved high performance algorithms and solution techniques for commonly encountered problems in astrodynamics. Five major problems are considered and their state-of-the art algorithms are systematically improved. Theoretical and methodological improvements are combined with modern computational techniques, resulting in increased algorithm robustness and faster runtime performance. The five selected problems are 1) Multiple revolution Lambert problem, 2) High-fidelity geopotential (gravity field) computation, 3) Ephemeris computation, 4) Fast and accurate sensitivity computation, and 5) High-fidelity multiple spacecraft simulation. The work being presented enjoys applications in a variety of fields like preliminary mission design, high-fidelity trajectory simulation, orbit estimation and numerical optimization. Other fields like space and environmental science to chemical and electrical engineering also stand to benefit.

Baigiamajame magistro darbe nagrinėjamas šešiakojo roboto judėjimas. Pateikiami vienos kojos atvirkštinės kinematikos uždavinio sprendimai Denavito ir Hartenbergo bei geometriniu metodais. Analizuojamas vienos kojos trajektorijos sudarymo metodas ir pateikiams jos aprašymo būdas. Pateikiami galimi trajektorijų pavyzdžiai. Sudaroma trikojės roboto eisenos seka bei diagrama. Darbe pateikiamas roboto valdymo algoritmas ir valdymo programa, atsižvelgiant į apibrėžtus variklių valdymo kriterijus. Eksperimentiškai tiriamas roboto judėjimas lygiu paviršiumi taikant trikoję eiseną. Pagal rezultatus koreguojama eisena. Atliekami trajektorijos pakartojimo tikslumo bandymai. Įvertinus rezultatus pateikiamos baigiamojo darbo išvados ir pasiūlymai. / Hexapod robot locomotion is analyzed in this paper. Inverse kinematics solutions are proposed for one leg using Denavit-Hartenberg and geometric methods. Trajectory forming for one leg is analyzed and solution for delineating trajectory is introduced. Possible leg trajectory examples are presented. Tripod gait sequence and diagram is designed for robot. Work presents robot control algorithm and program according to motor control parameters. Robot locomotion over regular terrain using tripod gait is tested. Gait then is corrected according to test results. Tests are made for trajectory repeating accuracy. Conclusions and solutions are made according to results.

<p>This dissertation presents a novel distributed optimal control (DOC) problem formulation that is applicable to multiscale dynamical systems comprised of numerous interacting systems, or agents, that together give rise to coherent macroscopic behaviors, or coarse dynamics, that can be modeled by partial differential equations (PDEs) on larger spatial and time scales. The DOC methodology seeks to obtain optimal agent state and control trajectories by representing the system's performance as an integral cost function of the macroscopic state, which is optimized subject to the agents' dynamics. The macroscopic state is identified as a time-varying probability density function to which the states of the individual agents can be mapped via a restriction operator. Optimality conditions for the DOC problem are derived analytically, and the optimal trajectories of the macroscopic state and control are computed using direct and indirect optimization algorithms. Feedback microscopic control laws are then derived from the optimal macroscopic description using a potential function approach.</p><p>The DOC approach is demonstrated numerically through benchmark multi-agent trajectory optimization problems, where large systems of agents were given the objectives of traveling to goal state distributions, avoiding obstacles, maintaining formations, and minimizing energy consumption through control. Comparisons are provided between the direct and indirect optimization techniques, as well as existing methods from the literature, and a computational complexity analysis is presented. The methodology is also applied to a track coverage optimization problem for the control of distributed networks of mobile omnidirectional sensors, where the sensors move to maximize the probability of track detection of a known distribution of mobile targets traversing a region of interest (ROI). Through extensive simulations, DOC is shown to outperform several existing sensor deployment and control strategies. Furthermore, the computation required by the DOC algorithm is proven to be far reduced compared to that of classical, direct optimal control algorithms.</p> / Dissertation

No description available.

<p>The missed-thrust problem is a modern challenge in the field of mission design. While some methods exist to quantify its effects, there still exists room for improvement for algorithms which can fully anticipate and plan for a realistic set of missed-thrust events. The present work investigates the use of machine learning techniques to provide a robust controller for a low-thrust spacecraft. The spacecraft’s thrust vector is provided by a neural network controller which guides the spacecraft to the target along a trajectory that is robust to missed thrust, and the controller does not need to re-optimize any trajectories if it veers off its nominal course. The algorithms used to train the controller to account for missed thrust are supervised learning and neuroevolution. Supervised learning entails showing a neural network many examples of what inputs and outputs should look like, with the network learning over time to duplicate the patterns it has seen. Neuroevolution involves testing many neural networks on a problem, and using the principles of biological evolution and survival of the fittest to produce increasingly competitive networks. Preliminary results show that a controller designed with these methods provides mixed results, but performance can be greatly boosted if the controller’s output is used as an initial guess for an optimizer. With an optimizer, the success rate ranges from around 60% to 96% depending on the problem.</p> <p><br></p> <p>Additionally, this work conducts an analysis of a novel hyperbolic rendezvous strategy which was originally conceived by Dr. Buzz Aldrin. Instead of rendezvousing on the outbound leg of a hyperbolic orbit (traveling away from Earth), the spacecraft performs a rendezvous while on the inbound leg (traveling towards Earth). This allows for a relatively low Delta-v abort option for the spacecraft to return to Earth if a problem arose during rendezvous. Previous work that studied hyperbolic rendezvous has always assumed rendezvous on the outbound leg because the total Delta-v required (total propellant required) for the insertion alone is minimal with this strategy. However, I show that when an abort maneuver is taken into consideration, inserting on the inbound leg is both lower Delta-v overall, and also provides an abort window which is up to a full day longer.</p>

Applying reinforcement learning to control systems enables the use of machine learning to develop elegant and efficient control laws. Coupled with the representational power of neural networks, reinforcement learning algorithms can learn complex policies that can be difficult to emulate using traditional control system design approaches. In this thesis, three different model-free reinforcement learning algorithms, including Monte Carlo Control, REINFORCE with baseline, and Guided Policy Search are compared in simulated, continuous action-space environments. The results show that the Guided Policy Search algorithm is able to learn a desired control policy much faster than the other algorithms. In the inverted pendulum system, it learns an effective policy up to three times faster than the other algorithms. In the cartpole system, it learns an effective policy up to nearly fifteen times faster than the other algorithms.

No description available.