paper-with-me

홈 › Papers

Deep Learning for Generalised Planning with Background Knowledge

2024-10-10 · Dillon Z. Chen, Rostislav Horčík, Gustav Šír

Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of architectures, or more pragmatically in an attempt to scale up solvers with learned domain knowledge. In practice, planning problems are easy to solve but hard to optimise. However, ML approaches still struggle to solve many problems that are often easy for both humans and classical planners. In this paper, we thus propose a new ML approach that allows users to specify background knowledge (BK) through Datalog rules to guide both the learning and planning processes in an integrated fashion. By incorporating BK, our approach bypasses the need to relearn how to solve problems from scratch and instead focuses the learning on plan quality optimisation. Experiments with BK demonstrate that our method successfully scales and learns to plan efficiently with high quality solutions from small training data generated in under 5 seconds.

📄 PDF Abstract BibTeX arXiv:2410.07923

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Learning

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음

Similar Papers 제목 키워드 기반

Satisficing and Optimal Generalised Planning via Goal Regression (Extended Version)

2025-11-14 · Dillon Z. Chen, Till Hofmann, Toryn Q. Klassen, Sheila A. McIlraith arxiv

Generalised planning (GP) refers to the task of synthesising programs that solve families of related planning problems. We introduce a novel, yet simple method for GP: given a set of training problems, for each problem, …

The Universal PDDL Domain

2024-10-28 · Patrik Haslum, Augusto B. Corrêa

In AI planning, it is common to distinguish between planning domains and problem instances, where a "domain" is generally understood as a set of related problem instances. This distinction is important, for example, in g…

ASNets: Deep Learning for Generalised Planning

2019-08-04 · Sam Toyer, Felipe Trevizan, Sylvie Thiébaux, Lexing Xie

In this paper, we discuss the learning of generalised policies for probabilistic and classical planning problems using Action Schema Networks (ASNets). The ASNet is a neural network architecture that exploits the relatio…

Deep LearningHeuristic Search

Action Schema Networks: Generalised Policies with Deep Learning

2017-09-13 · Sam Toyer, Felipe Trevizan, Sylvie Thiébaux, Lexing Xie

In this paper, we introduce the Action Schema Network (ASNet): a neural network architecture for learning generalised policies for probabilistic planning problems. By mimicking the relational structure of planning proble…

Deep Learning

iRoPro: An interactive Robot Programming Framework

2021-12-08 · Ying Siu Liang, Damien Pellier, Humbert Fiorino, Sylvie Pesty

The great diversity of end-user tasks ranging from manufacturing environments to personal homes makes pre-programming robots for general purpose applications extremely challenging. In fact, teaching robots new actions fr…