Six satellites orbit a ring and we choose each one's phase. Ground targets sit at fixed longitudes with population weights, and a target's cost is the squared angular distance to its nearest satellite. Bunching the satellites leaves wide gaps over the unserved longitudes, so the optimum spreads them to cover the weighted targets, leaning toward the busy ones. Score is the weighted coverage cost, to minimise. 6-D.
| Algorithm | Cost | Evals |
|---|---|---|
| — no runs yet — | ||
The JS objective is a line-for-line port of
example_applications/satellite_phasing and agrees to floating-point
tolerance. Dots on the ring are satellites; the spokes are ground targets (longer =
higher population), each linked to its nearest satellite.