|
|
|
|
|
by gridspy
1774 days ago
|
|
If you can calculate dV requirements between any two given objects you can treat the orbital maneuvers required as a directed graph. Then you can apply an adapted travelling salesman algorithm or similar graph optimisation algorithms to choose rendezvous sequences for maximum impact. |
|