rasmusmarak / TOSS

Trajectory Optimization for a Spacecraft Swarm Orbiting 67P/Churyumov-Gerasimenko.
GNU General Public License v3.0
3 stars 0 forks source link

Local -> Global Optimization #64

Open rasmusmarak opened 1 year ago

rasmusmarak commented 1 year ago

With the current setup, the optimization links like a chain: we optimize one spacecraft at a time, passing the updated tensor between them and thus reducing the search space for all upcoming optimization processes. In other words, we can view the complete process as indirectly maximizing the total coverage by minimizing overlapping trajectories for each spacecraft at a time. By doing so, it is evident that the solution will converge at some optima for the specific configuration, which is likely to be a local optima for the complete problem.

However, this dependency could potentially be avoided by introducing a master problem. The subproblem could, for instance, be to determine a set of optimized single spacecraft trajectories, where the master problem then finds the optimal combination w.r.t total coverage. What do you think? This may be unnecessary since the current setup will likely provide something good, just not optimal. I was perhaps just worried about the chain-like dependencies in the current structure.