PhD Thesis – Planning Under Uncertainty with Techniques from Operations Research
The core idea of my thesis is to recognise connections between planning and operations research, and use these connections to define new planning algorithm...
Recent posts
Iterative Planning with MUGS Explanations: Exploring the Design Space
Consider an oversubscription planning problem (i.e., there are more goals that can be achieved simultaneously) and only a human expert can decide which sub...
Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems
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...
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...
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...