Consider an IVP $dx/dt = f(x, t)$, $t \in [0, T]$, $f(x, 0) = f_0$. An Adams-Bashforth method solves the IVP numerically by evaluating $g_x(t_n) := f(x, t)$ where $t_n = h * n$, $n \in [0, T / h]$, and importantly $h$ is constant.
How difficult would it be to adjust the Adams-Bashforth method, evaluating $g_x$ at arbitrary times $\tilde t_0 < \dots < \tilde t_N$. My motivation is that I can only evaluate $f$ for certain time values.
An example of this for the 2nd order Adams-Bashforth method is provided here: Using Adams-Bashforth-Moulton Predictor Corrector with Adaptive Step-size. Can this be "scaled" to arbitrary order methods?