Planetary Moon Tours are among the most challenging problems in mission analysis, as they require solving high-dimensional mixed-integer optimisation tasks over effectively unbounded design spaces. While recent automated approaches have focused on the "Endgame" case-orbit insertion around a single target moon-this work extends the scope by embedding mission constraints and science objectives directly into the optimisation process to enable automated Tour design. The proposed pipeline combines trajectory optimisation with feasibility considerations within a unified graph-based framework. Illustrative constraints include quantitative surface-coverage requirements and minimum/maximum flyby altitudes, while the structure remains general and can accommodate a broad range of design and operations requirements. The design space is discretised through resonant and non-resonant transfers, VILTs, COT sequences, and unpowered flybys, mapped on each moon's V-Infinity Globe. The first stage constructs and optimises single-moon phases in a Keplerian patched-conics 0-SOI model. A scalar edge cost, defined as a weighted combination of Delta V, ToF, and flyby surface coverage, enables the use of Dijkstra's algorithm to efficiently identify optimal sequences; coverage is computed via spherical surface partitioning. Optimal single-moon phases are then patched across moons through inter-moon Lambert arcs in an external graph structure, introducing time dependence via encounter longitude. This second framework is treated using a IG-UCS algorithm and includes both Lambert transfers and single-moon solutions as macro-transfers, allowing constraints to filter admissible trajectories early in the search. The pipeline is assessed on two Saturnian case studies across different cost-function weightings, showing that it can autonomously generate high-coverage, low-Delta V flyby sequences and assemble multi-moon Tours for the outer moons of the system.
I Tour tra lune planetarie sono tra i problemi più complessi dell’analisi di missione, poiché richiedono la risoluzione di problemi di ottimizzazione mista ad alta dimensionalità con design spaces virtualmente illimitati. Mentre approcci automatici recenti si sono concentrati sul caso "Endgame"-l'inserzione in orbita attorno a una singola luna-questo lavoro amplia l’ambito includendo vincoli di missione e obiettivi scientifici direttamente nel processo di ottimizzazione, così da permettere la progettazione automatica di Tour. La struttura proposta combina l’ottimizzazione di traiettoria con considerazioni di fattibilità all’interno di un quadro unificato basato su grafi. Tra i vincoli considerati vi sono requisiti quantitativi di copertura superficiale e limiti minimo/massimo di quota di flyby, nonstante la struttura rimanga generale e possa accogliere un’ampia gamma di requisiti di progetto e operativi. Lo spazio di progetto è discretizzato tramite trasferimenti risonanti e non risonanti, VILT, sequenze COT e flyby naturali, mappati sul V-Infinity Globe di ciascuna luna. Il primo stadio costruisce e ottimizza le fasi single-moon in un modello kepleriano patched-conics a 0 sfera di influenza (0-SOI). Un costo scalare sugli archi, definito come combinazione pesata di Delta V, tempo di volo (ToF) e copertura superficiale durante i flyby, consente l’impiego dell’algoritmo di Dijkstra per identificare in modo efficiente sequenze ottimali; la copertura è calcolata tramite una discretizzazione sferica della superficie. Le fasi single-moon ottimali vengono quindi raccordate tra lune tramite archi di Lambert inter-lunari in una struttura a grafo esterna, introducendo la dipendenza temporale. Questo secondo livello è trattato con un algoritmo a costo uniforme (IG-UCS) e include sia trasferimenti Lambert sia soluzioni single-moon come macro-trasferimenti, permettendo ai vincoli di filtrare le traiettorie ammissibili. L’intero metodo è valutato su due casi studio nel sistema di Saturno, con diverse pesature della funzione di costo, mostrando la capacità di generare in modo autonomo sequenze di flyby ad alta copertura e basso Delta V e di assemblare Tour multi-luna per le lune esterne del sistema.
A graph search approach for automated scientific Planetary Moon tour design with mission constraints
Persenico, Francesco
2024/2025
Abstract
Planetary Moon Tours are among the most challenging problems in mission analysis, as they require solving high-dimensional mixed-integer optimisation tasks over effectively unbounded design spaces. While recent automated approaches have focused on the "Endgame" case-orbit insertion around a single target moon-this work extends the scope by embedding mission constraints and science objectives directly into the optimisation process to enable automated Tour design. The proposed pipeline combines trajectory optimisation with feasibility considerations within a unified graph-based framework. Illustrative constraints include quantitative surface-coverage requirements and minimum/maximum flyby altitudes, while the structure remains general and can accommodate a broad range of design and operations requirements. The design space is discretised through resonant and non-resonant transfers, VILTs, COT sequences, and unpowered flybys, mapped on each moon's V-Infinity Globe. The first stage constructs and optimises single-moon phases in a Keplerian patched-conics 0-SOI model. A scalar edge cost, defined as a weighted combination of Delta V, ToF, and flyby surface coverage, enables the use of Dijkstra's algorithm to efficiently identify optimal sequences; coverage is computed via spherical surface partitioning. Optimal single-moon phases are then patched across moons through inter-moon Lambert arcs in an external graph structure, introducing time dependence via encounter longitude. This second framework is treated using a IG-UCS algorithm and includes both Lambert transfers and single-moon solutions as macro-transfers, allowing constraints to filter admissible trajectories early in the search. The pipeline is assessed on two Saturnian case studies across different cost-function weightings, showing that it can autonomously generate high-coverage, low-Delta V flyby sequences and assemble multi-moon Tours for the outer moons of the system.| File | Dimensione | Formato | |
|---|---|---|---|
|
2026_03_Persenico_Tesi_01.pdf
solo utenti autorizzati a partire dal 02/03/2027
Descrizione: Testo Tesi
Dimensione
96.77 MB
Formato
Adobe PDF
|
96.77 MB | Adobe PDF | Visualizza/Apri |
|
2026_03_Persenico_ExecutiveSummary_02.pdf
accessibile in internet per tutti
Descrizione: Executive Summary
Dimensione
15.07 MB
Formato
Adobe PDF
|
15.07 MB | Adobe PDF | Visualizza/Apri |
I documenti in POLITesi sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/10589/253553