Algorithm 1. Iterative search process of the CIB method.

Input: Θ, P, b0 Output: b*

1: (S, G) ← StructureAnalysis(Θ, P) 2: (D, C) ← DriftDiagnosis(Θ, P, S, G) 3: (δ, B) ← InitialCandidateGeneration(P, S, G, D, C, b0) 4: T ← TrajectoryEvaluation(B) 5: while EffectiveIntervalIsUnclear(B, T, C)  do 6:     B ← BoundaryExpansion(B, T, C) 7:     T ← TrajectoryEvaluation(B) 8: end while 9: I ← EffectiveIntervalDetermination(B, T, C) 10: BI ← SixCandidateRefinement(I, T, C) 11: TI ← TrajectoryEvaluation(BI) 12: bbest ← SixCandidateComparison(BI, TI, C) 13: BF ← FourCandidateRefinement(bbest, I) 14: TF ← TrajectoryEvaluation(BF) 15: b* ← FinalSelection(BF, TF, C, I)