Search Results for author:
Found 1 papers, 0 papers with code
Graph Planning with Expected Finite Horizon
A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon $T$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
