Industry-leading planning and heuristic search

ShortestPathLab is a research group at Monash University led by A/Prof Daniel Harabor for AI planning and heuristic search.

Latest publications

• 2024 / Avoiding Node Re-Expansions Can Break Symmetry Breaking

  • # untagged
  Carlson, M., Harabor, D., & Stuckey, P. J. (2024). Avoiding Node Re-Expansions Can Break Symmetry Breaking. Proceedings of the International Symposium on Combinatorial Search, 17, 20–27.
  BibtexPublisherPDF

• 2024 / Efficient and Exact Public Transport Routing via a Transfer Connection Database

  • # untagged
  Abuaisha, A., Wallace, M., Harabor, D., & Shen, B. (2024). Efficient and Exact Public Transport Routing via a Transfer Connection Database. Proceedings of the International Symposium on Combinatorial Search, 17, 2–10.
  BibtexPublisherPDF

• 2024 / Exact Multi-objective Path Finding with Negative Weights

  • # untagged
  Ahmadi, S., Sturtevant, N. R., Harabor, D., & Jalili, M. (2024). Exact Multi-objective Path Finding with Negative Weights. Proceedings of the International Conference on Automated Planning and Scheduling, 34, 11–19.
  BibtexPublisherPDF

News

• Using Posthoc with Piglet

  Sep 24, 2024, 07:12 PM

  Check out how to use Posthoc with the Piglet solver.

• Summer research scholarships 2024 applications now open!

  Aug 14, 2024, 06:39 AM

  If you're passionate about cutting-edge technology and want to dive deep into the world of pathfinding search, this is your chance to get hands-on experience with innovative research projects

• Welcome to the lab!

  Jul 5, 2024, 03:22 PM

  The shortest introduction to ShortestPathLab.