Suppose you have a learned policy for a Fully Observable Non-deterministic (FOND) problem. How can you be sure that it is safe? One approach is via fault a...
Spectral graph theory considers the matrices associated with graphs and studies these matrices’ eigenvalues and eigenvectors. Spectral graph theory has app...
Introducing CARL: a heuristic-search algorithm that solves Constrained Stochastic Shortest Path problems (CSSPs) optimally by solving a sequence of unconst...
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* is a modification of the iLAO* algorithm, which is capable of using heuristics to ignore unpromising actions until they are needed. In our experim...