Skip to content

Research at St Andrews

Exploring instance generation for automated planning

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access permissions

Open

Abstract

Many of the core disciplines of artificial intelligence have sets of standard benchmark problems well known and widely used by the community when developing new algorithms. Constraint programming and automated planning are examples of these areas, where the behaviour of a new algorithm is measured by how it performs on these instances. Typically the efficiency of each solving method varies not only between problems, but also between instances of the same problem. Therefore, having a diverse set of instances is crucial to be able to effectively evaluate a new solving method. Current methods for automatic generation of instances for Constraint Programming problems start with a declarative model and search for instances with some desired attributes, such as hardness or size. We first explore the difficulties of adapting this approach to generate instances starting from problem specifications written in PDDL, the de-facto standard language of the automated planning community. We then propose a new approach where the whole planning problem description is modelled using Essence, an abstract modelling language that allows expressing high-level structures without committing to a particular low level representation in PDDL.
Close

Details

Original languageEnglish
Title of host publicationModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation
Number of pages17
Publication statusPublished - 7 Sep 2020

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Discriminating instance generation from abstract specifications: a case study with CP and MIP

    Akgün, Ö., Dang, N., Miguel, I., Salamon, A. Z., Spracklen, P. & Stone, C., 2020, Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 17th International Conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020, Proceedings. Hebrard, E. & Musliu, N. (eds.). Cham: Springer, p. 41-51 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12296 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. Instance generation via generator instances

    Akgun, O., Dang, N., Miguel, I. J., Salamon, A. Z. & Stone, C. L., 2019, Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings. Schiex, T. & de Givry, S. (eds.). Cham: Springer, p. 3-19 (Lecture Notes in Computer Science (Programming and Software Engineering); vol. 11802).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  3. Towards reformulating Essence specifications for robustness

    Akgün, Ö., Frisch, A. M., Gent, I. P., Jefferson, C., Miguel, I., Nightingale, P. & Salamon, A. Z., 25 Oct 2021, ModRef 2021 - The 20th workshop on Constraint Modelling and Reformulation (ModRef). 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Efficient incremental modelling and solving

    Koçak, G., Akgün, Ö., Dang, N. & Miguel, I., 7 Sep 2020, ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation. 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Towards portfolios of streamlined constraint models: a case study with the balanced academic curriculum problem

    Spracklen, P., Dang, N., Akgün, Ö. & Miguel, I., 7 Sep 2020, ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation. 17 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

ID: 274776491

Top