The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem

Authors

  • Malte Helmert Albert-Ludwigs-Universität Freiburg
  • Hauke Lasinger LemnaTec GmbH

DOI:

https://doi.org/10.1609/icaps.v20i1.13431

Keywords:

greenhouse logistics, application, benchmark, permutation puzzle, classical planning

Abstract

We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Scanalyzer domain is a permutation problem with striking similarities to common search benchmarks such as Rubik's Cube or TopSpin. At the same time, it is also a real application domain, and efficient algorithms for the problem are of considerable practical interest. The Scanalyzer domain was used as a benchmark for sequential planners at the last International Planning Competition. The competition results show that domain-independent automated planners can find solutions of comparable quality to those generated by specialized algorithms developed by domain experts, while being considerably more flexible.

Downloads

Published

2010-05-05

How to Cite

Helmert, M., & Lasinger, H. (2010). The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. Proceedings of the International Conference on Automated Planning and Scheduling, 20(1), 234-237. https://doi.org/10.1609/icaps.v20i1.13431