GTOC 7 Team 12 Solution
|
|
- MargaretMargaret Page
- 6 years ago
- Views:
Transcription
1 GTOC 7 Team 12 Solution Telespazio Vega Deutschland GmbH (Germany) Holger Becker, Gianni Casonato, Bernard Godard, Olympia Kyriopoulos, Ganesh Lalgudi, Matteo Renesto Contact: bernard <dot> godard <at> gmail <dot> com This document describes the optimization strategy employed by team 12 in the 7th Global Trajectory Optimization Competition (GTOC7). We start with presenting the assumptions we have made to prune the search space. This is followed by an outline of the global and local optimisation methods leading to the final proposed trajectory. Finally a description of the best trajectory found by the team is given. 1 Search space pruning Probes are assumed to be in rendez vous conditions with an asteroid at release and capture by the mothership. Due to the limited number of impulses and the low efficiency of the mothership engine, it is not possible to have all probes be released and captured at different asteroids, which means that some probe(s) will begin or end their trip in rendez vous at an asteroid which is also visited by another probe (of course only one probe is requested to stay 30 days in rendez vous conditions with that asteroid). To prune the search space, initially a graph was generated with all asteroids as nodes. A path was added between any two distinct asteroid pairs if the asteroid orbital plane relative inclination and semi major axis differences were below a certain threshold (1 degree, 0.1 AU). The graph was then pruned of all nodes with less than a certain amount of neighbours (100). This left only approximately 1000 asteroids with orbital periods of about 5 years. In retrospect, it seems this pruning was too strict, since allowing only small semi major axis differences between start and end of of each transfer arc makes it difficult to adjust orbital phase quickly enough. Then all paths in the pruned graph were removed and regenerated using a different approach: a path was added between any two distinct asteroid pairs if a ballistic transfer in one year with a total delta velocity cost (from Lambert solution) below a certain threshold could be found between those 2 asteroids during the mission lifetime. These paths were later used during the asteroid sequence generation as candidates for next asteroids given a current asteroid to avoid looping over the larger list of 1000 pruned asteroids.
2 The Mothership transfer to the first asteroid was computed with a Lambert solver with 2 impulses. One impulse is fired at launch since the launcher does not provide enough delta velocity. Thus the additional required delta velocity is obtained by a Mothership engine burn. The other impulse is fired at the first asteroid rendezvous. 2 Asteroid sequence search 2.1 Probes solution using RNNA Repetitive Nearest Neighbour Algorithm (RNNA) is a greedy algorithm able to find a sub optimal solution of a Traveling Salesman Problem (TSP). The idea is to use all nodes as starting points and to compute from each of them the sequence of asteroids choosing at each step the shortest node/asteroid, based on a problem specific distance criteria. The initial time for each starting asteroid is selected based on a mothership launch to asteroid rendezvous optimization. For GTOC, the TSP has the characteristic to be time dependent, as asteroids distances vary with time. The RNNA adaptation to GTOC performs then the search starting from a predefined set of asteroids and trying to find at each step the closest asteroid in term of delta velocity for the transfer. Additionally initial and final asteroids can be imposed so as to come back to the mothership at the end. The core of the RNNA is the identification, at each search step, of the closest asteroid starting from the current one. To do that taking into account the delta velocity and the flight time limits, the concept of distance is translated into a combined index calculated aggregating both of those state variables. The minimisation performed on such index guarantee a trade off in the selection of the next asteroids, trying in this way to balance the consumptions of both of them. 2.2 Probes solutions refinement using Simulated Annealing The results obtained with the RNNA method is used as input to an heuristic algorithm based on simulated annealing technique for trying to refine and improve the initial solution. Simulated annealing is a random search technique which exploits an analogy between the way in which a metal cools and freezes into a minimum energy crystalline structure (the annealing process) and the search for a minimum in a more general system; it forms the basis of an optimisation technique for combinatorial and other problems. Simulated annealing approaches the global maximisation problem using a controlled iteration loop where at each stage a certain set of bounces in the solution are allowed, exploring in that way alternative solutions not directly reachable from the initial one. The loop control is based on the solution temperature concept, beginning at a high "temperature" which
3 enables the ball to make very high bounces, and decreasing to lower temperatures, with less probability to make solution bounces. The possible changes in the solution are produced by a certain generating distribution typically built using problem specific knowledge. An acceptance distribution is defined as well, for deciding on the basis of probability if a new solution shall be accepted. Both the generating and acceptance distributions depend on the temperature. For the GTOC7 TSP, the generating distribution introduced try both to modify a certain asteroids sequence without adding new ones, and to completely scratch a part of it and replace it with a new asteroid sequence. More specifically the change trials which are performed are: swap position for a pair of asteroids and recalculate the asteroids arrival and departure times according to the new flight time values replace an asteroid in a solution sequence with another one picked up from the search basket, and update the overall solution, trying also to append further asteroids scratch a solution starting from a certain asteroid and start creating a completely new one from that point on using RNNA, adding other asteroids picked up from the search basket 2 Low thrust trajectory generation The low thrust trajectory were generated arc by arc using an indirect optimization code. 3 Software used: The low thrust optimiser was written in Java for GTOC5. It is an adaptation of an algorithm from Bryson s book Dynamic Optimization. The implementation uses the open source mathematics library Apache Commons Math. In general, a lot of open source software was used such as PyGMO, PyKEP, Scipy and their many dependencies. PyGMO and PyKEP were used for example in finding a 3 impulses transfer for mothership from initial asteroid (where probes are released) to final asteroid (where probes are captured). 4 The final solution Our final solution starts with a ballistic transfer to asteroid from Earth using one engine burn at Earth to add to the launcher velocity. Then a burn is made at asteroid to rendezvous with the asteroid where the probes are released. Then a 3 impulses transfer brings the mothership to rendezvous with asteroid 7393 where it will later collect the probes. Only probe 1 stays 30 days at asteroids and 7393.
4 The solution is summarized in the table and figures below. The symbol in the plots represents a probe release while the symbol represents a probe capture. The times when either mothership or probes are in rendezvous conditions with an asteroid are marked with thicker lines. launch date (Modified Julian Date) escape velocity (launcher only not including main engine simultaneous burn) in meters per seconds J2000 ecliptic probe 1 release date (Modified Julian Date) probe 2 release date (Modified Julian Date) probe 3 release date (Modified Julian Date) probe 1 capture date (Modified Julian Date) probe 2 capture date (Modified Julian Date) probe 3 capture date (Modified Julian Date) probe 1 visited asteroids (minimum stay of 30 days) probe 2 visited asteroids (minimum stay of 30 days) probe 3 visited asteroids (minimum stay of 30 days) 10945, 5033, 11092, 1042, 1883, , 10975, 14256, , 2090, 9727, 2087, 9712 probe 1 final mass (kg) probe 2 final mass (kg) probe 3 final mass (kg) mother ship final mass (kg) with recovered probes primary performance index 15 secondary performance index (kg)
5
6
7
8
GTOC 7 Solution Descriptoin for Team 2
GTOC 7 Solution Descriptoin for Team 2 DLR Institute of Space Systems June 17, 2014 Index of contents Index of contents... 2 1. Description of Methods Used... 3 1.1. Trajectory Calculation Methods... 3
More informationGTOC7. Mechatronics Research Group Department of Industrial Engineering. Solution of Team 9
Mechatronics Research Group Department of Industrial Engineering GTOC7 Solution of Team 9 Team members: Enrico Bertolazzi enrico.bertolazzi@unitn.it Francesco Biral Paolo Bosetti Marco Frego Maximiliano
More informationOuter Planet Mission Analysis Group Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Drive Pasadena, CA USA
Team 9 Response to the 7 th Global Trajectory Optimisation Competition hosted by Politecnico di Torino and Università di Roma, La Sapienza May-June 04 Team 9 - JPL Anastassios E. Petropoulos, Gregory Lantoine,
More informationResults found by the CNES team (team #4)
3 rd Global Trajectory Optimisation Competition (GTOC3) organized by the Aerospace Propulsion Group of the Dipartimento di Energetica at Politecnico di Torino Results found by the CNES team (team #4) Presented
More informationTeam 4 GTOC 7 REPORT
Team 4 GTOC 7 REPORT Hongwei Yang, Gao Tang, Fanghua Jiang, & Zhiguo Zhang School of Aerospace Engineering, Tsinghua University 6 th, March 2015, Rome Outline Optimization Methods and Tools Preliminary
More informationFinal Rankings and Brief Descriptions of the Returned Solutions and Methods Used for the 2 nd Global Trajectory Optimisation Competition
Final Rankings and Brief Descriptions of the Returned Solutions and Methods Used for the nd Global Trajectory Optimisation Competition Anastassios E. Petropoulos Outer Planets Mission Analysis Group Jet
More informationIAC-08-C1.2.3 DESIGN SPACE PRUNING HEURISTICS AND GLOBAL OPTIMIZATION METHOD FOR CONCEPTUAL DESIGN OF LOW-THRUST ASTEROID TOUR MISSIONS
IAC-8-C1.2.3 DESIGN SPACE PRUNING HEURISTICS AND GLOBAL OPTIMIZATION METHOD FOR CONCEPTUAL DESIGN OF LOW-THRUST ASTEROID TOUR MISSIONS Kristina Alemany Georgia Institute of Technology, United States kalemany@gatech.edu
More informationLow Thrust Mission Trajectories to Near Earth Asteroids
Low Thrust Mission Trajectories to Near Earth Asteroids Pratik Saripalli Graduate Research Assistant, College Park, Maryland, 20740, USA Eric Cardiff NASA Goddard Space Flight Center, Greenbelt, Maryland,
More informationPrevious Lecture. Orbital maneuvers: general framework. Single-impulse maneuver: compatibility conditions
2 / 48 Previous Lecture Orbital maneuvers: general framework Single-impulse maneuver: compatibility conditions closed form expression for the impulsive velocity vector magnitude interpretation coplanar
More information1 st ACT Competition on Global Trajectory Optimisation Solution of Team #7
1 st ACT Competition on Global Trajectory Optimisation Solution of Team #7 Régis Bertrand Thierry Ceolin Richard Epenoy CNES-DCT/SB/MO CS-ESPACE/FDS CNES-DCT/SB/MO Contents Presentation of team #7 Available
More informationSPACECRAFT TRAJECTORY DESIGN FOR TOURS OF MULTIPLE SMALL BODIES
AAS 09-433 SPACECRAFT TRAJECTORY DESIGN FOR TOURS OF MULTIPLE SMALL BODIES Brent W. Barbee, George W. Davis, and Sun Hur Diaz INTRODUCTION Spacecraft science missions to small bodies (asteroids and comets)
More information1 Heuristics for the Traveling Salesman Problem
Praktikum Algorithmen-Entwurf (Teil 9) 09.12.2013 1 1 Heuristics for the Traveling Salesman Problem We consider the following problem. We want to visit all the nodes of a graph as fast as possible, visiting
More informationLOTNAV. A Low-Thrust Interplanetary Navigation Tool: The Trajectory Reconstruction Module
LOTNAV A Low-Thrust Interplanetary Navigation Tool: The Trajectory Reconstruction Module Juan Luis Cano González Mission Analysis Division Deimos Space S.L. -1- The LOTNAV Tool The Low-Thrust Interplanetary
More informationOPTIMISATION COMPETITION
1 ST ACT GLOBAL TRAJECTORY OPTIMISATION COMPETITION Carlos Corral Van Damme Raul Cadenas Gorgojo Jesus Gil Fernandez (GMV, S.A.) ESTEC, 2 nd February, 2006 GMV S.A., 2006 Property of GMV S.A. All rights
More informationGTOC7. 7 th Global Trajectory Optimisation Competition Multi-Spacecraft Main-Belt Asteroid Tour
GTOC7 7 th Global Trajectory Optimisation Competition Multi-Spacecraft Main-Belt Asteroid Tour Organised by Profs. Lorenzo Casalino & Guido Colasurdo Politecnico di Torino & Università di Roma Sapienza
More informationL eaving Earth and arriving at another planet or asteroid requires
Designing Interplanetary Transfers L eaving Earth and arriving at another planet or asteroid requires a spacecraft to implement a sequence of manoeuvres. These include changes of velocity needed to escape
More informationAnt Colony Optimization: an introduction. Daniel Chivilikhin
Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling
More informationThe optimization of electric propulsion (EP) trajectories for interplanetary missions is a quite difficult
Indirect Optimization Method for Low-Thrust Interplanetary Trajectories IEPC-27-356 Presented at the 3 th International Electric Propulsion Conference, Florence, Italy Lorenzo Casalino, Guido Colasurdo
More informationASTRIUM. Interplanetary Path Early Design Tools at ASTRIUM Space Transportation. Nathalie DELATTRE ASTRIUM Space Transportation.
Interplanetary Path Early Design Tools at Space Transportation Nathalie DELATTRE Space Transportation Page 1 Interplanetary missions Prime approach: -ST has developed tools for all phases Launch from Earth
More informationProblem A: Solar Sailing to Mars
Problem A: Solar Sailing to Mars Team 670 November 13, 017 Abstract Solar sails became reality lately, being far more affordable then most of modern methods of propulsion in space. They obviously have
More informationD1 Discrete Mathematics The Travelling Salesperson problem. The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm
1 iscrete Mathematics The Travelling Salesperson problem The Nearest Neighbour lgorithm The Lower ound lgorithm The Tour Improvement lgorithm The Travelling Salesperson: Typically a travelling salesperson
More informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
More informationMULTIPLE SPACE DEBRIS COLLECTING MISSION OPTIMAL MISSION PLANNING. Max CERF. AIRBUS Defence and Space Les Mureaux, France
MULTIPLE SPACE DEBRIS COLLECTING MISSION OPTIMAL MISSION PLANNING Max CERF AIRBUS Defence and Space 78130 Les Mureaux, France max.cerf@astrium.eads.net ABSTRACT In order to keep a safe access to space
More informationNumerical Techniques for Computing Orbits
Astrodynamics ASD3: Numerical Techniques for Computing Orbits By Prof. Gregory D. Durgin In this lecture, we present a method for computing the trajectories of satellites around planets or stars with a
More informationActa Futura 8 (2014) DOI: /AF GTOC5: Results from the European Space Agency and University of Florence
Acta Futura 8 (2014) 45-55 DOI: 10.2420/AF08.2014.45 Acta Futura GTOC5: Results from the European Space Agency and University of Florence Dario Izzo *, Luís F. Simões, Chit Hong Yam, Francesco Biscani
More informationRigorous Global Optimization of Impulsive Space Trajectories
Rigorous Global Optimization of Impulsive Space Trajectories P. Di Lizia, R. Armellin, M. Lavagna K. Makino, M. Berz Fourth International Workshop on Taylor Methods Boca Raton, December 16 19, 2006 Motivation
More informationCOUPLED OPTIMIZATION OF LAUNCHER AND ALL-ELECTRIC SATELLITE TRAJECTORIES
COUPLED OPTIMIZATION OF LAUNCHER AND ALL-ELECTRIC SATELLITE TRAJECTORIES M. Verlet (1), B. Slama (1), S. Reynaud (1), and M. Cerf (1) (1) Airbus Defence and Space, 66 Route de Verneuil, 78133 Les Mureaux,
More informationMassimiliano Vasile, Stefano Campagnola, Paolo Depascale, Stefano Pessina, Francesco Topputo
A Toolbox for Preliminary Massimiliano Vasile, Stefano Campagnola, Paolo Depascale, Stefano Pessina, Francesco Topputo Mission Analysis and Design PAMSIT IMAGO ATOM-C EPIC Massimiliano Vasile, Stefano
More informationIntro to Contemporary Math
Intro to Contemporary Math Hamiltonian Circuits and Nearest Neighbor Algorithm Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Hamiltonian Circuits and the Traveling Salesman
More informationPatch Conics. Basic Approach
Patch Conics Basic Approach Inside the sphere of influence: Planet is the perturbing body Outside the sphere of influence: Sun is the perturbing body (no extra-solar system trajectories in this class...)
More informationRADIATION OPTIMUM SOLAR-ELECTRIC-PROPULSION TRANSFER FROM GTO TO GEO
RADIATION OPTIMUM SOLAR-ELECTRIC-PROPULSION TRANSFER FROM GTO TO GEO R. Jehn European Space Operations Centre, ESA/ESOC, Robert-Bosch-Str. 5, 64289Darmstadt, Germany, +49 6151 902714, ruediger.jehn@esa.int
More informationEvolutionary Constrained Optimization for a Jupiter Capture
Evolutionary Constrained Optimization for a Jupiter Capture Jérémie Labroquère, Aurélie Héritier 1, Annalisa Riccardi 1, Dario Izzo 1 Advanced Concepts Team, European Space Agency (ESA-ESTEC), Noordwijk,
More informationData Structures in Java
Data Structures in Java Lecture 21: Introduction to NP-Completeness 12/9/2015 Daniel Bauer Algorithms and Problem Solving Purpose of algorithms: find solutions to problems. Data Structures provide ways
More informationAstromechanics. 6. Changing Orbits
Astromechanics 6. Changing Orbits Once an orbit is established in the two body problem, it will remain the same size (semi major axis) and shape (eccentricity) in the original orbit plane. In order to
More informationBenchmarking different global optimisation techniques for preliminary space trajectory design
58th International Astronautical Congress, Hyderabad, 24-28 September 27. Copyright 27 by Advanced Concepts Team. Published by the IAF, with permission and Released to IAF or IAA to publish in all forms.
More information7.1 Basis for Boltzmann machine. 7. Boltzmann machines
7. Boltzmann machines this section we will become acquainted with classical Boltzmann machines which can be seen obsolete being rarely applied in neurocomputing. It is interesting, after all, because is
More informationSimulated Annealing. Local Search. Cost function. Solution space
Simulated Annealing Hill climbing Simulated Annealing Local Search Cost function? Solution space Annealing Annealing is a thermal process for obtaining low energy states of a solid in a heat bath. The
More informationAlgorithm Design Strategies V
Algorithm Design Strategies V Joaquim Madeira Version 0.0 October 2016 U. Aveiro, October 2016 1 Overview The 0-1 Knapsack Problem Revisited The Fractional Knapsack Problem Greedy Algorithms Example Coin
More informationGlobal Optimization of Impulsive Interplanetary Transfers
Global Optimization of Impulsive Interplanetary Transfers R. Armellin, Dipartimento di Ingegneria Aerospaziale, Politecnico di Milano Taylor Methods and Computer Assisted Proofs Barcelona, June, 3 7, 2008
More informationAstrodynamics (AERO0024)
Astrodynamics (AERO0024) L06: Interplanetary Trajectories Gaëtan Kerschen Space Structures & Systems Lab (S3L) Motivation 2 Problem Statement? Hint #1: design the Earth-Mars transfer using known concepts
More informationSatellite Orbital Maneuvers and Transfers. Dr Ugur GUVEN
Satellite Orbital Maneuvers and Transfers Dr Ugur GUVEN Orbit Maneuvers At some point during the lifetime of most space vehicles or satellites, we must change one or more of the orbital elements. For example,
More informationOptimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem
Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 20 Travelling Salesman Problem Today we are going to discuss the travelling salesman problem.
More informationFigure 1. View of ALSAT-2A spacecraft
ALSAT-2A TRANSFER AND FIRST YEAR OPERATIONS M. Kameche (1), A.H. Gicquel (2), D. Joalland (3) (1) CTS/ASAL, 1 Avenue de la Palestine, BP 13, Arzew 31200 Oran, Algérie, email:mo_kameche@netcourrier.com
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 15: The Greedy Heuristic Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of
More informationFlight and Orbital Mechanics
Flight and Orbital Mechanics Lecture slides Challenge the future 1 Flight and Orbital Mechanics AE-104, lecture hours 1-4: Interplanetary flight Ron Noomen October 5, 01 AE104 Flight and Orbital Mechanics
More informationMotivation, Basic Concepts, Basic Methods, Travelling Salesperson Problem (TSP), Algorithms
Motivation, Basic Concepts, Basic Methods, Travelling Salesperson Problem (TSP), Algorithms 1 What is Combinatorial Optimization? Combinatorial Optimization deals with problems where we have to search
More informationFinding optimal configurations ( combinatorial optimization)
CS 1571 Introduction to AI Lecture 10 Finding optimal configurations ( combinatorial optimization) Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Constraint
More informationA Simple Semi-Analytic Model for Optimum Specific Impulse Interplanetary Low Thrust Trajectories
A Simple Semi-Analytic Model for Optimum Specific Impulse Interplanetary Low Thrust Trajectories IEPC-2011-010 * Presented at the 32nd International Electric Propulsion Conference, Wiesbaden Germany David
More informationMethods for finding optimal configurations
CS 1571 Introduction to AI Lecture 9 Methods for finding optimal configurations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Search for the optimal configuration Optimal configuration search:
More informationArtificial Intelligence Methods (G5BAIM) - Examination
Question 1 a) According to John Koza there are five stages when planning to solve a problem using a genetic program. What are they? Give a short description of each. (b) How could you cope with division
More informationSolar Orbiter Ballistic Transfer Mission Analysis Synthesis
European Space Agency Agence Spatiale Européenne directorate of operations and infrastructure ground systems engineering department mission analysis office MAO Working Paper No. 483 Issue 1, Rev. 0 Solar
More informationSAFETY GUIDED DESIGN OF CREW RETURN VEHICLE IN CONCEPT DESIGN PHASE USING STAMP/STPA
SAFETY GUIDED DESIGN OF CREW RETURN VEHICLE IN CONCEPT DESIGN PHASE USING STAMP/STPA Haruka Nakao (1), Masa Katahira (2), Yuko Miyamoto (2), Nancy Leveson (3), (1) Japan Manned Space Systems Corporation,
More informationEscape Trajectories from Sun Earth Distant Retrograde Orbits
Trans. JSASS Aerospace Tech. Japan Vol. 4, No. ists30, pp. Pd_67-Pd_75, 06 Escape Trajectories from Sun Earth Distant Retrograde Orbits By Yusue OKI ) and Junichiro KAWAGUCHI ) ) Department of Aeronautics
More informationFast approximators for optimal low-thrust hops between main belt asteroids
Fast approximators for optimal low-thrust hops between main belt asteroids Daniel Hennes Robotics Innovation Center DFKI Bremen, Germany Email: daniel.hennes@dfki.de Dario Izzo Advanced Concepts Team ESA,
More informationMAE 180A: Spacecraft Guidance I, Summer 2009 Homework 4 Due Thursday, July 30.
MAE 180A: Spacecraft Guidance I, Summer 2009 Homework 4 Due Thursday, July 30. Guidelines: Please turn in a neat and clean homework that gives all the formulae that you have used as well as details that
More informationThe Kerbal Space Program
The Kerbal Space Program Fall 2013 Phy 223- Semester Project Documentation due Monday November, 25 11:59PM Introduction The goal of this project is to begin a space program on the planet Kerbin. Luckily,
More informationLABORATORY II DESCRIPTION OF MOTION IN TWO DIMENSIONS
LABORATORY II DESCRIPTION OF MOTION IN TWO DIMENSIONS This laboratory allows you to continue the study of accelerated motion in more realistic situations. The cars you used in Laboratory I moved in only
More informationLABORATORY II DESCRIPTION OF MOTION IN TWO DIMENSIONS
LABORATORY II DESCRIPTION OF MOTION IN TWO DIMENSIONS In this laboratory you continue the study of accelerated motion in more situations. The carts you used in Laboratory I moved in only one dimension.
More informationSwarm Intelligence Traveling Salesman Problem and Ant System
Swarm Intelligence Leslie Pérez áceres leslie.perez.caceres@ulb.ac.be Hayfa Hammami haifa.hammami@ulb.ac.be IRIIA Université Libre de ruxelles (UL) ruxelles, elgium Outline 1.oncept review 2.Travelling
More informationVehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology
Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part II: Algorithmic Enhancements Handling Practical Complexities
More information16.410/413 Principles of Autonomy and Decision Making
6.4/43 Principles of Autonomy and Decision Making Lecture 8: (Mixed-Integer) Linear Programming for Vehicle Routing and Motion Planning Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute
More informationMission Trajectory Design to a Nearby Asteroid
Mission Trajectory Design to a Nearby Asteroid A project present to The Faculty of the Department of Aerospace Engineering San Jose State University in partial fulfillment of the requirements for the degree
More informationTRAJECTORY DESIGN FOR JOVIAN TROJAN ASTEROID EXPLORATION VIA SOLAR POWER SAIL. Kanagawa, Japan ,
TRAJECTORY DESIGN FOR JOVIAN TROJAN ASTEROID EXPLORATION VIA SOLAR POWER SAIL Takanao Saiki (), Yoji Shirasawa (), Osamu Mori () and Jun ichiro Kawaguchi (4) ()()()(4) Japan Aerospace Exploration Agency,
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationExpanding opportunities for lunar gravity capture
Expanding opportunities for lunar gravity capture Keita Tanaka 1, Mutsuko Morimoto 2, Michihiro Matsumoto 1, Junichiro Kawaguchi 3, 1 The University of Tokyo, Japan, 2 JSPEC/JAXA, Japan, 3 ISAS/JAXA, Japan,
More informationGUIDANCE, NAVIGATION, AND CONTROL TECHNIQUES AND TECHNOLOGIES FOR ACTIVE DEBRIS REMOVAL
GUIDANCE, NAVIGATION, AND CONTROL TECHNIQUES AND TECHNOLOGIES FOR ACTIVE DEBRIS REMOVAL Antonio Rinalducci, Guillermo Ortega Hernando, Sven Erb, Alexander Cropp, Thomas Voirin, Olivier Dubois-Matra, Gianfranco
More informationChapter 7 Rocket Propulsion Physics
Chapter 7 Rocket Propulsion Physics To move any spacecraft off the Earth, or indeed forward at all, there must be a system of propulsion. All rocket propulsion relies on Newton s Third Law of Motion: in
More informationMission Design Options for Solar-C Plan-A
Solar-C Science Definition Meeting Nov. 18, 2008, ISAS Mission Design Options for Solar-C Plan-A Y. Kawakatsu (JAXA) M. Morimoto (JAXA) J. A. Atchison (Cornell U.) J. Kawaguchi (JAXA) 1 Introduction 2
More informationJupiter Trojans Rendezvous Mission Design
Jupiter Trojans Rendezvous Mission Design Triwanto Simanjuntak 1, Masaki Nakamiya, and Yasuhiro Kawakatsu 1 The Graduate University for Advanced Studies (SOKENDAI) Japan Aerospace Exploration Agency (JAXA)
More informationOrbit Design Marcelo Suárez. 6th Science Meeting; Seattle, WA, USA July 2010
Orbit Design Marcelo Suárez Orbit Design Requirements The following Science Requirements provided drivers for Orbit Design: Global Coverage: the entire extent (100%) of the ice-free ocean surface to at
More informationarxiv: v3 [physics.space-ph] 10 Mar 2016
Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions arxiv:1511.00821v3 [physics.space-ph] 10 Mar 2016 Dario Izzo, Daniel Hennes, Luís F. Simões, and Marcus
More informationRAPID GEOSYNCHRONOUS TRANSFER ORBIT ASCENT PLAN GENERATION. Daniel X. Junker (1) Phone: ,
RAPID GEOSYNCHRONOUS TRANSFER ORBIT ASCENT PLAN GENERATION Daniel X. Junker (1) (1) LSE Space GmbH, Argelsrieder Feld 22, 82234 Wessling, Germany, Phone: +49 160 9111 6696, daniel.junker@lsespace.com Abstract:
More informationESMO Mission Analysis
Changing the economics of space ESMO Mission Analysis SRR Workshop Alison Gibbings 22 nd 26 th March 2010 Review of the existing baseline Sensitivity analysis Contents At lunar Injection Along the WSB-Moon
More informationSURVEY OF GLOBAL OPTIMIZATION METHODS FOR LOW- THRUST, MULTIPLE ASTEROID TOUR MISSIONS
AAS 07-211 SURVEY OF GLOBAL OPTIMIZATION METHODS FOR LOW- THRUST, MULTIPLE ASTEROID TOUR MISSIONS INTRODUCTION Kristina Alemany *, Robert D. Braun Electric propulsion has recently become a viable option
More informationWeek Cuts, Branch & Bound, and Lagrangean Relaxation
Week 11 1 Integer Linear Programming This week we will discuss solution methods for solving integer linear programming problems. I will skip the part on complexity theory, Section 11.8, although this is
More informationAstrodynamics (AERO0024)
Astrodynamics (AERO0024) 10. Interplanetary Trajectories Gaëtan Kerschen Space Structures & Systems Lab (S3L) Motivation 2 6. Interplanetary Trajectories 6.1 Patched conic method 6.2 Lambert s problem
More informationBravoSat: Optimizing the Delta-V Capability of a CubeSat Mission. with Novel Plasma Propulsion Technology ISSC 2013
BravoSat: Optimizing the Delta-V Capability of a CubeSat Mission with Novel Plasma Propulsion Technology Sara Spangelo, NASA JPL, Caltech Benjamin Longmier, University of Michigan Interplanetary Small
More informationREVISION SHEET DECISION MATHS 2 DECISION ANALYSIS
REVISION SHEET DECISION MATHS 2 DECISION ANALYSIS The main ideas are covered in AQA Edexcel MEI OCR D2 Before the exam you should know The meaning of the different kinds of node. Be able to construct a
More informationTRAJECTORY SIMULATIONS FOR THRUST-VECTORED ELECTRIC PROPULSION MISSIONS
RAJECORY SIMULAIONS FOR HRUS-VECORED ELECRIC PROPULSION MISSIONS Abstract N. Leveque, C. Welch, A. Ellery, A. Curley Kingston University, Astronautics and Space Systems Group School of Engineering Friars
More informationHayabusa Status and Proximity Operation. As of September 2nd, 2005
Hayabusa Status and Proximity Operation As of September 2nd, 2005 2005/9/2 0 What is Hayabusa? World s First Round-trip Interplanetary Flight HAYABUSA Challenge to Asteroid Sample Return Touch-down + Dimensions
More information60 C From Bicycle to Space. Dionysis Konstantinou Corina Toma. Space Travel
60 C From Bicycle to Space Dionysis Konstantinou Corina Toma C Space Travel From Bicycle Length to Space of the CDay61 introduction Imagine travelling from one planet to another Why is it that we have
More informationPHYS 1111L - Introductory Physics Laboratory I
PHYS 1111L - Introductory Physics Laboratory I Laboratory Advanced Sheet Projectile Motion Laboratory 1. Objective. The objective of this laboratory is to predict the range of a projectile set in motion
More informationDEFLECTING HAZARDOUS ASTEROIDS FROM COLLISION WITH THE EARTH BY USING SMALL ASTEROIDS
DEFLECTING HAZARDOUS ASTEROIDS FROM COLLISION WITH THE EARTH BY USING SMALL ASTEROIDS N. Eismont (1), M. Boyarsky (1), A. Ledkov (1), B.Shustov (2), R. Nazirov (1), D. Dunham (3) and K. Fedyaev (1) (1)
More information5. Simulated Annealing 5.1 Basic Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini
5. Simulated Annealing 5.1 Basic Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Real Annealing and Simulated Annealing Metropolis Algorithm Template of SA A Simple Example References
More information, (1b) Assistant Professor, Delft University of Technology. Kluyverweg 1 - Delft - The Netherlands.
PRELIMINARY TRAJECTORY DESIGN FOR A SOLAR POLAR OBSERVATORY USING SEP AND MULTIPLE GRAVITY ASSISTS Luca Corpaccioli (1a), Ron Noomen (1b), Stijn De Smet (2a), Jeffrey Parker (2b), and Jonathan Herman (2c)
More informationIDENTIFYING NEAR-EARTH ASTEROID TARGETS FOR HUMAN EXPLORATION USING PARTICLE SWARM OPTIMIZATION AISHWARYA STANLEY THESIS
IDENTIFYING NEAR-EARTH ASTEROID TARGETS FOR HUMAN EXPLORATION USING PARTICLE SWARM OPTIMIZATION BY AISHWARYA STANLEY THESIS Submitted in partial fulfillment of the requirements for the degree of Master
More informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More informationASEN 6008: Interplanetary Mission Design Lab Spring, 2015
ASEN 6008: Interplanetary Mission Design Lab Spring, 2015 Lab 4: Targeting Mars using the B-Plane Name: I d like to give credit to Scott Mitchell who developed this lab exercise. He is the lead Astrodynamicist
More informationSingle Solution-based Metaheuristics
Parallel Cooperative Optimization Research Group Single Solution-based Metaheuristics E-G. Talbi Laboratoire d Informatique Fondamentale de Lille Single solution-based metaheuristics Improvement of a solution.
More informationSIMBOL-X: A FORMATION FLYING MISSION ON HEO FOR EXPLORING THE UNIVERSE
SIMBOL-X: A FORMATION FLYING MISSION ON HEO FOR EXPLORING THE UNIVERSE P. Gamet, R. Epenoy, C. Salcedo Centre National D Etudes Spatiales (CNES) 18 avenue Edouard Belin, 31401 TOULOUSE Cedex 9, France
More informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
More informationUnit 4 Work, Power & Conservation of Energy Workbook
Name: Per: AP Physics C Semester 1 - Mechanics Unit 4 Work, Power & Conservation of Energy Workbook Unit 4 - Work, Power, & Conservation of Energy Supplements to Text Readings from Fundamentals of Physics
More informationIAC-16.A Jason A. Reiter a *, David B. Spencer b
IAC-16.A6.7.5 Trading Spacecraft Propellant Use and Mission Performance to Determine the Optimal Collision Probability in Emergency Collision Avoidance Scenarios Jason A. Reiter a *, David B. Spencer b
More informationInterplanetary Trajectory design for Rosetta and Solar Orbiter
Jose Rodriguez-Canabal Memorial Interplanetary Trajectory design for Rosetta and Solar Orbiter Johannes Schoenmaekers H / Mission Analysis Section (HSO-GFA) Senior Adviser ESA / ESOC Email: johannes.schoenmaekers@esa.int
More informationAstrodynamics (AERO0024)
Astrodynamics (AERO0024) 5B. Orbital Maneuvers Gaëtan Kerschen Space Structures & Systems Lab (S3L) Previous Lecture: Coplanar Maneuvers 5.1 INTRODUCTION 5.1.1 Why? 5.1.2 How? 5.1.3 How much? 5.1.4 When?
More informationLecture D30 - Orbit Transfers
J. Peraire 16.07 Dynamics Fall 004 Version 1.1 Lecture D30 - Orbit Transfers In this lecture, we will consider how to transfer from one orbit, or trajectory, to another. One of the assumptions that we
More informationOptimal Control based Time Optimal Low Thrust Orbit Raising
Optimal Control based Time Optimal Low Thrust Orbit Raising Deepak Gaur 1, M. S. Prasad 2 1 M. Tech. (Avionics), Amity Institute of Space Science and Technology, Amity University, Noida, U.P., India 2
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 11: Integer Programming Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of Mathematical
More informationMarks. bonus points. } Assignment 1: Should be out this weekend. } Mid-term: Before the last lecture. } Mid-term deferred exam:
Marks } Assignment 1: Should be out this weekend } All are marked, I m trying to tally them and perhaps add bonus points } Mid-term: Before the last lecture } Mid-term deferred exam: } This Saturday, 9am-10.30am,
More informationOptimal Trajectory Control of an Occulter-Based Planet-Finding Telescope
Optimal Trajectory Control of an Occulter-Based Planet-Finding Telescope Egemen Kolemen and N. Jeremy Kasdin Princeton University, Princeton, NJ, 08544, USA The optimal configuration of a satellite formation
More information