Algorithm 1 The proposed algorithm (see Table 1 for symbols meaning). Details on weighted comparisons are given in Equations (10)–(13).
Input: ωn−1, pn−1, history
Output: pn
1:	COP ← ComputeCOP (pn−1, ωn−1)
2:	${\overline{p}}_{\mathit{\text{IV F}}}^n\leftarrow \text{position of}\mathit{\text{max}}\{\mathit{\text{COP}}\}$
3:	p̂n ← Linear Prediction(history)
4:	$P_{\mathit{\text{IV F}}}\leftarrow P({\overline{p}}_{\mathit{\text{IV F}}}^n)$
5:	if PIV F > confidence level then
6:	$p^n\leftarrow {\overline{p}}_{\mathit{\text{IV F}}}^n$
7:	else
8:	δ ← 0.95
9:	repeat
10:	for all p : Cn(p) ≥ δ × max{COP} do
11:	if maxscore < ψ(p) then
12:	maxscore ← ψ(p)
13:	end if
14:	if maxTM < Tn(p) then
15:	maxTM ← Tn(p)
16:	${ṗ}_{TM}^n\leftarrow p$
17:	end if
18:	if maxP < P (p) ∨ maxPScore < ψ(p) then
19:	maxP ← P (p)
20:	${ṗ}_P^n\leftarrow p$
21:	end if
22:	end for
23:	if WeightedComparison_P_TM $\left({ṗ}_P^n,{ṗ}_{TM}^n\right)$ then
24:	$p^n\leftarrow {ṗ}_P^n$
25:	else
26:	if W eightedComparison_IV F _T M $\left({\overline{p}}_{\mathit{\text{IV F}}}^n,{ṗ}_{TM}^n\right)$ then
27:	$p^n\leftarrow {\overline{p}}_{\mathit{\text{IV F}}}^n$
28:	else
29:	$p^n\leftarrow {ṗ}_{TM}^n$
30:	end if
31:	end if
32:	δ ← δ − 0.2
33:	until maxscore ≥ ∊ ∨ δ ≤ 0
34:	end if