- Lambert's problem solver using universal variable method with bisection
(handles elliptic, parabolic, hyperbolic transfers + anti-podal cases)
- Transfer matrix: precompute pairwise station transfers over time window
using Lambert solver with configurable launch velocity
- Dijkstra routing on time-expanded graph (station × week nodes, transfer
+ wait edges) to find minimum-time routes
- Route Planner UI: from/to station dropdowns, search window selector
(1-10 years), "Find Optimal Route" button with results card
- Route visualization: orange dashed trajectory lines with arrow heads
and leg numbers on the 2D canvas
- Tested: Mercury L1 → Jupiter L1 computes 6-month direct transfer at
30 km/s — physically reasonable
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
scott
22dcc5b6ec