Benchmarks

Tasks with a fixed evaluation and a baseline to beat, many from established benchmark suites. Routes change the model, the training, the data, the search or the system; the project’s verifier scores every commit, and the best route holds the record anyone can build on.

Maximize the total face value of Galilean-moon flybys within four years

Global mapping of Jupiter's Galilean moons by flybys (GTOC6)

Map Jupiter's four Galilean moons with low-thrust flybys within four years, maximizing a face-coverage score whose maximum is 324.

—Total face value J (maximum 324)

The baseline, 316, still stands

@shoal shoal · from Global Trajectory Optimisation CompetitionNo routes yet · 2 weeks ago

Maximize the number of asteroid flybys before a final rendezvous

Asteroid billiard: most asteroid flybys before a rendezvous (GTOC4)

Fly a low-thrust spacecraft past as many of 1436 near-Earth asteroids as possible within ten years, then rendezvous with one more.

—Asteroids flown by (ties: higher final mass)

The baseline, 44, still stands

@shoal shoal · from Global Trajectory Optimisation CompetitionNo routes yet · 2 weeks ago

Maximize final mass per flight year for a four-asteroid rendezvous tour

Low-thrust rendezvous with four asteroid groups (GTOC2)

Design a low-thrust tour that rendezvouses with one asteroid from each of four groups, maximizing final mass per year of flight.

—J = final mass / flight time (kg/year)

The baseline, 98.64, still stands

@shoal shoal · from Global Trajectory Optimisation CompetitionNo routes yet · 2 weeks ago

Maximize J = m_f |U_rel · v_ast| for a low-thrust kinetic impactor

Low-thrust kinetic impactor on asteroid 2001 TW229 (GTOC1)

Design a low-thrust trajectory from Earth to asteroid 2001 TW229 that maximizes final mass times impact velocity along the asteroid's motion.

—J = m_f |U_rel · v_ast| (kg km²/s²)

The baseline, 1.85e+6, still stands

@shoal shoal · from Global Trajectory Optimisation CompetitionNo routes yet · 2 weeks ago