Seminar talk at the School of Computing and Information Systems, The University of Melbourne, on width-based planning for continuous and discrete sequential decision problems.
Width Based Planning searches for solutions through a general measure of state novelty. Performs well over black-box simulators and PDDL problems.
ICAPS 2017 talk on polynomial variants of best-first width search that outperform LAMA and FF empirically.
ICAPS 2013 Best Dissertation Award talk on reasoning-based approaches to classical planning and planning width.