Editing Shortest path problem (section)

===Partial observability===
The [[Canadian traveller problem]] and the stochastic shortest path problem are generalizations where either the graph is not completely known to the mover, changes over time, or where actions (traversals) are probabilistic.<ref>{{cite journal |last1=Bar-Noy |first1=Amotz |last2=Schieber |first2=Baruch |title=The canadian traveller problem |journal=Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms |date=1991 |pages=261–270 |citeseerx=10.1.1.1088.3015 }}</ref><ref>{{cite conference |last1=Nikolova |first1=Evdokia |last2=Karger |first2=David R |title=Route planning under uncertainty: the Canadian traveller problem |book-title=Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI) |pages=969–974 |url=https://www.aaai.org/Papers/AAAI/2008/AAAI08-154.pdf |archive-url=https://ghostarchive.org/archive/20221009/https://www.aaai.org/Papers/AAAI/2008/AAAI08-154.pdf |archive-date=2022-10-09 |url-status=live}}</ref>