connor/thesis
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Started section 5

Browse Source
This commit is contained in:
Connor Johnstone
2022-02-03 17:43:32 -07:00
parent 3a9ae45fcd
commit 53418ebc3c
2 changed files with 31 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
LaTeX/thesis.tex
View File

@@ -599,8 +599,35 @@ Monotonic Basin Hopping}
% Discuss both the necessity for mutation and the mutation algorithm being used. % Discuss both the necessity for mutation and the mutation algorithm being used.
\section{Algorithm Overview} \label{algorithm} \section{Algorithm Overview} \label{algorithm}
Highlight the algorithm at a high-level. This is likely where flowcharts and diagrams will go to
give a high-level overview. In this section, we will review the actual execution of the algorithm developed. As an
overview, the routine was developed to enable the determination of an optimized spacecraft
trajectory from the selection of some very basic mission parameters. Those parameters
include:
\begin{itemize}
\item Spacecraft dry mass
\item Thruster Specific Impulse
\item Thruster Maximum Thrusting Force
\item Thruster Duty Cycle Percentage
\item Number of Thruster on Spacecraft
\item Total Starting Weight of the Spacecraft
\item A Maximum Acceptable $V_\infty$ at arrival and $C_3$ at launch
\item The Launch Window Timing and the Latest Arrival
\item A cost function relating the mass usage, $v_\infty$ at arrival, and $C_3$ at
launch to a cost
\item A list of flyby planets starting with Earth and ending with the destination
\end{itemize}
Which allows for extremely automated optimization of the trajectory, while still providing
the mission designer with the flexibility to choose the particular flyby planets to
investigate.
This is achieved via an optimal control problem in which the ``inner loop'' is a
non-linear programming problem to determine the optimal low-thrust control law and flyby
parameters given a suitable initial guess. Then an ``outer loop'' monotonic basin hopping
algorithm is used to traverse the search space and more carefully optimize the solutions
found by the inner loop.
\subsection{Trajectory Composition} \subsection{Trajectory Composition}
Discuss briefly the nomenclature used in defining these trajectories. Currently this isn't Discuss briefly the nomenclature used in defining these trajectories. Currently this isn't

3
julia/find_neptune.jl
View File

@@ -1,4 +1,5 @@
using Thesis include("src/Thesis.jl")
using .Thesis
using Dates using Dates
using SPICE using SPICE
using LinearAlgebra using LinearAlgebra