| Formally Verified Algorithms for Upper-Bounding State Space Diameters. | 0 | 0.34 | 2018 |
| A TIL-Relaxed Heuristic for Planning with Time Windows. | 0 | 0.34 | 2018 |
| Robot task planning and explanation in open and uncertain worlds | 28 | 1.12 | 2017 |
| A State-Space Acyclicity Property for Exponentially Tighter Plan Length Bounds. | 0 | 0.34 | 2017 |
| Exploiting symmetries by planning for a descriptive quotient | 0 | 0.34 | 2015 |
| A Study of Proxies for Shapley Allocations of Transport Costs. | 3 | 0.42 | 2014 |
| Computing upper bounds on lengths of transition sequences | 3 | 0.37 | 2013 |
| Implementation and comparison of solution methods for decision processes with non-markovian rewards | 4 | 0.44 | 2012 |
| Exploiting first-order regression in inductive policy selection | 25 | 1.07 | 2012 |
| A Switching Planner for Combined Task and Observation Planning. | 17 | 0.73 | 2011 |
| Exploiting probabilistic knowledge under uncertain sensing for efficient robot behaviour | 28 | 1.57 | 2011 |
| Decision-Theoretic Planning with non-Markovian Rewards | 0 | 0.34 | 2011 |
| Partial weighted MaxSAT for optimal planning | 8 | 0.50 | 2010 |
| SAT-Based Parallel Planning Using a Split Representation of Actions | 8 | 0.53 | 2009 |
| A Compact and Efficient SAT Encoding for Planning | 10 | 0.62 | 2008 |
| Combining Adaptive and Dynamic Local Search for Satisfiability | 16 | 0.80 | 2008 |
| A Stochastic Local Search Approach to Vertex Cover | 34 | 1.44 | 2007 |
| Advances in local search for satisfiability | 15 | 0.73 | 2007 |
| Gradient-Based Relational Reinforcement Learning of Temporally Extended Policies | 3 | 0.40 | 2007 |
| Decision-theoretic planning with non-Markovian rewards | 18 | 0.93 | 2006 |
| Engineering a conformant probabilistic planner | 4 | 0.41 | 2006 |
