Collect More of What Matters from Every Orbit

Satellite operators decide, pass by pass, which targets to collect and how to share capacity across a constellation. The number of feasible schedules explodes with every target and every pass. Planck finds schedules that meet every constraint, at sizes where standard solvers often fall short.

Talk to Planck

Earth Observation Mission Planning

The decision
Which targets each satellite collects on each pass.
What makes it hard
Target priority, viewing geometry, slew time, onboard memory and downlink windows, all at once.
Benefits
More high-priority targets collected on every pass, with plans that meet every constraint and are produced faster.
23.5% more high-priority targets, 39% faster than a classical solver (Gurobi), and every constraint met in all 100 test cases of 1,000 targets, against 68 for the classical solver.
Baseline
A classical solver (Gurobi) and simulated annealing on the same instances
Hardware
D-Wave quantum annealing
Source
Peer-reviewed, IEEE TQCEBT 2024

Satellite Network Resource Management

The decision
How to allocate beams, spectrum and capacity across a constellation as demand shifts.
What makes it hard
Coverage commitments, interference, power budgets and ground station availability change by the hour.
Benefits
Better use of beams, spectrum and capacity as demand shifts, with each allocation valued against the current one.

Other Solutions

Defense Energy and grid Logistics and field services Manufacturing Finance

Collect More From Every Pass

Planck schedules tasking across the constellation to capture more high-value collections with the same satellites and ground stations.

Talk to Planck
Talk to Planck Book 15 minutes with the founder