Skip to main navigation Skip to search Skip to main content

Evaluating Planning Model Learning Algorithms

  • Roni Stern
  • , Leonardo Lamanna
  • , Argaman Mordoch
  • , Yarin Benyamin
  • , Pascal Lauer
  • , Brendan Juba
  • , Gregor Behnke
  • , Christian Muise
  • , Pascal Bercher
  • , Mauro Vallati
  • , Kai Xi
  • , Omar Wattad
  • , Omer Eliyahu

Research output: Contribution to conferenceAbstractpeer-review

Abstract

Formulating domain models for model-based planning is a challenging, time consuming, and error-prone task. A number of approaches have been proposed to automatically learn domain models from a given set of observations. A key question is how to compare models learned by different approaches. Currently, there are no standard evaluation metrics or benchmarks. In this paper, we describe a set of metrics designed to assess different characteristics of a learned domain model. We then present a benchmark suite based on domain models from the International Planning Competition (IPC) and an evaluation process for using it. Four domain model learning algorithms are evaluated on this benchmark, which highlights the importance of the diverse evaluation metrics we proposed.
Original languageEnglish
Number of pages9
Publication statusPublished - 10 Nov 2025
Event2025 Workshop on Knowledge Engineering for Planning and Scheduling - Melbourne, Australia
Duration: 10 Nov 202510 Nov 2025
https://icaps25.icaps-conference.org/program/workshops/keps/

Workshop

Workshop2025 Workshop on Knowledge Engineering for Planning and Scheduling
Abbreviated titleKEPS 2025
Country/TerritoryAustralia
CityMelbourne
Period10/11/2510/11/25
Internet address

Fingerprint

Dive into the research topics of 'Evaluating Planning Model Learning Algorithms'. Together they form a unique fingerprint.

Cite this