Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty
Akihiro Kishimoto, Botea Adi, Elizabeth Daly · Frontiers in artificial intelligence and applications · 2016
Optimal multi-modal journey planning under uncertainty is a challenging problem, due in part to an increased branching factor generated by nondeterministic actions. Deterministic search, which ignores all uncertainty, can be much faster, but deterministic plans lack correctness and optimality guarantees in the uncertainty-aware domain.