Felipe Trevizan

Felipe W. Trevizan

Senior Lecturer, School of Computing, ANU
Email:
Office:
Building 145, office 3.20
Australian National University Campus
Canberra ACT 2601, Australia

I am a Senior Lecturer at the Australian National University. My research interests lie at the intersection of Artificial Intelligence, Operations Research and Machine Learning including automated planning and scheduling, planning under uncertainty, heuristic search, and reinforcement learning.

Selected Publications (full list here)

  • Progression Heuristics for Planning with Probabilistic LTL Constraints. Mallet, I., Thiébaux, S. and Trevizan, F. In Proc. of 35th AAAI Conference on Artificial Intelligence. 2021. [pdf] [bib]
  • Domain-Independent Planning Heuristics with Hypergraph Networks. Shen, W., Trevizan, F. and Thiébaux, S. In Proc. of 30th Int. Conf. on Automated Planning and Scheduling (ICAPS). 2020. [pdf] [bib] [code]
  • ASNets: Deep Learning for Generalised Planning. Toyer, S., Thiébaux, S., Trevizan, F. and Xie, L. In Journal of Artificial Intelligence. 2020. [pdf] [bib] [code]
  • Occupation Measure Heuristics for Probabilistic Planning. Trevizan, F., Thiébaux, S. and Haslum, P. In Proc. of 27th Int. Conf. on Automated Planning and Scheduling (ICAPS). 2017. (Best Paper Award) [pdf] [bib]
  • Heuristic Search in Dual Space for Constrained Stochastic Shortest Path Problems. Trevizan, F., Thiébaux, S., Santana, P. and Williams, B. In Proc. of 26th Int. Conf. on Automated Planning and Scheduling (ICAPS). 2016. (Best Paper Award) [pdf] [bib]
  • A Non-homogeneous Time Mixed Integer LP Formulation for Traffic Signal Control. Guilliard, I., Sanner, S., Trevizan, F. and Williams, B. In Transport Research Record (TRR): Journal of the Transport Research Board. 2016. (Kikuchi-Karlaftis Best Paper Award) [pdf] [bib] [demo]

Teaching

  • News and Highlights
    • New heuristics for SSPs with PLTL constraints! This time based on progression (AAAI'21).
    • 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).
    • New insights and results for ASNets on JAIR
    • PLTL-dual: First heuristic search algorithm for SSPs and MDPs with Probabilistic LTL constraints (KR'18).
    • ASNets: Learning generalized policies for SSPs using neural nets (AAAI'18).
    • h-pom, h-roc, and i2-dual won the best paper award at ICAPS'17!
    • h-pom and h-roc: the first heuristics able to handle probabilities and costs for SSPs and C-SSPs (ICAPS'17).
    • i-dual won the best paper award at ICAPS'16!
    • QTM won the Kikuchi-Karlaftis best paper award at TRB'16! (demo).
  • Word cloud of my papers
  • wordcloud
    large wordcloud