Research Article
A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
Algorithm 1
Iterative interpolation algorithm.
| Input: // the time window of the start time | | // the end time of the previous target | | // a maximum number of iterations | | pre // a desired precision | | output: // the earliest start time of the next target | | (1) ; if then return | | (2) ; if then return +∞ | | (3) to maxIter | | (4) | | (5) | | (6) if | | (7) else if then | | (8) else | | (9) | | (10) return |
|