Graph Based (PO)MDP Planning

Planning involves reasoning about the future by considering actions and hypothesizing possible outcomes for each. This process branches out like a tree, growing exponentially in the horizon length. But does it have to be this way? In this project we develop graph based probabilistic planners that utilize the same outcomes over and over in a graph structure, as opposed to a tree, with finite-time performance guarantees.

Related Publications:

Conference Articles

  1. I. Lev-Yehudi and V. Indelman, “Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning,” in Conference on Neural Information Processing Systems (NeurIPS), Dec. 2026.
    arXiv: https://arxiv.org/pdf/2607.05359