Timeline for Trivial lower bounds for single point mass delta-v problems?
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Oct 11, 2020 at 15:03 | history | bounty ended | CommunityBot | ||
S Oct 11, 2020 at 15:03 | history | notice removed | CommunityBot | ||
Oct 5, 2020 at 14:55 | history | edited | SE - stop firing the good guys | CC BY-SA 4.0 |
simplified notation
|
Oct 5, 2020 at 14:54 | answer | added | SE - stop firing the good guys | timeline score: 3 | |
S Oct 3, 2020 at 13:10 | history | bounty started | SE - stop firing the good guys | ||
S Oct 3, 2020 at 13:10 | history | notice added | SE - stop firing the good guys | Draw attention | |
Sep 27, 2019 at 5:29 | comment | added | Magic Octopus Urn | You could, perhaps, calculate all possible transfers at a specified interval then iterate through them using an algorithm to decide which is most efficient. That's kind of a cop-out though, I'm sure there's a mathematical way to do it. | |
Sep 26, 2019 at 17:54 | comment | added | SE - stop firing the good guys | Only for planar, circular orbits. | |
Sep 26, 2019 at 17:38 | comment | added | Ingolifs | I'm no expert, but I would've thought the minimum delta V transfer around a non-gravitationally complex single mass in many cases would be your namesake. | |
Sep 26, 2019 at 15:00 | history | tweeted | twitter.com/StackSpaceExp/status/1177236506257309696 | ||
Sep 26, 2019 at 11:46 | history | asked | SE - stop firing the good guys | CC BY-SA 4.0 |