@misc{SchaepersNiemuellerLakemeyeretal.2018,
  author    = {Sch{\"a}pers, Bj{\"o}rn and Niemueller, Tim and Lakemeyer, Gerhard and Gebser, Martin and Schaub, Torsten H.},
  title     = {ASP-Based Time-Bounded Planning for Logistics Robots},
  series = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  journal   = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  issn      = {2334-0835},
  pages     = {509 -- 517},
  year      = {2018},
  abstract  = {Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics.},
  language  = {en}
}