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
相关论文
共 50 条
  • [21] Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints
    Edelkamp, Stefan
    ECAI 2006, PROCEEDINGS, 2006, 141 : 841 - 842
  • [22] Relational Affordance Learning for Task-Dependent Robot Grasping
    Antanas, Laura
    Dries, Anton
    Moreno, Plinio
    De Raedt, Luc
    INDUCTIVE LOGIC PROGRAMMING (ILP 2017), 2018, 10759 : 1 - 15
  • [23] A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs
    Backstrom, Christer
    Jonsson, Peter
    Ordyniak, Sebastian
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6126 - 6130
  • [24] Learning efficient task-dependent representations with synaptic plasticity
    Bredenberg, Colin
    Simoncelli, Eero P.
    Savin, Cristina
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [25] Factored Cost-Optimal Planning Using Message Passing Algorithms
    Jezequel, Loig
    Fabre, Eric
    FUNDAMENTA INFORMATICAE, 2015, 139 (04) : 369 - 401
  • [26] Heuristics for Cost-Optimal Classical Planning Based on Linear Programming
    Pommerening, Florian
    Roger, Gabriele
    Helmert, Malte
    Bonet, Blai
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4303 - 4309
  • [27] IMPROVED ICH CLASSIFICATION USING TASK-DEPENDENT LEARNING
    Bar, Amir
    Havakuk, Michal Mauda
    Turner, Yoni
    Safadi, Michal
    Elnekave, Eldad
    2019 IEEE 16TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI 2019), 2019, : 1567 - 1571
  • [28] Optimal task-dependent changes of bimanual feedback control and adaptation
    Diedrichsen, Jorn
    CURRENT BIOLOGY, 2007, 17 (19) : 1675 - 1679
  • [29] Cost-Optimal Maintenance Planning for Defects on Wind Turbine Blades
    Yang, Yi
    Sorensen, John Dalsgaard
    ENERGIES, 2019, 12 (06)
  • [30] Applying Anytime Heuristic Search to Cost-Optimal HTN Planning
    Menif, Alexandre
    Guettier, Christophe
    Jacopin, Eric
    Cazenave, Tristan
    COMPUTER GAMES (CGW 2017), 2018, 818 : 151 - 171