Skip to main content
. 2026 Sep 25;26(19):6098. doi: 10.3390/s26196098
Algorithm 1 Adaptive Curriculum Learning
  • Require: Environment Env, success threshold ρ, buffer size N, curriculum levels L

  • Ensure: Curriculum level l, environment boundary Env.boundary

  •   1:

    Initialize l←0, τ←0, B←∅

  •   2:

    Set ρ←0.7, N←50, L←10, τmax←100

  •   3:

    α←linspace(0.3,1.0,L+1)

  •   4:

    Env.boundary ←α[l]

  •   5:

    for  step=1:TotalTimesteps  do

  •   6:

        if τ>0 then

  •   7:

            τ←τ−1

  •   8:

            Execute_PPO_Step()

  •   9:

            continue

  • 10:

        end if

  • 11:

        (done,is_success)← Execute_PPO_Step()

  • 12:

        if done then

  • 13:

            Add(B,is_success)

  • 14:

        end if

  • 15:

        if Size(B)≥N then

  • 16:

            Rsuccess←Mean(B)

  • 17:

            if Rsuccess≥ρ and l<L then

  • 18:

                l←l+1

  • 19:

                Env.boundary ←α[l]

  • 20:

                Clear(B)

  • 21:

                τ←τmax

  • 22:

            end if

  • 23:

        end if

  • 24:

    end for

  • 25:

    return l, Env.boundary