Fast Trajectory Generation and Asteroid Sequence Selection in Multispacecraft for Multiasteroid Exploration.

This paper describes a recently developed method for the determination of optimal, e g minimum-fuel or minimum-time, trajectories for spacecraft. The method will be introduced after a brief discussion of methods previously used by researchers for trajectory optimization. However, the objective here is not to discuss all such methods or provide a comprehensive description of them but rather to provide sufficient information regarding extant methods that what is novel and beneficial about the solution method we have developed may be recognized. Several example optimal trajectories for spacecraft using lowthrust propulsion will be presented.KeywordsOptimal Control ProblemOptimal TrajectoryPrime VectorAdjoint VariableSystem Differential EquationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Low-thrust interplanetary spacecraft trajectory optimization poses a uniquely difficult problem to solve because of the inherent nonlinearities of the dynamics and constraints as well as the large size of the search space of possible solutions. Tools currently exist that optimize low-thrust interplanetary trajectories, but these tools are rarely openly available to the public, and when they are available they require multiple interfaces between multiple different packages. The goal of this work is to present a new piece of low-thrust interplanetary spacecraft trajectory optimization software that is open-source and entirely self-contained so that more people can have access to the ability to design interplanetary trajectories. To achieve this goal, a gradient-descent based nonlinear programming method, called the interior point method, was used. The nonlinear programming method was chosen so that results from this work could be compared and contrasted with results from Spacecraft Trajectory Optimization Suite (STOpS), which uses heuristics to iterate towards a solution. Interior point methods are popular because of their ability to handle large amounts of equality and inequality constraints, which is a characteristic that is valuable for low-thrust interplanetary spacecraft trajectories. The software developed, Interior Point Optimizer (IP Optimizer), was then validated against test cases with known solutions to ensure that the software delivered the intended results. Lastly, a constraint satisfaction, a minimum-time, and a maximum-final-mass optimization problem were solved and compared with literature to illustrate the advantages of IP Optimizer and the methods it employs. For the constraint satisfaction problem, IP Optimizer was able to find a solution that exactly satisfied the desired terminal constraints whereas STOpS had an error of 2.29 percent. In this case, IP Optimizer had a reduced runtime of 15 percent compared to STOpS as well. When minimizing time for a spacecraft transfer, IP Optimizer improved upon the solution found by STOpS by 5.3 percent. The speed of convergence for IP Optimizer was almost twice as fast as STOpS for this case. These results show that IP Optimizer is faster than STOpS at converging on a solution and the solution it converges to has a better objective value and more accurately satisfies the terminal constraints than STOpS. Lastly, the maximum-final-mass problem resulted in an objective value that was only 0.5 percent lower than the value found in literature.

Multimode electric propulsion system is widely used in deep space exploration. Its thrust is output in stages with the change of input power, which also means that continuous power changes lead to discontinuous thrust changes. In the design and optimization of low-thrust trajectory, the discontinuity of thrust is often neglected and regarded as a continuous parameter. The optimal design of low-thrust transfer trajectory constrained by multimode electric propulsion is studied, and the influence of thrust grading characteristics on the trajectory is analyzed in this paper. A specific optimization strategy is proposed, including three main steps: model discretization based on direct method, fast generation of initial value based on particle swarm optimization (PSO), and optimization based on sequential quadratic programming (SQP). The dynamic model and optimization model of low-thrust transfer trajectory is established. Then, the optimization model is discretized based on the direct method and the original optimal control problem is transformed into a parameter optimization problem in the form of nonlinear programming (NLP). A hybrid optimization algorithm based on PSO and SQP is proposed to solve the new NLP problem. PSO is used to search the initial value efficiently and guarantee the global performance of the initial value and SQP is used for local optimization based on initial value, which can give full play to the excellent global optimization performance of PSO and the outstanding local optimization performance of SQP. The effectiveness of the proposed optimization strategy is verified by a simulation example of the main belt asteroid Metis (1974 QU2) rendezvous mission with once Mars gravity assist. The results show that the optimal control curve obtained is in accordance with the optimal control form of bang-bang control derived from the theory, and the thruster has just two situations at any time: shutdown or startup with maximum thrust. In the working power range, increasing the number of thrust stages can improve the rate of energy utilization, thereby improving the efficiency of thruster, shortening the startup time and reducing fuel consumption. Meanwhile, ineffective grading should be avoided in the non-working power range.

A System for Collaborative Design, Analysis, and Optimization of Spacecraft Trajectories

This paper presents an approach for multi-spacecraft trajectory planning, optimization and control. Maneuver planning as a global optimization problem is solved using genetic algorithms (GA). Methods were devised to reduce the dimensionality of the decision space, yet retain adequate generality of maneuver possibilities. A compact formulation based on thruster switching-times was used for generic point-to-point spacecraft maneuvers. Optimal control is implicitly satisfied by "bang-coast-bang" actuation schemes. Maneuver profiles, including line-of-sight and orthogonal collision avoidance, were developed. A GA optimizer selects the optimal parameter set for each scenario. Simulation case studies were performed for 2, 3 and 5-spacecraft formation initialization tasks. Objective criteria used in the evaluation function included: endpoint errors; collision avoidance; path lengths; maneuvering times; fuel usage and equalization. In all cases, a nominal GA computed feasible trajectories. Objective criteria trade-offs were demonstrated by selective weighting. Ongoing work includes multi-objective optimization of multiple spacecraft trajectories using niched-Pareto genetic algorithms.

This paper presents a systematic method for generating optimal helicopter flight trajectories in real time for cockpit display. Helicopter flights in the event of a single engine failure are critical, and display of optimal flight paths on-board is desirable. Due to the large number of states and constraints, however, numerical solutions on a mainframe computer can take a long tune. In this paper, optimal solutions are first obtained off-line using a ground computer. For a given set of initial helicopter states and flight parameters, optimal solutions are fitted by a Fourier series. The coefficients of the Fourier approximations are then interpolated as functions of initial flight states and parameters. The approximate optimal trajectories can be quickly generated on-board using the proposed method. Introduction Engine failure is a major safety issue for all helicopters, especially during takeoff and landing operations. Due to the complexity of the situation and the dependence of safety on many parameters, optimal flight trajectories can provide useful guidance for pilot operation. In particular, on-board display of optimal trajectories is desirable. This paper presents a method for generating optimal flight trajectories in real-tune that can be used for on-board display. Depending on its capability and performance during an engine failure, a transport helicopter can be certified as Category A or Category B. The Federal Aviation Administration (FAA) grants Category B certification to a single or multi-engine helicopter with gross weight less than 20,000 Ib and capable of landing safely in case of one or all engine failures. Category A certification, on the other hand, is granted to multi-engine helicopters with independent engine systems. Category A helicopters must be able to either land safely or continue flight in case of One Engine Inoperation (OEI). This makes Category A helicopters uniquely suited for remote places where emergency landing sites are not available. I Ph.D. Candidate, Center for Control Sciences, Member AIAA * Assistant Professor, Dept. of Aerospace Eng. and Mechanics, Member AIAA + Civil Rotorcraft Group Leader, Rotorcraft and Powered Lift Branch The decision to continue the flight or to land represents an energy management problem. It has been shown''' that this decision depends on initial conditions at the time of failure as well as flight parameters. Due to the numerous initial variables involved in this decision, a method to communicate all this information to the pilot instantaneously, at engine failure, is needed. This method must keep the emergency procedure simple and manageable. In particular, on-board cockpit display of optimal flight trajectories is useful. This requires a reliable real-tune solution of optimal trajectories, on board, with limited time, limited computing power, and limited memory available. If possible, an analytical solution of optimal trajectories is desirable. Unfortunately, this can only be achieved for systems of low order and where the equations of motion and the cost function are simple. Therefore, for a complex system, an open-loop numerical procedure becomes necessary. Research efforts were made to solve optimal control problems in real-time. Schultz et al. used calculus of variation and energy state method to generate optimal trajectories on-board for the National Aerospace Plane (NASP). In his study, the equations of motion of the NASP are less complex than those of the helicopter, and an interval of time of few minutes is allowed. Bryson used neighboring control theory to generate near-optimal solutions that could be used in real-time. This method is elegant but requires a large amount of memory to store the needed perturbation matrices. Also, it is valid on a relatively small neighborhood of the nominal trajectory. Perturbation methods and table lookups are often used if only few parameters are involved. In the current problem, the equations of motion of the helicopter are complex and too many path equality and inequality constraints are present. Also, limitations on tune, computing power, and memory available make all the above methods unsuitable for this problem. This paper proposes a technique of real-time optimal trajectory generation based on approximation and

A new shape-based multiple-impulse strategy for coplanar orbital maneuvers

This paper presents a novel real-time quasi-optimal trajectory generator, based on the inverse dynamics in the virtual domain (IDVD) method, to produce a reliable and efficient guidance system for autonomous underwater vehicle (AUV) docking operations. To this end, a challenging docking scenario is defined in a cluttered operating field, encompassing ocean currents and no-fly zones. Using the IDVD method, a trajectory that takes into consideration the hydrodynamic model of the vehicle is generated and the optimality of this trajectory, in regards to mission time and energy expenditure of the vehicle, is considered. Computer simulations demonstrate that the IDVD-based strategy enables the guiding of a vehicle into the dock by satisfying the final boundary conditions of the dock's position and orientation. Generated trajectories are feasible, smooth and realizable using for the vehicle's low-level auto-pilot module. In terms of computation, the solution is suitable for real-time implementation that incorporates uncertainty handling of the operating environment. For further analysis, the generated trajectory is evaluated on a high fidelity AUV simulator. The result of this latter test also demonstrates applicability of the utilized IDVD method for optimization of docking trajectories.

In this chapter, the problem of improving convergence and finding suitable tentative solutions for the indirect optimization of spacecraft trajectories is discussed. The application of theory of optimal control to spacecraft trajectories transforms the optimal control problem into a multi-point boundary value problem, which is usually solved by means of an iterative procedure. The convergence radius of the problem may be small and convergence to the optimal solution is only obtained if the tentative solution, which is used to start the procedure, is sufficiently close to the optimum. The definition of a suitable solution is often the hardest part of the solution procedure for the optimization problem. Several cases and examples are presented in this chapter to illustrate the measures that could be adopted for the most common difficulties, which may be found during the optimization of space trajectories.

<div>In this dissertation, methods for real-time trajectory generation and autonomous obstacle avoidance for fixed-wing and quad-rotor unmanned aerial vehicles (UAV) are studied. A key challenge for such trajectory generation is the high computation time required to plan a new path to safely maneuver around obstacles instantaneously. Therefore, methods for rapid generation of obstacle avoidance trajectory are explored. The high computation time is a result of the computationally intensive algorithms used to generate trajectories for real-time object avoidance. Recent studies have shown that custom solvers have been developed that are able to solve the problem with a lower computation time however these designs are limited to small sized problems or are proprietary. Additionally, for a swarm problem, which is an area of high interest, as the number of agents increases the problem size increases and in turn creates further computational challenges. A solution to these challenges will allow for UAVs to be used in autonomous missions robust to environmental uncertainties.</div><div><br></div><div>In this study, a trajectory generation problem posed as an optimal control problem is solved using a sequential convex programming approach; a nonlinear programming algorithm, for which custom solver is used. First, a method for feasible trajectory generation for fast-paced obstacle-rich environments is presented for the case of fixed-wing UAVs. Next, a problem of trajectory generation for fixed-wing and quad-rotor UAVs is defined such that starting from an initial state a UAV moves forward along the direction of flight while avoiding obstacles and remaining close to a reference path. The problem is solved within the framework of finite-horizon model predictive control. Finally, the problem of trajectory generation is extended to a swarm of quad-rotors where each UAV in a swarm has a reference path to fly along. Utilizing a centralized approach, a swarm scenario with moving targets is studied in two different cases in an attempt to lower the solution time; the first, solve the entire swarm problem at once, and the second, solve iteratively for a UAV in the swarm while considering trajectories of other UAVs as fixed.</div><div><br></div><div>Results show that a feasible trajectory for a fixed-wing UAV can be obtained within tens of milliseconds. Moreover, the obtained feasible trajectories can be used as initial guesses to the optimal solvers to speed up the solution of optimal trajectories. The methods explored demonstrated the ability for rapid feasible trajectory generation allowing for safe obstacle avoidance, which may be used in the case an optimal trajectory solution is not available. A comparative study between a dynamic and a kinematic model shows that the dynamic model provides better trajectories including aggressive trajectories around obstacles compared to the kinematic counterpart for fixed-wing UAVs, despite having approximately the same computational demands. Whereas, for the case of quad-rotor UAVs, the kinematic model takes almost half the solution time than with a reduced dynamic model, despite having approximately the similar range of values for the cost function. When extended to a swarm, solving the problem for each UAV is four to seven times computationally cheaper than solving the swarm as a whole. With the improved computation time for trajectory generation for a swarm of quad-rotors using centralized approach, the problem is now reasonably scalable, which opens up the possibility to increase the number of agents in a swarm using high-end computing machines for real-time applications. Overall, a custom solver jointly with a sequential convex programming approach solves an optimization problem in a low computation time.</div>

In the present research, optimal control problem for low thrust spacecraft orbital transfer is investigated by combination of analytical method and Artificial Bee Colony (ABC) algorithm, which is a population-based method. Spacecraft trajectory optimization is defined for orbital transfer from Low Earth Orbit (LEO) to Geosynchronous Earth Orbit (GEO). In the proposed analytical method co-state variables are simplified by employing concepts of optimal control and specific conditions which are considered for the problem, consequently, an adjoint differential equation is added to set of differential equations and these equations are solved simultaneously that result in optimum transfer trajectory. Dynamic modeling of the problem is represented based on Edelbaum equations and trajectory design is carried out considering circular orbits. Optimization problem is defined for different kinds of objective functions such as minimum time, minimum control effort, minimum time with minimum control effort as well as both minimum time and minimum control effort considering different optimal weighted coefficients. These coefficients are searched by means of artificial bee colony algorithm in weighted minimum time minimum effort scheme. Initial values of control variable and terminal time for all defined objective functions are foraged through artificial bee colony algorithm. The rate of changes of the states and control variables are obtained and depicted during orbit transfer. The obtained results demonstrate considerable convergence as well as sufficient accuracy.

Fast initial design of low-thrust multiple gravity-assist three-dimensional trajectories based on the Bezier shape-based method

As robots become more capable in terms of hardware, and more complex tasks are considered, optimality starts playing a more important role in the design of algorithms implemented in these systems. Optimality is a guiding principle that directs the computation of feasible and efficient solutions to different robotics tasks. In control theory, this principle is implemented online as a set of efficient numerical optimization algorithms, that in addition to solving the task, purports to save a suitably defined effort or energy term. This thesis investigates trajectory generation, learning and control for dynamic tasks from the unifying point of view of optimization. As an application, we focus on Table Tennis, a chal- lenging task where robots are yet to outperform humans. We believe that the required dexterity and accuracy for this dynamical task hinges on the developments in online optimization and efficient learning algorithms. We consider trajectory generation for table tennis in the first part of the thesis. In highly dynamic tasks like table tennis that involve moving targets, planning is necessary to figure out when, where and how to intercept the target. Motion planning can be very challenging in robotic table tennis in particular, due to time constraints, dimension of the search space and joint limits. Conventional planning algorithms often rely on a fixed virtual hitting plane to construct robot striking trajectories. These algorithms, however, generate restrictive strokes and can result in unnatural strategies when compared with human playing. In this thesis, we introduce a new trajectory generation framework for robotic table tennis that does not involve a fixed hitting plane. A free-time optimal control approach is used to derive two different trajectory optimizers. The resulting two algorithms, Focused Player and Defensive Player, encode two different play- styles. We evaluate their performance in simulation and in our robot table tennis platform with a high speed cable-driven seven DOF robot arm. The algorithms return the balls with a higher probability to the opponent’s court when compared with a virtual hitting plane based method. Moreover, both can be run online and the trajectories can be corrected with new ball observations. In the second part of the thesis, we look at how such trajectories, computed on the kine- matics level, can be tracked accurately with learning control based approaches. Highly dynamic tasks like table tennis require large accelerations and precise tracking for successful perfor- mance. To track desired trajectories well, such tasks usually rely on accurate models and/or high gain feedback. While kinematic optimization allows for efficient representation and online generation of hitting trajectories, learning to track such dynamic movements with inaccurate models remains an open problem. In particular, stability issues surrounding the learning per- formance, in the iteration domain, can prevent the successful implementation of model based learning approaches. To achieve accurate tracking for these tasks in a stable and efficient way, we propose a new adaptive Iterative Learning Control algorithm that is implemented efficiently using a recursive approach. Moreover, covariance estimates of model matrices are used to ex- ercise caution during learning. We evaluate the performance of the proposed approach in our robotic table tennis platform, where we show how the performance of two Barrett WAMs can be optimized. Our implementation on the table tennis platform compares favorably with two state-of-the-art approaches. Finally, we discuss an alternative learning from demonstrations approach, where we learn sparse representations from demonstrated movements. Learning from demonstrations is an easy and intuitive way to show examples of successful behavior to a robot. However, the fact that humans optimize or take advantage of their body and not of the robot, usually called the embodiment problem in robotics, often prevents industrial robots from executing the task in a straightforward way. The shown movements often do not or cannot utilize the degrees of freedom of the robot efficiently, and typically suffer from excessive execution errors. In the last chapter, we show a new approach that can alleviate some of these difficulties by learning sparse representations of movement. Moreover, the number of learned parameters are independent of the degrees of freedom of the robot. Sparsity is a desirable feature for policy search Rein- forcement Learning algorithms that adapt the parameters of these movement primitives. By ranking the learned parameters on the Elastic Net path in terms of importance, we note that our approach could be potentially useful to combat the curse of dimensionality in robot learning applications. We show preliminary results on the real robot setup, including a successful table tennis serve using our new movement primitive representation. Throughout the thesis, we present and analyze in detail new control and learning algo- rithms. Efficient online optimization approaches are presented that can be used to solve not just table tennis problems, but they can be adapted to solve different dynamic tasks.

According to the disadvantages of indirect method for trajectory optimization, that initial value the for conjugate variables are highly sensitive and can not obtain the global optimal solution, this paper introduced hybrid genetic algorithm to search initial value of conjugate variables, solved equations to obtain the track of Near Spacecraft at unpowered gliding phase. In the optimization process, the author takes the constraints of heating rate, dynamic pressure and overload into consideration, and optimizes the trajectory of under different initial factors. Numerical simulations confirm the applicability of the presented algorithm. Considering practical applications, some typical spacecraft gliding trajectory are optimized. The discussion of the numerical simulations gives some valuable opinions in practical applications.

In this article, we focus on safe and effective completion of a rendezvous and docking task by looking at planning approaches and control with fuel-optimal rendezvous for a target spacecraft running on a near-circular reference orbit. A variety of existent practical path constraints are considered, including the constraints of field of view, impulses, and passive safety. A rendezvous approach is calculated by using a hybrid genetic algorithm with those constraints. Furthermore, a control method of trajectory tracking is adopted to overcome the external disturbances. Based on Clohessy–Wiltshire equations, we first construct the mathematical model of optimal planning approaches of multiple impulses with path constraints. Second, we introduce the principle of hybrid genetic algorithm with both stronger global searching ability and local searching ability. We additionally explain the application of this algorithm in the problem of trajectory planning. Then, we give three-impulse simulation examples to acquire an optimal rendezvous trajectory with the path constraints presented in this article. The effectiveness and applicability of the tracking control method are verified with the optimal trajectory above as control objective through the numerical simulation.