Noun
Canadian traveller problem
(computing theory) A generalization of the shortest path problem to graphs that are only partially observable (i.e. the graph is revealed while it is being explored).
The Canadian traveller problem and the stochastic shortest path problem are generalizations where either the graph isn't completely known to the mover, changes over time, or where actions (traversals) are probabilistic. Source: Internet