Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection

被引:0
作者
Sievers, Silvan [1 ]
Katz, Michael [2 ]
Sohrabi, Shirin [2 ]
Samulowitz, Horst [2 ]
Ferber, Patrick [1 ]
机构
[1] Univ Basel, Basel, Switzerland
[2] IBM Res, Yorktown Hts, NY USA
来源
THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2019年
基金
欧洲研究理事会;
关键词
COMPLEXITY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As classical planning is known to be computationally hard, no single planner is expected to work well across many planning domains. One solution to this problem is to use online portfolio planners that select a planner for a given task. These portfolios perform a classification task, a well-known and well-researched task in the field of machine learning. The classification is usually performed using a representation of planning tasks with a collection of hand-crafted statistical features. Recent techniques in machine learning that are based on automatic extraction of features have not been employed yet due to the lack of suitable representations of planning tasks. In this work, we alleviate this barrier. We suggest representing planning tasks by images, allowing to exploit arguably one of the most commonly used and best developed techniques in deep learning. We explore some of the questions that inevitably rise when applying such a technique, and present various ways of building practically useful online portfolio-based planners. An evidence of the usefulness of our proposed technique is a planner that won the cost-optimal track of the International Planning Competition 2018.
引用
收藏
页码:7715 / 7723
页数:9
相关论文
共 40 条
  • [1] [Anonymous], IBACOP IBACOP2 PLANN
  • [2] [Anonymous], 2011, P 25 AAAI C ART INT
  • [3] [Anonymous], 2012, ICAPS
  • [4] [Anonymous], 2013, P 4 WORKSH PLAN LEAR
  • [5] COMPLEXITY RESULTS FOR SAS(+) PLANNING
    BACKSTROM, C
    NEBEL, B
    [J]. COMPUTATIONAL INTELLIGENCE, 1995, 11 (04) : 625 - 655
  • [6] Bonet B., 2009, P ICAPS, P34
  • [7] THE COMPUTATIONAL-COMPLEXITY OF PROPOSITIONAL STRIPS PLANNING
    BYLANDER, T
    [J]. ARTIFICIAL INTELLIGENCE, 1994, 69 (1-2) : 165 - 204
  • [8] The IBaCoP Planning System: Instance-Based Configured Portfolios
    Cenamor, Isabel
    de la Rosa, Tomas
    Fernandez, Fernando
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2016, 56 : 657 - 691
  • [9] Cenamor Isabel, 2018, IPC 9 PLANN, P9
  • [10] An effective algorithm for hyperparameter optimization of neural networks
    Diaz, G. I.
    Fokoue-Nkoutche, A.
    Nannicini, G.
    Samulowitz, H.
    [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 2017, 61 (4-5)