Prospective Students

I'm always looking for excellent Honours, Masters and PhD students to work with on various research projects. My areas of interest are automated planning and scheduling, planning under uncertainty, and heuristic search. Here are some interesting topics that for projects:

Current Students

  • Mingyu Hao: PhD on Machine Learning Approached for Planning.
  • Johannes Schmalz: PhD on Planning under Uncertainty and Optimal Replanning.
  • Ryan Wang: Honours on Blending Search Algorithms with Learning Heuristics in Automated Planning.
  • Jerry Zhang: Honours on Learning Heuristics for Maximum Prrobability Problems in Planning.
  • Rongjian Su: COMP8800 project on Learning Generalized Policies for Planning Domains.

Previous/Past Students

  • Dillon Chen: Honours on GOOSE: Learning Heuristics and Parallelising Search for Grounded and Lifted Planning (2023).
  • Jerry Zhang: COMP3770 project on From Ranking to Planning: Evaluating Heuristic Synthesised by Ranking-SVM (2023).
  • Yutian Zhao: Honours on Combination of Planning and Learning (2021).
  • Dillon Chen: COMP3770 project on Multi-Objective Stochastic Shortest Path Problems (2022).
  • Hao Chen: Honours on Domain-Independent Heuristics for Multi-Objective Planning (2021).
  • Iain Guilliard: PhD on Mixed Integer Linear Programming for Traffic Signal Control (2020).
  • Johannes Schmalz: Honours on Replanning with Guarantees for Planning under Uncertainty (2021).
  • William Shen: Honours on Learning Heuristics for Planning with Hypergraph Networks (2019).
  • Ian Mallet: Honours on Progression Heuristics for Planning with Probabilistic LTL Constraints (2019).
  • William Shen: COMP3770 project on Action Schema Networks with Monte-Carlo Tree Search: The Best of Both Worlds (2018).
  • Allen Huang: COMP3770 project on Learning Generalized Policies for Numeric Planning (2018).
  • Sam Toyer: Honours on Generalised Policies for Probabilistic Planning with Deep Learning (2017).
  • Jonathan Tammen: Honours on Heuristic Search Algorithm for Constrained Shortest Path Problems (2016).
  • Iain Guilliard: ENGN8602 project on A Non-homogenous Time Mixed Integer LP Formulation for Traffic Signal Control (2015).
  • News and Highlights
    • GOOSE: First domain-independent method for learning heuristics based on lifted representations (AAAI'24).
    • CG-iLAO*: New planner for SSPs based on constraint generation (AAAI'24).
    • I was one of the organizers of GenPlan23 at NeurIPS.
    • First heuristic search algorithms for Multi-Objective Stochastic Planning (AAAI'23).
    • New admissible heuristics for Multi-Objective Deterministic Planning (ICAPS'22).
    • I gave an Early Career Researcher Spotlight talk at the IJCAI-20.
    • STRIPS-HGN: First algorithm capable of learning domain-independent heuristics from scratch (ICAPS'20).
    • ASNets: Learning generalized policies using neural nets (JAIR)
    • h-pom, h-roc, and i2-dual won the best paper award at ICAPS'17!
    • i-dual won the best paper award at ICAPS'16!