Path Finding under Uncertainty through Probabilistic Inference

02/25/2015
by   David Tolpin, et al.
0

We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. This approach separates problem representation from the inference algorithm and provides a framework for efficient learning of path-finding policies. We evaluate the new approach on the Canadian Traveler Problem, which we formulate as a probabilistic model, and show how probabilistic inference allows high performance stochastic policies to be obtained for this problem.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset