Finding Optimal Deterministic Policies for Constrained Stochastic Shortest Path Problems
We present a new algorithm for finding optimal deterministic policies for CSSPS called i2-dual-det and fill some technical gaps that have not been addresse...
Recent posts
CG-iLAO* – Efficient Constraint Generation for Stochastic Shortest Path Problems
CG-iLAO* is a modification of the iLAO* algorithm, which is capable of using heuristics to ignore unpromising actions until they are needed. In our experim...
CoGNeRe – Probabilistic Replanning with Guarantees
CoGNeRe is solver for probabilistic shortest path problems. Akin to other replanners like Robust-FF, CoGNeRe constructs a solution to the probabilistic pro...