Skip to main content
. 2025 Dec 11;25(24):7538. doi: 10.3390/s25247538
Algorithm 4 Baseline Greedy Scheduler (Earliest Contact)
  • Input: 

    Set of Nanosatellites S, Ground Station GS, Current Time Tnow, Prediction Horizon H

  • Output: 

    next_pass object selected for tracking

  •   1:

    overpasses ← GetUpcomingPasses(S,GS,Tnow,H)

  •   2:

    time_to_next_pass ← ∞

  •   3:

    next_pass ← NULL

  •   4:

    for all pass in overpasses do

  •   5:

        tstart← GetStartTime(pass)

  •   6:

        time_difference ←tstart−Tnow

  •   7:

        if time_difference < time_to_next_pass then

  •   8:

            time_to_next_pass ← time_difference

  •   9:

            next_pass ← pass

  • 10:

        end if

  • 11:

    end for

  • 12:

    return next_pass