**5. Conclusions**

We introduced new variants of the online *k*-CTP which find various important real-life applications. In these variants, the locations of the uncertain edges are known, where the traveling costs of these edges are unknown. We investigated both the single-agent and the multi-agent versions of the problem. We proposed a tight lower bound on the competitive ratio of deterministic online strategies and an optimal strategy for the single-agent problem that we call the S-*k*-CTP-U. We derived lower bounds on the competitive ratio of deterministic online strategies for the multi-agent problems called as the M-*k*-CTP-U-f and the M-*k*-CTP-U-l. Providing optimal strategies for the M-*k*-CTP-U-f and the M-*k*-CTP-U-l which match the proposed lower bounds can be considered as a future research direction. Analyzing the problem on special networks such as grid networks is another future research direction for these new variations.
