Finding Plans and Heuristics with Spectral Graph Theory
Spectral graph theory considers the matrices associated with graphs and studies these matrices’ eigenvalues and eigenvectors. Spectral graph theory has app...
Recent posts
CARL – Solving Constrained Stochastic Shortest Path Problems with Scalarisation
Introducing CARL: a heuristic-search algorithm that solves Constrained Stochastic Shortest Path problems (CSSPs) optimally by solving a sequence of unconst...
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...
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...